/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:45:48,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:45:48,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:45:48,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:45:48,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:45:48,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:45:48,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:45:48,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:45:48,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:45:48,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:45:48,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:45:48,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:45:48,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:45:48,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:45:48,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:45:48,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:45:48,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:45:48,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:45:48,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:45:48,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:45:48,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:45:48,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:45:48,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:45:48,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:45:48,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:45:48,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:45:48,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:45:48,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:45:48,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:45:48,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:45:48,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:45:48,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:45:48,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:45:48,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:45:48,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:45:48,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:45:48,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:45:48,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:45:48,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:45:48,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:45:48,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:45:48,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:45:48,607 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:45:48,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:45:48,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:45:48,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:45:48,612 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:45:48,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:45:48,612 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:45:48,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:45:48,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:45:48,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:45:48,615 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:45:48,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:45:48,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:45:48,615 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:45:48,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:45:48,616 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:45:48,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:45:48,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:45:48,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:45:48,617 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:45:48,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:45:48,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:45:48,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:45:48,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:45:48,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:45:48,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:45:48,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:45:48,619 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:45:48,619 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:45:48,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:45:49,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:45:49,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:45:49,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:45:49,068 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:45:49,068 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:45:49,069 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i [2020-11-06 22:45:49,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f23a973/0ab0d3e3850342e1ac57dc4d1583a81b/FLAGd0889a8e4 [2020-11-06 22:45:49,738 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:45:49,739 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i [2020-11-06 22:45:49,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f23a973/0ab0d3e3850342e1ac57dc4d1583a81b/FLAGd0889a8e4 [2020-11-06 22:45:50,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f23a973/0ab0d3e3850342e1ac57dc4d1583a81b [2020-11-06 22:45:50,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:45:50,156 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:45:50,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:45:50,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:45:50,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:45:50,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:50" (1/1) ... [2020-11-06 22:45:50,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b835bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:50, skipping insertion in model container [2020-11-06 22:45:50,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:50" (1/1) ... [2020-11-06 22:45:50,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:45:50,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:45:50,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:45:50,402 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:45:50,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:45:50,447 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:45:50,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:50 WrapperNode [2020-11-06 22:45:50,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:45:50,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:45:50,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:45:50,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:45:50,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:50" (1/1) ... [2020-11-06 22:45:50,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:50" (1/1) ... [2020-11-06 22:45:50,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:50" (1/1) ... [2020-11-06 22:45:50,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:50" (1/1) ... [2020-11-06 22:45:50,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:50" (1/1) ... [2020-11-06 22:45:50,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:50" (1/1) ... [2020-11-06 22:45:50,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:50" (1/1) ... [2020-11-06 22:45:50,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:45:50,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:45:50,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:45:50,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:45:50,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:45:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:45:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:45:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:45:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-06 22:45:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-06 22:45:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:45:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:45:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:45:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-06 22:45:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-06 22:45:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:45:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:45:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-06 22:45:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-06 22:45:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-11-06 22:45:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:45:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:45:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:45:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:45:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:45:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:45:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:45:51,152 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:45:51,153 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-06 22:45:51,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:51 BoogieIcfgContainer [2020-11-06 22:45:51,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:45:51,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:45:51,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:45:51,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:45:51,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:45:50" (1/3) ... [2020-11-06 22:45:51,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609b28ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:51, skipping insertion in model container [2020-11-06 22:45:51,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:50" (2/3) ... [2020-11-06 22:45:51,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609b28ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:51, skipping insertion in model container [2020-11-06 22:45:51,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:51" (3/3) ... [2020-11-06 22:45:51,217 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i [2020-11-06 22:45:51,246 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:45:51,250 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:45:51,263 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:45:51,290 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:45:51,290 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:45:51,290 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:45:51,290 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:45:51,291 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:45:51,291 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:45:51,291 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:45:51,291 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:45:51,307 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-11-06 22:45:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-06 22:45:51,313 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:51,314 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:51,315 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:51,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:51,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1062743835, now seen corresponding path program 1 times [2020-11-06 22:45:51,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:51,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673997168] [2020-11-06 22:45:51,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:51,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:51,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:45:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:51,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:45:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:45:51,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673997168] [2020-11-06 22:45:51,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:51,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-06 22:45:51,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910591436] [2020-11-06 22:45:51,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:45:51,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:51,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:45:51,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-06 22:45:51,652 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2020-11-06 22:45:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:51,771 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2020-11-06 22:45:51,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:45:51,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-11-06 22:45:51,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:51,782 INFO L225 Difference]: With dead ends: 66 [2020-11-06 22:45:51,782 INFO L226 Difference]: Without dead ends: 30 [2020-11-06 22:45:51,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-06 22:45:51,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-11-06 22:45:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-11-06 22:45:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-06 22:45:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-11-06 22:45:51,834 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 24 [2020-11-06 22:45:51,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:51,834 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-11-06 22:45:51,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:45:51,835 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-11-06 22:45:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-06 22:45:51,837 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:51,837 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:51,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:45:51,838 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:51,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:51,839 INFO L82 PathProgramCache]: Analyzing trace with hash -351351529, now seen corresponding path program 1 times [2020-11-06 22:45:51,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:51,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81679317] [2020-11-06 22:45:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:52,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:52,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:45:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:52,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:45:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:45:52,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81679317] [2020-11-06 22:45:52,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:52,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:45:52,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370101486] [2020-11-06 22:45:52,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:45:52,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:52,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:45:52,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:45:52,088 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 9 states. [2020-11-06 22:45:52,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:52,493 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2020-11-06 22:45:52,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:45:52,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-11-06 22:45:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:52,496 INFO L225 Difference]: With dead ends: 41 [2020-11-06 22:45:52,496 INFO L226 Difference]: Without dead ends: 37 [2020-11-06 22:45:52,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:45:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-06 22:45:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2020-11-06 22:45:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-06 22:45:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2020-11-06 22:45:52,510 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 24 [2020-11-06 22:45:52,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:52,511 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2020-11-06 22:45:52,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:45:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-11-06 22:45:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-06 22:45:52,512 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:52,513 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:52,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:45:52,513 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:52,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:52,514 INFO L82 PathProgramCache]: Analyzing trace with hash -897618950, now seen corresponding path program 1 times [2020-11-06 22:45:52,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:52,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078721989] [2020-11-06 22:45:52,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:52,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:52,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:45:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:52,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:45:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:45:52,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078721989] [2020-11-06 22:45:52,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:52,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:45:52,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303431671] [2020-11-06 22:45:52,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:45:52,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:52,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:45:52,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:45:52,632 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2020-11-06 22:45:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:52,747 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-11-06 22:45:52,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:45:52,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-11-06 22:45:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:52,750 INFO L225 Difference]: With dead ends: 51 [2020-11-06 22:45:52,750 INFO L226 Difference]: Without dead ends: 39 [2020-11-06 22:45:52,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:45:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-06 22:45:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2020-11-06 22:45:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-06 22:45:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2020-11-06 22:45:52,761 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 26 [2020-11-06 22:45:52,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:52,761 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-11-06 22:45:52,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:45:52,761 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-11-06 22:45:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-06 22:45:52,763 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:52,763 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:52,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:45:52,763 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:52,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:52,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1278041966, now seen corresponding path program 1 times [2020-11-06 22:45:52,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:52,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325678092] [2020-11-06 22:45:52,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:53,634 WARN L194 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 73 [2020-11-06 22:45:53,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:53,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:45:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:53,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:45:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:53,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-06 22:45:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:53,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-11-06 22:45:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-06 22:45:53,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325678092] [2020-11-06 22:45:53,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790964476] [2020-11-06 22:45:53,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:45:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:54,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 31 conjunts are in the unsatisfiable core [2020-11-06 22:45:54,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:45:57,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:45:57,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:45:57,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:45:57,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:45:57,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:45:57,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:45:57,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:45:57,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:45:57,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:45:57,535 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-06 22:45:57,536 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:45:57,550 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-06 22:45:57,550 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:45:57,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:45:57,573 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-06 22:45:57,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:45:57,586 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-06 22:45:57,596 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-06 22:45:57,625 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-06 22:45:57,633 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 14 [2020-11-06 22:45:57,634 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-06 22:45:57,650 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-06 22:45:57,650 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-06 22:45:57,767 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2020-11-06 22:45:57,769 INFO L625 ElimStorePlain]: treesize reduction 42, result has 60.7 percent of original size [2020-11-06 22:45:57,777 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:45:57,777 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:609, output treesize:7 [2020-11-06 22:45:57,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-06 22:45:57,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:45:58,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:45:58,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:45:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 1 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-06 22:45:58,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:45:58,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2020-11-06 22:45:58,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357631648] [2020-11-06 22:45:58,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-06 22:45:58,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:58,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-06 22:45:58,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=379, Unknown=1, NotChecked=0, Total=462 [2020-11-06 22:45:58,255 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 22 states. [2020-11-06 22:46:07,651 WARN L194 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 33 [2020-11-06 22:46:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:16,173 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2020-11-06 22:46:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-06 22:46:16,238 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2020-11-06 22:46:16,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:16,239 INFO L225 Difference]: With dead ends: 44 [2020-11-06 22:46:16,239 INFO L226 Difference]: Without dead ends: 0 [2020-11-06 22:46:16,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=161, Invalid=766, Unknown=3, NotChecked=0, Total=930 [2020-11-06 22:46:16,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-06 22:46:16,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-06 22:46:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-06 22:46:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-06 22:46:16,244 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2020-11-06 22:46:16,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:16,245 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-06 22:46:16,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-06 22:46:16,245 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-06 22:46:16,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-06 22:46:16,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:46:16,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-06 22:46:18,757 WARN L194 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2020-11-06 22:46:21,123 WARN L194 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 44 [2020-11-06 22:46:21,125 INFO L266 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-11-06 22:46:21,126 INFO L266 CegarLoopResult]: For program point L18-2(line 18) no Hoare annotation was computed. [2020-11-06 22:46:21,127 INFO L266 CegarLoopResult]: For program point reach_errorEXIT(line 18) no Hoare annotation was computed. [2020-11-06 22:46:21,127 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 18) the Hoare annotation is: true [2020-11-06 22:46:21,127 INFO L266 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed. [2020-11-06 22:46:21,128 INFO L266 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:46:21,128 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2020-11-06 22:46:21,128 INFO L266 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:46:21,128 INFO L266 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:46:21,129 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-06 22:46:21,129 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-06 22:46:21,129 INFO L266 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:46:21,129 INFO L269 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 20 22) the Hoare annotation is: true [2020-11-06 22:46:21,130 INFO L266 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-11-06 22:46:21,130 INFO L266 CegarLoopResult]: For program point L21-2(lines 20 22) no Hoare annotation was computed. [2020-11-06 22:46:21,130 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 20 22) no Hoare annotation was computed. [2020-11-06 22:46:21,130 INFO L266 CegarLoopResult]: For program point mainEXIT(lines 33 61) no Hoare annotation was computed. [2020-11-06 22:46:21,130 INFO L262 CegarLoopResult]: At program point L54-2(lines 54 58) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |main_~#array~0.base|)) (.cse3 (= |main_~#array~0.offset| 0))) (or (let ((.cse1 (mod main_~index2~0 4294967296)) (.cse0 (mod main_~index1~0 4294967296))) (and (< .cse0 .cse1) (< .cse1 100000) (= (mod (select .cse2 (+ (* .cse1 4) |main_~#array~0.offset|)) 4294967296) (mod (select .cse2 (+ (* .cse0 4) |main_~#array~0.offset|)) 4294967296)) .cse3)) (let ((.cse4 (mod (+ main_~index1~0 4294967295) 4294967296)) (.cse5 (mod (+ main_~index2~0 1) 4294967296))) (and (= (mod (select .cse2 (+ (* .cse4 4) |main_~#array~0.offset|)) 4294967296) (mod (select .cse2 (+ (* .cse5 4) |main_~#array~0.offset|)) 4294967296)) .cse3 (< .cse4 .cse5) (< .cse5 100000))))) [2020-11-06 22:46:21,131 INFO L262 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~index2~0 4294967296)))) (and (= |main_~#array~0.offset| 0) (<= main_~index2~0 (+ .cse0 99999)) (<= (+ .cse0 main_~index1~0 1) (+ (* 4294967296 (div main_~index1~0 4294967296)) main_~index2~0)))) [2020-11-06 22:46:21,131 INFO L266 CegarLoopResult]: For program point L46-1(line 46) no Hoare annotation was computed. [2020-11-06 22:46:21,134 INFO L266 CegarLoopResult]: For program point mainFINAL(lines 33 61) no Hoare annotation was computed. [2020-11-06 22:46:21,134 INFO L262 CegarLoopResult]: At program point mainENTRY(lines 33 61) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2020-11-06 22:46:21,135 INFO L262 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (let ((.cse1 (mod (+ main_~index1~0 4294967295) 4294967296)) (.cse2 (mod (+ main_~index2~0 1) 4294967296)) (.cse4 (* 4294967296 (div |main_#t~mem10| 4294967296))) (.cse3 (+ (* 4294967296 (div |main_#t~mem9| 4294967296)) |main_#t~mem10|))) (and (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse0 (+ (* .cse1 4) |main_~#array~0.offset|)) 4294967296) (mod (select .cse0 (+ (* .cse2 4) |main_~#array~0.offset|)) 4294967296))) (= |main_~#array~0.offset| 0) (< .cse3 (+ |main_#t~mem9| .cse4 1)) (< .cse1 .cse2) (< .cse2 100000) (<= (+ |main_#t~mem9| .cse4) .cse3))) [2020-11-06 22:46:21,135 INFO L266 CegarLoopResult]: For program point L55-1(line 55) no Hoare annotation was computed. [2020-11-06 22:46:21,135 INFO L266 CegarLoopResult]: For program point L53(lines 53 59) no Hoare annotation was computed. [2020-11-06 22:46:21,135 INFO L262 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |main_~#array~0.base|)) (.cse1 (* 4294967296 (div main_~index2~0 4294967296)))) (and (= |main_#t~mem6| (select .cse0 (+ (* (mod main_~index2~0 4294967296) 4) |main_~#array~0.offset|))) (= (select .cse0 (+ (* (mod main_~index1~0 4294967296) 4) |main_~#array~0.offset|)) |main_#t~mem5|) (= |main_~#array~0.offset| 0) (<= main_~index2~0 (+ .cse1 99999)) (<= (+ .cse1 main_~index1~0 1) (+ (* 4294967296 (div main_~index1~0 4294967296)) main_~index2~0)))) [2020-11-06 22:46:21,135 INFO L266 CegarLoopResult]: For program point L47-1(line 47) no Hoare annotation was computed. [2020-11-06 22:46:21,136 INFO L262 CegarLoopResult]: At program point L45-1(lines 43 51) the Hoare annotation is: (let ((.cse3 (= |main_~#array~0.offset| 0))) (or (let ((.cse1 (mod (+ main_~index1~0 4294967295) 4294967296)) (.cse2 (mod (+ main_~index2~0 1) 4294967296))) (and (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse0 (+ (* .cse1 4) |main_~#array~0.offset|)) 4294967296) (mod (select .cse0 (+ (* .cse2 4) |main_~#array~0.offset|)) 4294967296))) .cse3 (< .cse1 .cse2) (< .cse2 100000))) (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) .cse3 (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (= main_~loop_entered~0 0)))) [2020-11-06 22:46:21,136 INFO L262 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (= |main_~#array~0.offset| 0) (= main_~loop_entered~0 0)) [2020-11-06 22:46:21,136 INFO L266 CegarLoopResult]: For program point L45-2(lines 34 61) no Hoare annotation was computed. [2020-11-06 22:46:21,136 INFO L262 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (= main_~loop_entered~0 0)) [2020-11-06 22:46:21,136 INFO L266 CegarLoopResult]: For program point L41-1(line 41) no Hoare annotation was computed. [2020-11-06 22:46:21,136 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 23 29) the Hoare annotation is: true [2020-11-06 22:46:21,137 INFO L262 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2020-11-06 22:46:21,137 INFO L266 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 23 29) no Hoare annotation was computed. [2020-11-06 22:46:21,137 INFO L266 CegarLoopResult]: For program point L25(lines 25 27) no Hoare annotation was computed. [2020-11-06 22:46:21,138 INFO L266 CegarLoopResult]: For program point L26-1(line 26) no Hoare annotation was computed. [2020-11-06 22:46:21,139 INFO L266 CegarLoopResult]: For program point L25-2(lines 23 29) no Hoare annotation was computed. [2020-11-06 22:46:21,151 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,154 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,170 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:46:21 BoogieIcfgContainer [2020-11-06 22:46:21,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:46:21,179 INFO L168 Benchmark]: Toolchain (without parser) took 31040.60 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 126.5 MB in the beginning and 106.5 MB in the end (delta: 20.1 MB). Peak memory consumption was 50.9 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:21,180 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 123.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:46:21,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.02 ms. Allocated memory is still 151.0 MB. Free memory was 125.9 MB in the beginning and 116.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:21,182 INFO L168 Benchmark]: Boogie Preprocessor took 43.55 ms. Allocated memory is still 151.0 MB. Free memory was 115.9 MB in the beginning and 114.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:21,183 INFO L168 Benchmark]: RCFGBuilder took 661.90 ms. Allocated memory is still 151.0 MB. Free memory was 114.4 MB in the beginning and 98.6 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:21,184 INFO L168 Benchmark]: TraceAbstraction took 29995.27 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 134.1 MB in the beginning and 106.5 MB in the end (delta: 27.7 MB). Peak memory consumption was 57.7 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:21,190 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 123.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 286.02 ms. Allocated memory is still 151.0 MB. Free memory was 125.9 MB in the beginning and 116.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.55 ms. Allocated memory is still 151.0 MB. Free memory was 115.9 MB in the beginning and 114.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 661.90 ms. Allocated memory is still 151.0 MB. Free memory was 114.4 MB in the beginning and 98.6 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 29995.27 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 134.1 MB in the beginning and 106.5 MB in the end (delta: 27.7 MB). Peak memory consumption was 57.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 43]: Loop Invariant [2020-11-06 22:46:21,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((unknown-#memory_int-unknown[array][(index1 + 4294967295) % 4294967296 * 4 + array] % 4294967296 == unknown-#memory_int-unknown[array][(index2 + 1) % 4294967296 * 4 + array] % 4294967296 && array == 0) && (index1 + 4294967295) % 4294967296 < (index2 + 1) % 4294967296) && (index2 + 1) % 4294967296 < 100000) || (((index1 <= 4294967296 * (index1 / 4294967296) + 99999 && array == 0) && index2 <= 4294967296 * (index2 / 4294967296) + 99999) && loop_entered == 0) - InvariantResult [Line: 54]: Loop Invariant [2020-11-06 22:46:21,202 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:46:21,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((index1 % 4294967296 < index2 % 4294967296 && index2 % 4294967296 < 100000) && unknown-#memory_int-unknown[array][index2 % 4294967296 * 4 + array] % 4294967296 == unknown-#memory_int-unknown[array][index1 % 4294967296 * 4 + array] % 4294967296) && array == 0) || (((unknown-#memory_int-unknown[array][(index1 + 4294967295) % 4294967296 * 4 + array] % 4294967296 == unknown-#memory_int-unknown[array][(index2 + 1) % 4294967296 * 4 + array] % 4294967296 && array == 0) && (index1 + 4294967295) % 4294967296 < (index2 + 1) % 4294967296) && (index2 + 1) % 4294967296 < 100000) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 25.1s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 107 SDtfs, 85 SDslu, 189 SDs, 0 SdLazy, 408 SolverSat, 64 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 34 PreInvPairs, 43 NumberOfFragments, 408 HoareAnnotationTreeSize, 34 FomulaSimplifications, 184 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 157 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 73270 SizeOfPredicates, 13 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 40/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...