java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:46:35,054 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:46:35,055 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:46:35,067 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:46:35,067 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:46:35,068 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:46:35,069 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:46:35,070 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:46:35,071 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:46:35,072 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:46:35,073 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:46:35,073 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:46:35,074 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:46:35,075 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:46:35,076 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:46:35,077 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:46:35,079 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:46:35,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:46:35,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:46:35,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:46:35,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:46:35,084 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:46:35,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:46:35,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:46:35,086 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:46:35,087 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:46:35,087 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:46:35,088 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:46:35,088 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:46:35,088 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:46:35,089 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:46:35,089 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 09:46:35,098 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:46:35,098 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:46:35,099 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:46:35,099 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:46:35,100 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:46:35,100 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:46:35,100 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:46:35,100 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:46:35,100 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:46:35,100 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:46:35,100 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:46:35,100 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:46:35,100 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:46:35,100 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:46:35,100 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:46:35,101 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:46:35,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:46:35,101 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:46:35,101 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:46:35,101 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:46:35,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:46:35,101 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:46:35,101 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:46:35,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:46:35,133 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:46:35,136 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:46:35,137 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:46:35,137 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:46:35,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:46:35,270 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:46:35,271 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:46:35,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:46:35,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:46:35,276 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:46:35,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:46:35" (1/1) ... [2018-02-02 09:46:35,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eeddf32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:35, skipping insertion in model container [2018-02-02 09:46:35,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:46:35" (1/1) ... [2018-02-02 09:46:35,289 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:46:35,318 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:46:35,407 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:46:35,420 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:46:35,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:35 WrapperNode [2018-02-02 09:46:35,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:46:35,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:46:35,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:46:35,427 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:46:35,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:35" (1/1) ... [2018-02-02 09:46:35,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:35" (1/1) ... [2018-02-02 09:46:35,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:35" (1/1) ... [2018-02-02 09:46:35,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:35" (1/1) ... [2018-02-02 09:46:35,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:35" (1/1) ... [2018-02-02 09:46:35,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:35" (1/1) ... [2018-02-02 09:46:35,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:35" (1/1) ... [2018-02-02 09:46:35,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:46:35,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:46:35,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:46:35,455 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:46:35,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:35" (1/1) ... No working directory specified, using /home/ultimate/work/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 [2018-02-02 09:46:35,492 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:46:35,492 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:46:35,492 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:46:35,492 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:46:35,493 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:46:35,493 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:46:35,493 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:46:35,493 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:46:35,493 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:46:35,493 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:46:35,494 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:46:35,494 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:46:35,618 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:46:35,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:46:35 BoogieIcfgContainer [2018-02-02 09:46:35,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:46:35,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:46:35,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:46:35,622 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:46:35,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:46:35" (1/3) ... [2018-02-02 09:46:35,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b16d30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:46:35, skipping insertion in model container [2018-02-02 09:46:35,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:35" (2/3) ... [2018-02-02 09:46:35,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b16d30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:46:35, skipping insertion in model container [2018-02-02 09:46:35,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:46:35" (3/3) ... [2018-02-02 09:46:35,624 INFO L107 eAbstractionObserver]: Analyzing ICFG add_last-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:46:35,629 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:46:35,634 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-02-02 09:46:35,665 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:46:35,665 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:46:35,665 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:46:35,665 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:46:35,665 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:46:35,666 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:46:35,666 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:46:35,666 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:46:35,667 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:46:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-02-02 09:46:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 09:46:35,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:35,688 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:35,689 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:35,693 INFO L82 PathProgramCache]: Analyzing trace with hash 756039163, now seen corresponding path program 1 times [2018-02-02 09:46:35,742 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:35,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:35,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:46:35,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:46:35,869 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:35,870 INFO L182 omatonBuilderFactory]: Interpolants [41#true, 42#false, 43#(= 1 (select |#valid| |main_#t~malloc1.base|)), 44#(= 1 (select |#valid| main_~arr~0.base)), 45#(= 1 (select |#valid| main_~a~0.base))] [2018-02-02 09:46:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:35,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:46:35,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:46:35,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:46:35,882 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-02-02 09:46:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:35,968 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-02-02 09:46:35,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:46:35,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-02-02 09:46:35,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:36,019 INFO L225 Difference]: With dead ends: 33 [2018-02-02 09:46:36,020 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 09:46:36,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:46:36,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 09:46:36,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-02 09:46:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-02 09:46:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-02-02 09:46:36,053 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 12 [2018-02-02 09:46:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:36,053 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-02-02 09:46:36,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:46:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-02-02 09:46:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 09:46:36,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:36,054 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:36,054 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:36,055 INFO L82 PathProgramCache]: Analyzing trace with hash 756039164, now seen corresponding path program 1 times [2018-02-02 09:46:36,056 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:36,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:36,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:46:36,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:46:36,143 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:36,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:36,143 INFO L182 omatonBuilderFactory]: Interpolants [113#true, 114#false, 115#(<= 1 main_~length~0), 116#(and (= 0 |main_#t~malloc1.offset|) (<= 4 (select |#length| |main_#t~malloc1.base|))), 117#(and (= 0 main_~arr~0.offset) (<= 4 (select |#length| main_~arr~0.base))), 118#(and (= main_~a~0.offset 0) (<= 4 (select |#length| main_~a~0.base)))] [2018-02-02 09:46:36,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:36,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:46:36,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:46:36,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:46:36,145 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 6 states. [2018-02-02 09:46:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:36,268 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-02 09:46:36,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:46:36,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-02-02 09:46:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:36,270 INFO L225 Difference]: With dead ends: 45 [2018-02-02 09:46:36,270 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 09:46:36,271 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:46:36,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 09:46:36,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2018-02-02 09:46:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 09:46:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-02-02 09:46:36,274 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 12 [2018-02-02 09:46:36,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:36,277 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-02-02 09:46:36,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:46:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-02-02 09:46:36,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:46:36,277 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:36,278 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:36,278 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:36,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1962282239, now seen corresponding path program 1 times [2018-02-02 09:46:36,279 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:36,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:36,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:46:36,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:46:36,336 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:36,336 INFO L182 omatonBuilderFactory]: Interpolants [211#true, 212#false, 213#(not (= 0 |main_#t~malloc1.base|)), 214#(not (= 0 main_~arr~0.base))] [2018-02-02 09:46:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:36,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:46:36,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:46:36,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:46:36,337 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 4 states. [2018-02-02 09:46:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:36,362 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-02-02 09:46:36,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:46:36,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 09:46:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:36,363 INFO L225 Difference]: With dead ends: 35 [2018-02-02 09:46:36,364 INFO L226 Difference]: Without dead ends: 35 [2018-02-02 09:46:36,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:46:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-02 09:46:36,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-02 09:46:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-02 09:46:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-02-02 09:46:36,368 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 13 [2018-02-02 09:46:36,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:36,368 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-02-02 09:46:36,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:46:36,368 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-02-02 09:46:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:46:36,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:36,370 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:36,370 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:36,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1962377572, now seen corresponding path program 1 times [2018-02-02 09:46:36,371 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:36,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:36,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:46:36,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:46:36,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:36,481 INFO L182 omatonBuilderFactory]: Interpolants [288#false, 289#(<= 1 main_~length~0), 290#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|) (<= 1 main_~length~0)), 291#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (<= 1 main_~length~0)), 287#true] [2018-02-02 09:46:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:36,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:46:36,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:46:36,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:46:36,482 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2018-02-02 09:46:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:36,531 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-02-02 09:46:36,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:46:36,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-02 09:46:36,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:36,533 INFO L225 Difference]: With dead ends: 33 [2018-02-02 09:46:36,535 INFO L226 Difference]: Without dead ends: 33 [2018-02-02 09:46:36,535 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:46:36,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-02 09:46:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-02-02 09:46:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-02 09:46:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-02-02 09:46:36,540 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 13 [2018-02-02 09:46:36,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:36,541 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-02-02 09:46:36,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:46:36,541 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-02-02 09:46:36,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 09:46:36,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:36,541 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:36,542 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:36,542 INFO L82 PathProgramCache]: Analyzing trace with hash -676062270, now seen corresponding path program 1 times [2018-02-02 09:46:36,543 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:36,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:36,608 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:46:36,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:46:36,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:36,609 INFO L182 omatonBuilderFactory]: Interpolants [360#true, 361#false, 362#(= |#valid| |old(#valid)|), 363#(= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))] [2018-02-02 09:46:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:36,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:46:36,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:46:36,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:46:36,610 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 4 states. [2018-02-02 09:46:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:36,639 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-02 09:46:36,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:46:36,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-02 09:46:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:36,640 INFO L225 Difference]: With dead ends: 32 [2018-02-02 09:46:36,640 INFO L226 Difference]: Without dead ends: 28 [2018-02-02 09:46:36,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:46:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-02 09:46:36,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-02 09:46:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-02 09:46:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-02-02 09:46:36,642 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 18 [2018-02-02 09:46:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:36,643 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-02-02 09:46:36,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:46:36,643 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-02-02 09:46:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:46:36,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:36,643 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:36,643 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:36,643 INFO L82 PathProgramCache]: Analyzing trace with hash 236614827, now seen corresponding path program 1 times [2018-02-02 09:46:36,644 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:36,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:36,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:46:36,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:46:36,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:36,822 INFO L182 omatonBuilderFactory]: Interpolants [432#(and (or (and (<= main_~length~0 1) (= main_~arr~0.offset 0)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) 4)) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) 4)) (and (= (+ main_~a~0.offset 4) (+ main_~arr~0.offset (* 4 main_~length~0))) (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base)))), 433#(and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) 4)), 426#true, 427#false, 428#(<= main_~length~0 1), 429#(and (<= main_~length~0 1) (= 0 |main_#t~malloc1.offset|)), 430#(and (<= main_~length~0 1) (= main_~arr~0.offset 0)), 431#(and (or (and (<= main_~length~0 1) (= main_~arr~0.offset 0)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) 4)) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) 4)) (and (= (+ main_~a~0.offset 4) (+ main_~arr~0.offset (* 4 main_~length~0))) (= main_~arr~0.base main_~a~0.base))))] [2018-02-02 09:46:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:36,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:46:36,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:46:36,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:46:36,823 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 8 states. [2018-02-02 09:46:36,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:36,973 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-02-02 09:46:36,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:46:36,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-02 09:46:36,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:36,974 INFO L225 Difference]: With dead ends: 35 [2018-02-02 09:46:36,974 INFO L226 Difference]: Without dead ends: 28 [2018-02-02 09:46:36,974 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:46:36,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-02 09:46:36,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-02 09:46:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-02 09:46:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-02-02 09:46:36,976 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 20 [2018-02-02 09:46:36,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:36,976 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-02-02 09:46:36,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:46:36,976 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-02-02 09:46:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:46:36,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:36,976 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:36,976 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:36,976 INFO L82 PathProgramCache]: Analyzing trace with hash -774502423, now seen corresponding path program 1 times [2018-02-02 09:46:36,977 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:36,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:37,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:37,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:46:37,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:37,178 INFO L182 omatonBuilderFactory]: Interpolants [512#(and (= main_~arr~0.base main_~a~0.base) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0) (< 1 main_~length~0)), 513#(and (= main_~a~0.offset 0) (<= 8 (select |#length| main_~a~0.base))), 514#(and (<= 4 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base))), 505#true, 506#false, 507#(= 0 |main_#t~malloc1.offset|), 508#(= main_~arr~0.offset 0), 509#(and (= main_~arr~0.base main_~a~0.base) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 510#(and (= main_~arr~0.base main_~a~0.base) (= main_~a~0.offset 0) (= main_~arr~0.offset 0) (or (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) 4)))), 511#(and (or (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) 4)) (< 1 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= main_~a~0.offset 0) (= main_~arr~0.offset 0) (or (<= main_~length~0 1) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (select |#length| main_~arr~0.base))))] [2018-02-02 09:46:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:37,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:46:37,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:46:37,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:46:37,179 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 10 states. [2018-02-02 09:46:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:37,277 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-02-02 09:46:37,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:46:37,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-02-02 09:46:37,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:37,278 INFO L225 Difference]: With dead ends: 37 [2018-02-02 09:46:37,278 INFO L226 Difference]: Without dead ends: 37 [2018-02-02 09:46:37,279 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:46:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-02 09:46:37,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-02-02 09:46:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 09:46:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-02-02 09:46:37,282 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 20 [2018-02-02 09:46:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:37,282 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-02-02 09:46:37,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:46:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-02-02 09:46:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:46:37,283 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:37,283 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:37,283 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:37,283 INFO L82 PathProgramCache]: Analyzing trace with hash 476184984, now seen corresponding path program 2 times [2018-02-02 09:46:37,284 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:37,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:37,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:37,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 09:46:37,643 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:37,643 INFO L182 omatonBuilderFactory]: Interpolants [608#(and (<= main_~a~0.offset 4) (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0)))), 609#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 4 main_~a~0.offset)), 610#(and (<= 8 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base))), 600#true, 601#false, 602#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 603#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 604#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 605#(and (= main_~a~0.base main_~arr~0.base) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= 4 main_~a~0.offset) (or (<= main_~a~0.offset 4) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)))), 606#(and (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base))) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= main_~a~0.offset 4) (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0)))))), 607#(and (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset)))) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= main_~a~0.offset 4) (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0))))))] [2018-02-02 09:46:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:37,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:46:37,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:46:37,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:46:37,644 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 11 states. [2018-02-02 09:46:37,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:37,878 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-02-02 09:46:37,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:46:37,878 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-02-02 09:46:37,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:37,879 INFO L225 Difference]: With dead ends: 45 [2018-02-02 09:46:37,879 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 09:46:37,879 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:46:37,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 09:46:37,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-02-02 09:46:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 09:46:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-02-02 09:46:37,881 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 28 [2018-02-02 09:46:37,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:37,881 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-02-02 09:46:37,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:46:37,881 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-02-02 09:46:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 09:46:37,882 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:37,882 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:37,882 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:37,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1767056313, now seen corresponding path program 3 times [2018-02-02 09:46:37,883 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:37,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:38,315 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:38,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:38,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 09:46:38,316 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:38,317 INFO L182 omatonBuilderFactory]: Interpolants [720#(and (or (and (or (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= main_~a~0.offset 8) (< 3 main_~length~0))) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base))) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.base main_~a~0.base) (= main_~arr~0.offset 0)), 721#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= main_~a~0.offset 8) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 3 main_~length~0))) (= main_~arr~0.base main_~a~0.base) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0)), 722#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= main_~a~0.offset 8) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 3 main_~length~0))) (= main_~arr~0.base main_~a~0.base) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset))))), 723#(and (<= main_~a~0.offset 8) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (< 3 main_~length~0) (= main_~arr~0.offset 0)), 724#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 0 main_~a~0.offset)), 725#(and (<= 4 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base))), 714#true, 715#false, 716#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 717#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 718#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 719#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 4) (<= main_~length~0 3)) (or (<= 4 main_~a~0.offset) (< 3 main_~length~0)) (= main_~arr~0.offset 0))] [2018-02-02 09:46:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:38,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:46:38,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:46:38,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:46:38,317 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 12 states. [2018-02-02 09:46:38,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:38,616 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-02 09:46:38,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:46:38,616 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-02-02 09:46:38,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:38,616 INFO L225 Difference]: With dead ends: 53 [2018-02-02 09:46:38,617 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 09:46:38,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:46:38,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 09:46:38,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-02-02 09:46:38,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 09:46:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-02-02 09:46:38,620 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 36 [2018-02-02 09:46:38,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:38,621 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-02-02 09:46:38,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:46:38,621 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-02-02 09:46:38,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 09:46:38,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:38,622 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:38,622 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:38,622 INFO L82 PathProgramCache]: Analyzing trace with hash -934963210, now seen corresponding path program 4 times [2018-02-02 09:46:38,623 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:38,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:39,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:39,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:46:39,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:39,135 INFO L182 omatonBuilderFactory]: Interpolants [847#true, 848#false, 849#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 850#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 851#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 852#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 4) (<= main_~length~0 4)) (= main_~arr~0.offset 0)), 853#(and (<= 8 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 8) (<= main_~length~0 4)) (= main_~arr~0.offset 0)), 854#(and (= main_~arr~0.base main_~a~0.base) (or (and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 12 main_~a~0.offset) (or (<= main_~a~0.offset 12) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)))) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0)), 855#(and (= main_~arr~0.base main_~a~0.base) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= main_~arr~0.offset 0) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 12 main_~a~0.offset) (<= main_~a~0.offset 12) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0)))))), 856#(and (= main_~arr~0.base main_~a~0.base) (= main_~arr~0.offset 0) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 12 main_~a~0.offset) (<= main_~a~0.offset 12) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0))))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset))))), 857#(and (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 12 main_~a~0.offset) (<= main_~a~0.offset 12) (= main_~arr~0.offset 0) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0)))), 858#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 12 main_~a~0.offset)), 859#(and (<= 16 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base)))] [2018-02-02 09:46:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:39,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:46:39,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:46:39,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:46:39,136 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 13 states. [2018-02-02 09:46:39,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:39,502 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-02-02 09:46:39,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:46:39,502 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-02-02 09:46:39,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:39,503 INFO L225 Difference]: With dead ends: 61 [2018-02-02 09:46:39,503 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 09:46:39,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:46:39,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 09:46:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-02-02 09:46:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 09:46:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-02-02 09:46:39,505 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 44 [2018-02-02 09:46:39,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:39,505 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-02-02 09:46:39,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:46:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-02-02 09:46:39,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 09:46:39,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:39,506 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:39,506 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash 968570021, now seen corresponding path program 5 times [2018-02-02 09:46:39,507 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:39,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:40,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:40,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:46:40,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:40,041 INFO L182 omatonBuilderFactory]: Interpolants [999#true, 1000#false, 1001#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 1002#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 1003#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 1004#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 4 main_~a~0.offset) (< 5 main_~length~0)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 4) (<= main_~length~0 5))), 1005#(and (or (<= main_~a~0.offset 8) (<= main_~length~0 5)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 8 main_~a~0.offset) (< 5 main_~length~0))), 1006#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 5 main_~length~0) (<= 12 main_~a~0.offset)) (or (<= main_~length~0 5) (<= main_~a~0.offset 12)) (= main_~arr~0.offset 0)), 1007#(and (= main_~a~0.base main_~arr~0.base) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (< 5 main_~length~0) (<= main_~a~0.offset 16))))) (= main_~arr~0.offset 0)), 1008#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (< 5 main_~length~0) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (<= main_~a~0.offset 16))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base))) (= main_~arr~0.offset 0)), 1009#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (< 5 main_~length~0) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (<= main_~a~0.offset 16))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset)))) (= main_~arr~0.offset 0)), 1010#(and (< 5 main_~length~0) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (<= main_~a~0.offset 16) (= main_~arr~0.offset 0)), 1011#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 0 main_~a~0.offset)), 1012#(and (<= 4 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base)))] [2018-02-02 09:46:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:40,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:46:40,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:46:40,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:46:40,042 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 14 states. [2018-02-02 09:46:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:40,467 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-02-02 09:46:40,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:46:40,467 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-02-02 09:46:40,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:40,468 INFO L225 Difference]: With dead ends: 69 [2018-02-02 09:46:40,468 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 09:46:40,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:46:40,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 09:46:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-02-02 09:46:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 09:46:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-02-02 09:46:40,471 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 52 [2018-02-02 09:46:40,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:40,472 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-02-02 09:46:40,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:46:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-02-02 09:46:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 09:46:40,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:40,473 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:40,473 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:40,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1956426324, now seen corresponding path program 6 times [2018-02-02 09:46:40,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:40,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:41,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:41,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:46:41,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:41,018 INFO L182 omatonBuilderFactory]: Interpolants [1184#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 4 main_~a~0.offset)), 1185#(and (<= 8 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base))), 1170#true, 1171#false, 1172#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 1173#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 1174#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 1175#(and (or (<= 4 main_~a~0.offset) (< 6 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 4) (<= main_~length~0 6)) (= main_~arr~0.offset 0)), 1176#(and (or (<= 8 main_~a~0.offset) (< 6 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 8) (<= main_~length~0 6))), 1177#(and (or (<= main_~a~0.offset 12) (<= main_~length~0 6)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 6 main_~length~0) (<= 12 main_~a~0.offset)) (= main_~arr~0.offset 0)), 1178#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 6 main_~length~0) (<= 16 main_~a~0.offset)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 16) (<= main_~length~0 6))), 1179#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (or (< 6 main_~length~0) (<= 16 main_~a~0.offset)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 16) (<= main_~length~0 6))), 1180#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= main_~arr~0.offset 0) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (and (<= main_~a~0.offset 20) (< 6 main_~length~0)) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)))))), 1181#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (or (and (<= main_~a~0.offset 20) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 6 main_~length~0)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0)), 1182#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (or (and (<= main_~a~0.offset 20) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 6 main_~length~0)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset))))), 1183#(and (<= 4 main_~a~0.offset) (<= main_~a~0.offset 20) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 6 main_~length~0) (= main_~arr~0.offset 0))] [2018-02-02 09:46:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:41,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:46:41,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:46:41,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:46:41,019 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 16 states. [2018-02-02 09:46:41,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:41,457 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-02-02 09:46:41,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:46:41,458 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-02-02 09:46:41,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:41,458 INFO L225 Difference]: With dead ends: 77 [2018-02-02 09:46:41,458 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 09:46:41,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:46:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 09:46:41,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-02-02 09:46:41,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 09:46:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-02-02 09:46:41,461 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 60 [2018-02-02 09:46:41,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:41,461 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-02-02 09:46:41,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:46:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-02-02 09:46:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 09:46:41,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:41,462 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:41,462 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:41,463 INFO L82 PathProgramCache]: Analyzing trace with hash 58265859, now seen corresponding path program 7 times [2018-02-02 09:46:41,463 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:41,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:41,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:41,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:46:41,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:41,990 INFO L182 omatonBuilderFactory]: Interpolants [1376#(and (< 7 main_~length~0) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0) (<= main_~a~0.offset 24)), 1377#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 0 main_~a~0.offset)), 1378#(and (<= 4 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base))), 1363#true, 1364#false, 1365#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 1366#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 1367#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 1368#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 4) (<= main_~length~0 7)) (= main_~arr~0.offset 0) (or (< 7 main_~length~0) (<= 4 main_~a~0.offset))), 1369#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (< 7 main_~length~0) (<= 8 main_~a~0.offset)) (or (<= main_~a~0.offset 8) (<= main_~length~0 7))), 1370#(and (or (<= main_~a~0.offset 12) (<= main_~length~0 7)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 7 main_~length~0) (<= 12 main_~a~0.offset)) (= main_~arr~0.offset 0)), 1371#(and (or (<= main_~a~0.offset 16) (<= main_~length~0 7)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 7 main_~length~0) (<= 16 main_~a~0.offset)) (= main_~arr~0.offset 0)), 1372#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 7 main_~length~0) (<= 20 main_~a~0.offset)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 20) (<= main_~length~0 7))), 1373#(and (= main_~arr~0.base main_~a~0.base) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (and (< 7 main_~length~0) (<= main_~a~0.offset 24)) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))))) (= main_~arr~0.offset 0)), 1374#(and (= main_~arr~0.base main_~a~0.base) (or (and (< 7 main_~length~0) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (<= main_~a~0.offset 24)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= main_~arr~0.offset 0)), 1375#(and (= main_~arr~0.base main_~a~0.base) (or (and (< 7 main_~length~0) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (<= main_~a~0.offset 24)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset)))))] [2018-02-02 09:46:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:41,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:46:41,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:46:41,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:46:41,991 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 16 states. [2018-02-02 09:46:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:42,554 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-02-02 09:46:42,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:46:42,555 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2018-02-02 09:46:42,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:42,556 INFO L225 Difference]: With dead ends: 85 [2018-02-02 09:46:42,556 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 09:46:42,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:46:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 09:46:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-02-02 09:46:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 09:46:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-02-02 09:46:42,561 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 68 [2018-02-02 09:46:42,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:42,561 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-02-02 09:46:42,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:46:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-02-02 09:46:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 09:46:42,562 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:42,562 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:42,562 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:42,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1910460594, now seen corresponding path program 8 times [2018-02-02 09:46:42,563 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:42,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:43,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:43,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 09:46:43,177 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:43,178 INFO L182 omatonBuilderFactory]: Interpolants [1572#true, 1573#false, 1574#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 1575#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 1576#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 1577#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 4) (<= main_~length~0 8))), 1578#(and (<= 8 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 8) (<= main_~length~0 8)) (= main_~arr~0.offset 0)), 1579#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 12 main_~a~0.offset) (or (<= main_~a~0.offset 12) (<= main_~length~0 8)) (= main_~arr~0.offset 0)), 1580#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 16 main_~a~0.offset) (or (<= main_~a~0.offset 16) (<= main_~length~0 8)) (= main_~arr~0.offset 0)), 1581#(and (<= 20 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 20) (<= main_~length~0 8)) (= main_~arr~0.offset 0)), 1582#(and (or (<= main_~a~0.offset 24) (<= main_~length~0 8)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (<= 24 main_~a~0.offset)), 1583#(and (or (and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 28) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)))) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~a~0.base main_~arr~0.base) (= main_~arr~0.offset 0) (<= 28 main_~a~0.offset)), 1584#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= main_~a~0.offset 28) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0))))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base))) (= main_~arr~0.offset 0) (<= 28 main_~a~0.offset)), 1585#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= main_~a~0.offset 28) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0))))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset)))) (= main_~arr~0.offset 0) (<= 28 main_~a~0.offset)), 1586#(and (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= main_~a~0.offset 28) (= main_~arr~0.offset 0) (<= 28 main_~a~0.offset) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0)))), 1587#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 28 main_~a~0.offset)), 1588#(and (<= 32 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base)))] [2018-02-02 09:46:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:43,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:46:43,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:46:43,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:46:43,179 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 17 states. [2018-02-02 09:46:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:43,707 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-02-02 09:46:43,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:46:43,708 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-02-02 09:46:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:43,708 INFO L225 Difference]: With dead ends: 93 [2018-02-02 09:46:43,708 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 09:46:43,709 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:46:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 09:46:43,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-02-02 09:46:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 09:46:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-02-02 09:46:43,713 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 76 [2018-02-02 09:46:43,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:43,713 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-02-02 09:46:43,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:46:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-02-02 09:46:43,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 09:46:43,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:43,715 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:43,715 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:43,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1281257825, now seen corresponding path program 9 times [2018-02-02 09:46:43,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:43,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:44,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:44,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 09:46:44,458 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:44,458 INFO L182 omatonBuilderFactory]: Interpolants [1800#true, 1801#false, 1802#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 1803#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 1804#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 1805#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 4 main_~a~0.offset) (< 9 main_~length~0)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 4) (<= main_~length~0 9))), 1806#(and (or (<= main_~a~0.offset 8) (<= main_~length~0 9)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 8 main_~a~0.offset) (< 9 main_~length~0)) (= main_~arr~0.offset 0)), 1807#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 9) (<= main_~a~0.offset 12)) (= main_~arr~0.offset 0) (or (<= 12 main_~a~0.offset) (< 9 main_~length~0))), 1808#(and (or (<= 16 main_~a~0.offset) (< 9 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 9) (<= main_~a~0.offset 16)) (= main_~arr~0.offset 0)), 1809#(and (or (<= 20 main_~a~0.offset) (< 9 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 20) (<= main_~length~0 9))), 1810#(and (or (<= main_~length~0 9) (<= main_~a~0.offset 24)) (= main_~arr~0.base main_~a~0.base) (or (<= 24 main_~a~0.offset) (< 9 main_~length~0)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 1811#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 9 main_~length~0) (<= 28 main_~a~0.offset)) (= main_~arr~0.offset 0) (or (<= main_~length~0 9) (<= main_~a~0.offset 28))), 1812#(and (= main_~a~0.base main_~arr~0.base) (or (and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (< 9 main_~length~0) (<= main_~a~0.offset 32)))) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0)), 1813#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 9 main_~length~0) (<= main_~a~0.offset 32))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base))) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0)), 1814#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 9 main_~length~0) (<= main_~a~0.offset 32))) (<= 0 main_~a~0.offset) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset)))) (= main_~arr~0.offset 0)), 1815#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0) (< 9 main_~length~0) (<= main_~a~0.offset 32)), 1816#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 0 main_~a~0.offset)), 1817#(and (<= 4 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base)))] [2018-02-02 09:46:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:44,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:46:44,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:46:44,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:46:44,459 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 18 states. [2018-02-02 09:46:45,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:45,070 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-02-02 09:46:45,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:46:45,071 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 84 [2018-02-02 09:46:45,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:45,071 INFO L225 Difference]: With dead ends: 101 [2018-02-02 09:46:45,071 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 09:46:45,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:46:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 09:46:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-02-02 09:46:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 09:46:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-02-02 09:46:45,074 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 84 [2018-02-02 09:46:45,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:45,074 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-02-02 09:46:45,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:46:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-02-02 09:46:45,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 09:46:45,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:45,075 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:45,075 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:45,075 INFO L82 PathProgramCache]: Analyzing trace with hash 545616656, now seen corresponding path program 10 times [2018-02-02 09:46:45,076 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:45,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:45,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:45,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 09:46:45,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:45,803 INFO L182 omatonBuilderFactory]: Interpolants [2048#false, 2049#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 2050#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 2051#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 2052#(and (or (<= main_~a~0.offset 4) (<= main_~length~0 10)) (or (<= 4 main_~a~0.offset) (< 10 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 2053#(and (or (<= main_~length~0 10) (<= main_~a~0.offset 8)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 8 main_~a~0.offset) (< 10 main_~length~0))), 2054#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 10) (<= main_~a~0.offset 12)) (= main_~arr~0.offset 0) (or (< 10 main_~length~0) (<= 12 main_~a~0.offset))), 2055#(and (or (<= main_~length~0 10) (<= main_~a~0.offset 16)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 16 main_~a~0.offset) (< 10 main_~length~0))), 2056#(and (or (<= 20 main_~a~0.offset) (< 10 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 20) (<= main_~length~0 10))), 2057#(and (or (<= main_~length~0 10) (<= main_~a~0.offset 24)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 10 main_~length~0) (<= 24 main_~a~0.offset)) (= main_~arr~0.offset 0)), 2058#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~length~0 10) (<= main_~a~0.offset 28)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 10 main_~length~0) (<= 28 main_~a~0.offset)) (= main_~arr~0.offset 0)), 2059#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~length~0 10) (<= main_~a~0.offset 32)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 32 main_~a~0.offset) (< 10 main_~length~0)) (= main_~arr~0.offset 0)), 2060#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~length~0 10) (<= main_~a~0.offset 32)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (or (<= 32 main_~a~0.offset) (< 10 main_~length~0)) (= main_~arr~0.offset 0)), 2061#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (or (and (or (and (< 10 main_~length~0) (<= main_~a~0.offset 36)) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base))) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0)), 2062#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 10 main_~length~0) (<= main_~a~0.offset 36))) (= main_~arr~0.offset 0)), 2063#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 10 main_~length~0) (<= main_~a~0.offset 36))) (= main_~arr~0.offset 0) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset))))), 2064#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 10 main_~length~0) (= main_~arr~0.offset 0) (<= main_~a~0.offset 36)), 2065#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 4 main_~a~0.offset)), 2066#(and (<= 8 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base))), 2047#true] [2018-02-02 09:46:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:45,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 09:46:45,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 09:46:45,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:46:45,804 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 20 states. [2018-02-02 09:46:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:46,557 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-02-02 09:46:46,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:46:46,557 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 92 [2018-02-02 09:46:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:46,557 INFO L225 Difference]: With dead ends: 109 [2018-02-02 09:46:46,557 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 09:46:46,558 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=1095, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 09:46:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 09:46:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-02-02 09:46:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 09:46:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-02-02 09:46:46,563 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 92 [2018-02-02 09:46:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:46,564 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-02-02 09:46:46,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 09:46:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-02-02 09:46:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 09:46:46,565 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:46,565 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:46,565 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:46,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2095273407, now seen corresponding path program 11 times [2018-02-02 09:46:46,565 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:46,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:47,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:47,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 09:46:47,312 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:47,312 INFO L182 omatonBuilderFactory]: Interpolants [2316#true, 2317#false, 2318#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 2319#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 2320#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 2321#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 4 main_~a~0.offset) (< 11 main_~length~0)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 4) (<= main_~length~0 11))), 2322#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 8 main_~a~0.offset) (< 11 main_~length~0)) (or (<= main_~length~0 11) (<= main_~a~0.offset 8))), 2323#(and (or (< 11 main_~length~0) (<= 12 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 11) (<= main_~a~0.offset 12)) (= main_~arr~0.offset 0)), 2324#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 11) (<= main_~a~0.offset 16)) (= main_~arr~0.offset 0) (or (<= 16 main_~a~0.offset) (< 11 main_~length~0))), 2325#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 11) (<= main_~a~0.offset 20)) (= main_~arr~0.offset 0) (or (<= 20 main_~a~0.offset) (< 11 main_~length~0))), 2326#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 11) (<= main_~a~0.offset 24)) (or (< 11 main_~length~0) (<= 24 main_~a~0.offset)) (= main_~arr~0.offset 0)), 2327#(and (or (< 11 main_~length~0) (<= 28 main_~a~0.offset)) (or (<= main_~length~0 11) (<= main_~a~0.offset 28)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 2328#(and (or (<= main_~length~0 11) (<= main_~a~0.offset 32)) (or (<= 32 main_~a~0.offset) (< 11 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 2329#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 11) (<= main_~a~0.offset 36)) (= main_~arr~0.offset 0) (or (<= 36 main_~a~0.offset) (< 11 main_~length~0))), 2330#(and (= main_~a~0.base main_~arr~0.base) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (and (< 11 main_~length~0) (<= main_~a~0.offset 40)) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))))) (= main_~arr~0.offset 0)), 2331#(and (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base))) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 11 main_~length~0) (<= 0 main_~a~0.offset) (<= main_~a~0.offset 40))) (= main_~arr~0.offset 0)), 2332#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 11 main_~length~0) (<= 0 main_~a~0.offset) (<= main_~a~0.offset 40))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset)))) (= main_~arr~0.offset 0)), 2333#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 11 main_~length~0) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0) (<= main_~a~0.offset 40)), 2334#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 0 main_~a~0.offset)), 2335#(and (<= 4 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base)))] [2018-02-02 09:46:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:47,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 09:46:47,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 09:46:47,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:46:47,313 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 20 states. [2018-02-02 09:46:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:48,114 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-02-02 09:46:48,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:46:48,114 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 100 [2018-02-02 09:46:48,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:48,115 INFO L225 Difference]: With dead ends: 117 [2018-02-02 09:46:48,115 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 09:46:48,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 09:46:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 09:46:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-02-02 09:46:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 09:46:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-02-02 09:46:48,119 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 100 [2018-02-02 09:46:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:48,119 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-02-02 09:46:48,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 09:46:48,119 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-02-02 09:46:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 09:46:48,120 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:48,120 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:48,120 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:48,120 INFO L82 PathProgramCache]: Analyzing trace with hash -251192978, now seen corresponding path program 12 times [2018-02-02 09:46:48,120 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:48,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:49,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:49,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 09:46:49,065 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:49,065 INFO L182 omatonBuilderFactory]: Interpolants [2601#true, 2602#false, 2603#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 2604#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 2605#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 2606#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 4 main_~a~0.offset) (< 12 main_~length~0)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 4) (<= main_~length~0 12))), 2607#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 8) (<= main_~length~0 12)) (or (<= 8 main_~a~0.offset) (< 12 main_~length~0)) (= main_~arr~0.offset 0)), 2608#(and (or (<= main_~length~0 12) (<= main_~a~0.offset 12)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 12 main_~a~0.offset) (< 12 main_~length~0)) (= main_~arr~0.offset 0)), 2609#(and (or (<= 16 main_~a~0.offset) (< 12 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 12) (<= main_~a~0.offset 16)) (= main_~arr~0.offset 0)), 2610#(and (or (<= main_~a~0.offset 20) (<= main_~length~0 12)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 20 main_~a~0.offset) (< 12 main_~length~0))), 2611#(and (or (< 12 main_~length~0) (<= 24 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 12) (<= main_~a~0.offset 24)) (= main_~arr~0.offset 0)), 2612#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 28) (<= main_~length~0 12)) (or (< 12 main_~length~0) (<= 28 main_~a~0.offset)) (= main_~arr~0.offset 0)), 2613#(and (or (<= 32 main_~a~0.offset) (< 12 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (or (<= main_~length~0 12) (<= main_~a~0.offset 32)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 2614#(and (or (<= 32 main_~a~0.offset) (< 12 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (or (<= main_~length~0 12) (<= main_~a~0.offset 32)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0)), 2615#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 12) (<= main_~a~0.offset 36)) (= main_~arr~0.offset 0) (or (<= 36 main_~a~0.offset) (< 12 main_~length~0))), 2616#(and (<= 8 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (or (<= 40 main_~a~0.offset) (< 12 main_~length~0)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~length~0 12) (<= main_~a~0.offset 40))), 2617#(and (= main_~a~0.base main_~arr~0.base) (= main_~arr~0.offset 0) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (< 12 main_~length~0) (<= main_~a~0.offset 44))) (<= 12 main_~a~0.offset)))), 2618#(and (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base))) (or (and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 12 main_~a~0.offset) (< 12 main_~length~0) (<= main_~a~0.offset 44)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0)), 2619#(and (or (and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 12 main_~a~0.offset) (< 12 main_~length~0) (<= main_~a~0.offset 44)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset)))) (= main_~arr~0.offset 0)), 2620#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 12 main_~a~0.offset) (< 12 main_~length~0) (<= main_~a~0.offset 44) (= main_~arr~0.offset 0)), 2621#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 12 main_~a~0.offset)), 2622#(and (<= 16 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base)))] [2018-02-02 09:46:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:49,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:46:49,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:46:49,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:46:49,066 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 22 states. [2018-02-02 09:46:50,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:50,073 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-02-02 09:46:50,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:46:50,074 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 108 [2018-02-02 09:46:50,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:50,074 INFO L225 Difference]: With dead ends: 125 [2018-02-02 09:46:50,074 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 09:46:50,075 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=183, Invalid=1377, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:46:50,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 09:46:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-02-02 09:46:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 09:46:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-02-02 09:46:50,077 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 108 [2018-02-02 09:46:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:50,077 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-02-02 09:46:50,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:46:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-02-02 09:46:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-02 09:46:50,079 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:50,079 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:50,079 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:50,079 INFO L82 PathProgramCache]: Analyzing trace with hash 226475549, now seen corresponding path program 13 times [2018-02-02 09:46:50,080 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:50,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:51,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:51,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 09:46:51,073 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:51,074 INFO L182 omatonBuilderFactory]: Interpolants [2912#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 2913#(and (or (<= main_~a~0.offset 4) (<= main_~length~0 13)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 4 main_~a~0.offset) (< 13 main_~length~0)) (= main_~arr~0.offset 0)), 2914#(and (or (<= 8 main_~a~0.offset) (< 13 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 8) (<= main_~length~0 13)) (= main_~arr~0.offset 0)), 2915#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 12 main_~a~0.offset) (< 13 main_~length~0)) (or (<= main_~a~0.offset 12) (<= main_~length~0 13)) (= main_~arr~0.offset 0)), 2916#(and (or (<= 16 main_~a~0.offset) (< 13 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 16) (<= main_~length~0 13)) (= main_~arr~0.offset 0)), 2917#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 20) (<= main_~length~0 13)) (or (<= 20 main_~a~0.offset) (< 13 main_~length~0)) (= main_~arr~0.offset 0)), 2918#(and (or (< 13 main_~length~0) (<= 24 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 24) (<= main_~length~0 13)) (= main_~arr~0.offset 0)), 2919#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 28) (<= main_~length~0 13)) (= main_~arr~0.offset 0) (or (< 13 main_~length~0) (<= 28 main_~a~0.offset))), 2920#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 32 main_~a~0.offset) (< 13 main_~length~0)) (or (<= main_~length~0 13) (<= main_~a~0.offset 32)) (= main_~arr~0.offset 0)), 2921#(and (or (<= main_~length~0 13) (<= main_~a~0.offset 36)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 36 main_~a~0.offset) (< 13 main_~length~0))), 2922#(and (or (<= main_~a~0.offset 40) (<= main_~length~0 13)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 40 main_~a~0.offset) (< 13 main_~length~0)) (= main_~arr~0.offset 0)), 2923#(and (or (<= 44 main_~a~0.offset) (< 13 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 44) (<= main_~length~0 13)) (= main_~arr~0.offset 0)), 2924#(and (= main_~a~0.base main_~arr~0.base) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (or (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (< 13 main_~length~0) (<= main_~a~0.offset 48))) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)))) (= main_~arr~0.offset 0)), 2925#(and (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base))) (or (and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 13 main_~length~0) (<= main_~a~0.offset 48)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0)), 2926#(and (or (and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 13 main_~length~0) (<= main_~a~0.offset 48)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (<= 0 main_~a~0.offset) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset)))) (= main_~arr~0.offset 0)), 2927#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (< 13 main_~length~0) (<= main_~a~0.offset 48) (= main_~arr~0.offset 0)), 2928#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 0 main_~a~0.offset)), 2929#(and (<= 4 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base))), 2908#true, 2909#false, 2910#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 2911#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0))] [2018-02-02 09:46:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:51,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:46:51,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:46:51,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:46:51,075 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 22 states. [2018-02-02 09:46:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:52,054 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-02-02 09:46:52,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:46:52,054 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 116 [2018-02-02 09:46:52,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:52,055 INFO L225 Difference]: With dead ends: 133 [2018-02-02 09:46:52,055 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 09:46:52,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:46:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 09:46:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-02-02 09:46:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 09:46:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-02-02 09:46:52,057 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 116 [2018-02-02 09:46:52,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:52,058 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-02-02 09:46:52,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:46:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-02-02 09:46:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-02 09:46:52,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:52,059 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:52,059 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:52,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1675379660, now seen corresponding path program 14 times [2018-02-02 09:46:52,060 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:52,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:53,001 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:53,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:53,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 09:46:53,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:53,002 INFO L182 omatonBuilderFactory]: Interpolants [3232#false, 3233#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 3234#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 3235#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 3236#(and (or (<= main_~a~0.offset 4) (<= main_~length~0 14)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 4 main_~a~0.offset) (< 14 main_~length~0)) (= main_~arr~0.offset 0)), 3237#(and (or (<= 8 main_~a~0.offset) (< 14 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 8) (<= main_~length~0 14)) (= main_~arr~0.offset 0)), 3238#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 12) (<= main_~length~0 14)) (= main_~arr~0.offset 0) (or (< 14 main_~length~0) (<= 12 main_~a~0.offset))), 3239#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~a~0.offset 16) (<= main_~length~0 14)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 16 main_~a~0.offset) (< 14 main_~length~0)) (= main_~arr~0.offset 0)), 3240#(and (or (<= 20 main_~a~0.offset) (< 14 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 20) (<= main_~length~0 14)) (= main_~arr~0.offset 0)), 3241#(and (or (< 14 main_~length~0) (<= 24 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~length~0 14) (<= main_~a~0.offset 24))), 3242#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 14 main_~length~0) (<= 28 main_~a~0.offset)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 28) (<= main_~length~0 14))), 3243#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 14) (<= main_~a~0.offset 32)) (or (<= 32 main_~a~0.offset) (< 14 main_~length~0)) (= main_~arr~0.offset 0)), 3244#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~length~0 14) (<= main_~a~0.offset 36)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 36 main_~a~0.offset) (< 14 main_~length~0))), 3245#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 14) (<= main_~a~0.offset 40)) (= main_~arr~0.offset 0) (or (<= 40 main_~a~0.offset) (< 14 main_~length~0))), 3246#(and (or (<= main_~a~0.offset 44) (<= main_~length~0 14)) (or (<= 44 main_~a~0.offset) (< 14 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 3247#(and (or (<= main_~length~0 14) (<= main_~a~0.offset 48)) (or (<= 48 main_~a~0.offset) (< 14 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 3248#(and (or (<= main_~length~0 14) (<= main_~a~0.offset 48)) (or (<= 48 main_~a~0.offset) (< 14 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0)), 3249#(and (= main_~arr~0.base main_~a~0.base) (or (and (or (and (< 14 main_~length~0) (<= main_~a~0.offset 52)) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (<= 4 main_~a~0.offset) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base))) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0)), 3250#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= 4 main_~a~0.offset) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 14 main_~length~0) (<= main_~a~0.offset 52))) (= main_~arr~0.base main_~a~0.base) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= main_~arr~0.offset 0)), 3251#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= 4 main_~a~0.offset) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 14 main_~length~0) (<= main_~a~0.offset 52))) (= main_~arr~0.base main_~a~0.base) (= main_~arr~0.offset 0) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset))))), 3252#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 14 main_~length~0) (= main_~arr~0.offset 0) (<= main_~a~0.offset 52)), 3253#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 4 main_~a~0.offset)), 3254#(and (<= 8 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base))), 3231#true] [2018-02-02 09:46:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:53,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 09:46:53,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 09:46:53,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:46:53,003 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 24 states. [2018-02-02 09:46:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:54,185 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-02-02 09:46:54,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 09:46:54,185 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-02-02 09:46:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:54,186 INFO L225 Difference]: With dead ends: 141 [2018-02-02 09:46:54,186 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 09:46:54,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 09:46:54,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 09:46:54,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-02-02 09:46:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 09:46:54,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-02-02 09:46:54,189 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 124 [2018-02-02 09:46:54,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:54,189 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-02-02 09:46:54,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 09:46:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-02-02 09:46:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-02 09:46:54,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:54,190 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:54,190 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:54,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2035570053, now seen corresponding path program 15 times [2018-02-02 09:46:54,191 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:54,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:55,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:55,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 09:46:55,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:55,201 INFO L182 omatonBuilderFactory]: Interpolants [3584#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~a~0.offset 16) (<= main_~length~0 15)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 15 main_~length~0) (<= 16 main_~a~0.offset)) (= main_~arr~0.offset 0)), 3585#(and (or (<= 20 main_~a~0.offset) (< 15 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 20) (<= main_~length~0 15)) (= main_~arr~0.offset 0)), 3586#(and (or (<= main_~a~0.offset 24) (<= main_~length~0 15)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (< 15 main_~length~0) (<= 24 main_~a~0.offset))), 3587#(and (or (< 15 main_~length~0) (<= 28 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 28) (<= main_~length~0 15)) (= main_~arr~0.offset 0)), 3588#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 15) (<= main_~a~0.offset 32)) (= main_~arr~0.offset 0) (or (<= 32 main_~a~0.offset) (< 15 main_~length~0))), 3589#(and (or (<= main_~a~0.offset 36) (<= main_~length~0 15)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 36 main_~a~0.offset) (< 15 main_~length~0))), 3590#(and (or (<= main_~a~0.offset 40) (<= main_~length~0 15)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 40 main_~a~0.offset) (< 15 main_~length~0))), 3591#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 44 main_~a~0.offset) (< 15 main_~length~0)) (or (<= main_~a~0.offset 44) (<= main_~length~0 15))), 3592#(and (or (< 15 main_~length~0) (<= 48 main_~a~0.offset)) (or (<= main_~a~0.offset 48) (<= main_~length~0 15)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 3593#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 52) (<= main_~length~0 15)) (= main_~arr~0.offset 0) (or (< 15 main_~length~0) (<= 52 main_~a~0.offset))), 3594#(and (= main_~a~0.base main_~arr~0.base) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (or (and (< 15 main_~length~0) (<= main_~a~0.offset 56)) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)))) (= main_~arr~0.offset 0)), 3595#(and (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base))) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 15 main_~length~0) (<= 0 main_~a~0.offset) (<= main_~a~0.offset 56))) (= main_~arr~0.offset 0)), 3596#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 15 main_~length~0) (<= 0 main_~a~0.offset) (<= main_~a~0.offset 56))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset)))) (= main_~arr~0.offset 0)), 3597#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 15 main_~length~0) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0) (<= main_~a~0.offset 56)), 3598#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 0 main_~a~0.offset)), 3599#(and (<= 4 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base))), 3576#true, 3577#false, 3578#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 3579#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 3580#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 3581#(and (or (<= 4 main_~a~0.offset) (< 15 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 4) (<= main_~length~0 15)) (= main_~arr~0.offset 0)), 3582#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 8) (<= main_~length~0 15)) (or (<= 8 main_~a~0.offset) (< 15 main_~length~0))), 3583#(and (or (<= main_~a~0.offset 12) (<= main_~length~0 15)) (= main_~arr~0.base main_~a~0.base) (or (< 15 main_~length~0) (<= 12 main_~a~0.offset)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0))] [2018-02-02 09:46:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:55,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 09:46:55,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 09:46:55,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:46:55,202 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 24 states. [2018-02-02 09:46:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:56,428 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-02-02 09:46:56,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 09:46:56,428 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 132 [2018-02-02 09:46:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:56,429 INFO L225 Difference]: With dead ends: 149 [2018-02-02 09:46:56,429 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 09:46:56,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=198, Invalid=1694, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 09:46:56,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 09:46:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-02-02 09:46:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 09:46:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-02-02 09:46:56,431 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 132 [2018-02-02 09:46:56,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:56,431 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-02-02 09:46:56,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 09:46:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-02-02 09:46:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-02-02 09:46:56,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:56,432 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:56,432 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash 159183402, now seen corresponding path program 16 times [2018-02-02 09:46:56,432 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:56,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:57,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:57,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 09:46:57,363 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:57,363 INFO L182 omatonBuilderFactory]: Interpolants [3937#true, 3938#false, 3939#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 3940#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 3941#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 3942#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 4) (<= main_~length~0 16)) (= main_~arr~0.offset 0)), 3943#(and (<= 8 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 16) (<= main_~a~0.offset 8)) (= main_~arr~0.offset 0)), 3944#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 12 main_~a~0.offset) (or (<= main_~length~0 16) (<= main_~a~0.offset 12)) (= main_~arr~0.offset 0)), 3945#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 16 main_~a~0.offset) (= main_~arr~0.offset 0) (or (<= main_~length~0 16) (<= main_~a~0.offset 16))), 3946#(and (or (<= main_~length~0 16) (<= main_~a~0.offset 20)) (<= 20 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 3947#(and (or (<= main_~length~0 16) (<= main_~a~0.offset 24)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (<= 24 main_~a~0.offset)), 3948#(and (or (<= main_~length~0 16) (<= main_~a~0.offset 28)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (<= 28 main_~a~0.offset)), 3949#(and (<= 32 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 16) (<= main_~a~0.offset 32)) (= main_~arr~0.offset 0)), 3950#(and (<= 36 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 16) (<= main_~a~0.offset 36)) (= main_~arr~0.offset 0)), 3951#(and (<= 40 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 16) (<= main_~a~0.offset 40)) (= main_~arr~0.offset 0)), 3952#(and (<= 44 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (or (<= main_~length~0 16) (<= main_~a~0.offset 44)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 3953#(and (or (<= main_~length~0 16) (<= main_~a~0.offset 48)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 48 main_~a~0.offset) (= main_~arr~0.offset 0)), 3954#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 52 main_~a~0.offset) (= main_~arr~0.offset 0) (or (<= main_~length~0 16) (<= main_~a~0.offset 52))), 3955#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~length~0 16) (<= main_~a~0.offset 56)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 56 main_~a~0.offset) (= main_~arr~0.offset 0)), 3956#(and (= main_~a~0.base main_~arr~0.base) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= 60 main_~a~0.offset) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 60) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0)))), 3957#(and (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base))) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= main_~a~0.offset 60) (<= 60 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0)))))), 3958#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= main_~a~0.offset 60) (<= 60 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0))))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset))))), 3959#(and (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (<= main_~a~0.offset 60) (<= 60 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0)))), 3960#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 60 main_~a~0.offset)), 3961#(and (<= 64 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base)))] [2018-02-02 09:46:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:57,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 09:46:57,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 09:46:57,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:46:57,364 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 25 states. [2018-02-02 09:46:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:58,649 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-02-02 09:46:58,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 09:46:58,649 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 140 [2018-02-02 09:46:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:58,650 INFO L225 Difference]: With dead ends: 157 [2018-02-02 09:46:58,650 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 09:46:58,650 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=1863, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 09:46:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 09:46:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-02-02 09:46:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 09:46:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-02-02 09:46:58,653 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 140 [2018-02-02 09:46:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:58,653 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-02-02 09:46:58,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 09:46:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-02-02 09:46:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-02 09:46:58,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:58,654 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:58,655 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:46:58,655 INFO L82 PathProgramCache]: Analyzing trace with hash -2132862247, now seen corresponding path program 17 times [2018-02-02 09:46:58,655 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:58,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:59,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:59,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 09:46:59,890 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:59,891 INFO L182 omatonBuilderFactory]: Interpolants [4317#true, 4318#false, 4319#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 4320#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 4321#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 4322#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 17) (<= main_~a~0.offset 4)) (= main_~arr~0.offset 0) (or (< 17 main_~length~0) (<= 4 main_~a~0.offset))), 4323#(and (= main_~arr~0.base main_~a~0.base) (or (< 17 main_~length~0) (<= 8 main_~a~0.offset)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 17) (<= main_~a~0.offset 8)) (= main_~arr~0.offset 0)), 4324#(and (or (<= main_~length~0 17) (<= main_~a~0.offset 12)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 17 main_~length~0) (<= 12 main_~a~0.offset)) (= main_~arr~0.offset 0)), 4325#(and (or (<= main_~length~0 17) (<= main_~a~0.offset 16)) (or (< 17 main_~length~0) (<= 16 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 4326#(and (or (< 17 main_~length~0) (<= 20 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 17) (<= main_~a~0.offset 20)) (= main_~arr~0.offset 0)), 4327#(and (or (<= main_~length~0 17) (<= main_~a~0.offset 24)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 17 main_~length~0) (<= 24 main_~a~0.offset)) (= main_~arr~0.offset 0)), 4328#(and (or (< 17 main_~length~0) (<= 28 main_~a~0.offset)) (or (<= main_~length~0 17) (<= main_~a~0.offset 28)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 4329#(and (or (<= main_~length~0 17) (<= main_~a~0.offset 32)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (< 17 main_~length~0) (<= 32 main_~a~0.offset))), 4330#(and (or (<= 36 main_~a~0.offset) (< 17 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~length~0 17) (<= main_~a~0.offset 36))), 4331#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 17 main_~length~0) (<= 40 main_~a~0.offset)) (= main_~arr~0.offset 0) (or (<= main_~length~0 17) (<= main_~a~0.offset 40))), 4332#(and (or (< 17 main_~length~0) (<= 44 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 17) (<= main_~a~0.offset 44)) (= main_~arr~0.offset 0)), 4333#(and (or (<= main_~length~0 17) (<= main_~a~0.offset 48)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 17 main_~length~0) (<= 48 main_~a~0.offset)) (= main_~arr~0.offset 0)), 4334#(and (or (< 17 main_~length~0) (<= 52 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 17) (<= main_~a~0.offset 52)) (= main_~arr~0.offset 0)), 4335#(and (or (< 17 main_~length~0) (<= 56 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~length~0 17) (<= main_~a~0.offset 56))), 4336#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 17 main_~length~0) (<= 60 main_~a~0.offset)) (= main_~arr~0.offset 0) (or (<= main_~length~0 17) (<= main_~a~0.offset 60))), 4337#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (and (< 17 main_~length~0) (<= main_~a~0.offset 64)) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0)), 4338#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (or (and (< 17 main_~length~0) (<= main_~a~0.offset 64)) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0)))), 4339#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (and (< 17 main_~length~0) (<= main_~a~0.offset 64)) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset))))), 4340#(and (< 17 main_~length~0) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0) (<= main_~a~0.offset 64)), 4341#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 0 main_~a~0.offset)), 4342#(and (<= 4 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base)))] [2018-02-02 09:46:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:59,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 09:46:59,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 09:46:59,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:46:59,892 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 26 states. [2018-02-02 09:47:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:01,260 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-02-02 09:47:01,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:47:01,298 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 148 [2018-02-02 09:47:01,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:01,299 INFO L225 Difference]: With dead ends: 165 [2018-02-02 09:47:01,299 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 09:47:01,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=219, Invalid=2037, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 09:47:01,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 09:47:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-02-02 09:47:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 09:47:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-02-02 09:47:01,302 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 148 [2018-02-02 09:47:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:01,302 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-02-02 09:47:01,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 09:47:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-02-02 09:47:01,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-02-02 09:47:01,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:01,303 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:01,303 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:47:01,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2107562872, now seen corresponding path program 18 times [2018-02-02 09:47:01,303 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:01,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:02,042 WARN L146 SmtUtils]: Spent 393ms on a formula simplification. DAG size of input: 28 DAG size of output 23 [2018-02-02 09:47:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:02,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:02,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 09:47:02,959 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:02,960 INFO L182 omatonBuilderFactory]: Interpolants [4736#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~length~0 18) (<= main_~a~0.offset 64)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 64 main_~a~0.offset) (< 18 main_~length~0)) (= main_~arr~0.offset 0)), 4737#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~length~0 18) (<= main_~a~0.offset 64)) (or (<= 64 main_~a~0.offset) (< 18 main_~length~0)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0)), 4738#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= 4 main_~a~0.offset) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (and (<= main_~a~0.offset 68) (< 18 main_~length~0)) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))))) (= main_~a~0.base main_~arr~0.base) (= main_~arr~0.offset 0)), 4739#(and (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base))) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (<= main_~a~0.offset 68) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 18 main_~length~0))) (= main_~arr~0.offset 0)), 4740#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (<= main_~a~0.offset 68) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 18 main_~length~0))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset)))) (= main_~arr~0.offset 0)), 4741#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (<= main_~a~0.offset 68) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (< 18 main_~length~0)), 4742#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 4 main_~a~0.offset)), 4743#(and (<= 8 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base))), 4716#true, 4717#false, 4718#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 4719#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 4720#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 4721#(and (or (<= main_~a~0.offset 4) (<= main_~length~0 18)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 4 main_~a~0.offset) (< 18 main_~length~0))), 4722#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 8) (<= main_~length~0 18)) (or (<= 8 main_~a~0.offset) (< 18 main_~length~0))), 4723#(and (or (<= main_~length~0 18) (<= main_~a~0.offset 12)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 12 main_~a~0.offset) (< 18 main_~length~0))), 4724#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~length~0 18) (<= main_~a~0.offset 16)) (or (<= 16 main_~a~0.offset) (< 18 main_~length~0))), 4725#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 20 main_~a~0.offset) (< 18 main_~length~0)) (or (<= main_~a~0.offset 20) (<= main_~length~0 18)) (= main_~arr~0.offset 0)), 4726#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~length~0 18) (<= main_~a~0.offset 24)) (or (<= 24 main_~a~0.offset) (< 18 main_~length~0))), 4727#(and (or (<= main_~length~0 18) (<= main_~a~0.offset 28)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 18 main_~length~0) (<= 28 main_~a~0.offset)) (= main_~arr~0.offset 0)), 4728#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 18) (<= main_~a~0.offset 32)) (or (<= 32 main_~a~0.offset) (< 18 main_~length~0)) (= main_~arr~0.offset 0)), 4729#(and (= main_~arr~0.base main_~a~0.base) (or (<= 36 main_~a~0.offset) (< 18 main_~length~0)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 18) (<= main_~a~0.offset 36)) (= main_~arr~0.offset 0)), 4730#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 18) (<= main_~a~0.offset 40)) (or (<= 40 main_~a~0.offset) (< 18 main_~length~0)) (= main_~arr~0.offset 0)), 4731#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 44 main_~a~0.offset) (< 18 main_~length~0)) (or (<= main_~length~0 18) (<= main_~a~0.offset 44)) (= main_~arr~0.offset 0)), 4732#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~length~0 18) (<= main_~a~0.offset 48)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 48 main_~a~0.offset) (< 18 main_~length~0)) (= main_~arr~0.offset 0)), 4733#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 52 main_~a~0.offset) (< 18 main_~length~0)) (or (<= main_~length~0 18) (<= main_~a~0.offset 52)) (= main_~arr~0.offset 0)), 4734#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 56 main_~a~0.offset) (< 18 main_~length~0)) (or (<= main_~length~0 18) (<= main_~a~0.offset 56))), 4735#(and (= main_~arr~0.base main_~a~0.base) (or (<= 60 main_~a~0.offset) (< 18 main_~length~0)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 60) (<= main_~length~0 18)) (= main_~arr~0.offset 0))] [2018-02-02 09:47:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:02,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 09:47:02,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 09:47:02,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:47:02,961 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 28 states. [2018-02-02 09:47:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:04,797 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-02-02 09:47:04,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 09:47:04,797 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 156 [2018-02-02 09:47:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:04,798 INFO L225 Difference]: With dead ends: 173 [2018-02-02 09:47:04,798 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 09:47:04,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=237, Invalid=2415, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 09:47:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 09:47:04,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-02-02 09:47:04,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 09:47:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-02-02 09:47:04,800 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 156 [2018-02-02 09:47:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:04,801 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-02-02 09:47:04,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 09:47:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-02-02 09:47:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-02 09:47:04,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:04,801 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:04,801 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:47:04,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1533931721, now seen corresponding path program 19 times [2018-02-02 09:47:04,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:04,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:05,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:05,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 09:47:05,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:05,986 INFO L182 omatonBuilderFactory]: Interpolants [5137#true, 5138#false, 5139#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 5140#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 5141#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 5142#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 19 main_~length~0) (<= 4 main_~a~0.offset)) (or (<= main_~a~0.offset 4) (<= main_~length~0 19)) (= main_~arr~0.offset 0)), 5143#(and (or (< 19 main_~length~0) (<= 8 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~length~0 19) (<= main_~a~0.offset 8))), 5144#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 19) (<= main_~a~0.offset 12)) (or (< 19 main_~length~0) (<= 12 main_~a~0.offset)) (= main_~arr~0.offset 0)), 5145#(and (or (< 19 main_~length~0) (<= 16 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 19) (<= main_~a~0.offset 16)) (= main_~arr~0.offset 0)), 5146#(and (or (< 19 main_~length~0) (<= 20 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~length~0 19) (<= main_~a~0.offset 20))), 5147#(and (or (< 19 main_~length~0) (<= 24 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 19) (<= main_~a~0.offset 24)) (= main_~arr~0.offset 0)), 5148#(and (or (< 19 main_~length~0) (<= 28 main_~a~0.offset)) (or (<= main_~length~0 19) (<= main_~a~0.offset 28)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 5149#(and (or (< 19 main_~length~0) (<= 32 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~length~0 19) (<= main_~a~0.offset 32))), 5150#(and (or (<= 36 main_~a~0.offset) (< 19 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 19) (<= main_~a~0.offset 36)) (= main_~arr~0.offset 0)), 5151#(and (or (< 19 main_~length~0) (<= 40 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 19) (<= main_~a~0.offset 40)) (= main_~arr~0.offset 0)), 5152#(and (or (< 19 main_~length~0) (<= 44 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~length~0 19) (<= main_~a~0.offset 44))), 5153#(and (or (< 19 main_~length~0) (<= 48 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~length~0 19) (<= main_~a~0.offset 48))), 5154#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~length~0 19) (<= main_~a~0.offset 52)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 19 main_~length~0) (<= 52 main_~a~0.offset)) (= main_~arr~0.offset 0)), 5155#(and (or (< 19 main_~length~0) (<= 56 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 19) (<= main_~a~0.offset 56)) (= main_~arr~0.offset 0)), 5156#(and (or (< 19 main_~length~0) (<= 60 main_~a~0.offset)) (or (<= main_~a~0.offset 60) (<= main_~length~0 19)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 5157#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 19 main_~length~0) (<= 64 main_~a~0.offset)) (= main_~arr~0.offset 0) (or (<= main_~length~0 19) (<= main_~a~0.offset 64))), 5158#(and (or (<= main_~length~0 19) (<= main_~a~0.offset 68)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 19 main_~length~0) (<= 68 main_~a~0.offset)) (= main_~arr~0.offset 0)), 5159#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (and (< 19 main_~length~0) (<= main_~a~0.offset 72)) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)))), 5160#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (<= 0 main_~a~0.offset) (or (and (< 19 main_~length~0) (<= main_~a~0.offset 72)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0)), 5161#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (or (and (< 19 main_~length~0) (<= main_~a~0.offset 72)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset))))), 5162#(and (< 19 main_~length~0) (<= main_~a~0.offset 72) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0)), 5163#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 0 main_~a~0.offset)), 5164#(and (<= 4 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base)))] [2018-02-02 09:47:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:05,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 09:47:05,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 09:47:05,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:47:05,987 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 28 states. [2018-02-02 09:47:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:07,668 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-02-02 09:47:07,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 09:47:07,669 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 164 [2018-02-02 09:47:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:07,669 INFO L225 Difference]: With dead ends: 181 [2018-02-02 09:47:07,669 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 09:47:07,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=237, Invalid=2415, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 09:47:07,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 09:47:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-02-02 09:47:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 09:47:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-02-02 09:47:07,672 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 164 [2018-02-02 09:47:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:07,672 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-02-02 09:47:07,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 09:47:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-02-02 09:47:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-02 09:47:07,673 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:07,673 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:07,673 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:47:07,673 INFO L82 PathProgramCache]: Analyzing trace with hash 2130762470, now seen corresponding path program 20 times [2018-02-02 09:47:07,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:07,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:09,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:09,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 09:47:09,121 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:09,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:09,121 INFO L182 omatonBuilderFactory]: Interpolants [5574#true, 5575#false, 5576#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 5577#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 5578#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 5579#(and (or (<= 4 main_~a~0.offset) (< 20 main_~length~0)) (or (<= main_~a~0.offset 4) (<= main_~length~0 20)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 5580#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 8 main_~a~0.offset) (< 20 main_~length~0)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 8) (<= main_~length~0 20))), 5581#(and (or (<= main_~a~0.offset 12) (<= main_~length~0 20)) (or (<= 12 main_~a~0.offset) (< 20 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 5582#(and (or (<= 16 main_~a~0.offset) (< 20 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 16) (<= main_~length~0 20)) (= main_~arr~0.offset 0)), 5583#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 20 main_~a~0.offset) (< 20 main_~length~0)) (or (<= main_~a~0.offset 20) (<= main_~length~0 20))), 5584#(and (or (<= main_~a~0.offset 24) (<= main_~length~0 20)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 20 main_~length~0) (<= 24 main_~a~0.offset)) (= main_~arr~0.offset 0)), 5585#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 28) (<= main_~length~0 20)) (= main_~arr~0.offset 0) (or (< 20 main_~length~0) (<= 28 main_~a~0.offset))), 5586#(and (or (<= main_~length~0 20) (<= main_~a~0.offset 32)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 32 main_~a~0.offset) (< 20 main_~length~0)) (= main_~arr~0.offset 0)), 5587#(and (or (<= 36 main_~a~0.offset) (< 20 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 36) (<= main_~length~0 20)) (= main_~arr~0.offset 0)), 5588#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 40 main_~a~0.offset) (< 20 main_~length~0)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 40) (<= main_~length~0 20))), 5589#(and (or (<= main_~a~0.offset 44) (<= main_~length~0 20)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 44 main_~a~0.offset) (< 20 main_~length~0)) (= main_~arr~0.offset 0)), 5590#(and (or (<= main_~a~0.offset 48) (<= main_~length~0 20)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 48 main_~a~0.offset) (< 20 main_~length~0)) (= main_~arr~0.offset 0)), 5591#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 52 main_~a~0.offset) (< 20 main_~length~0)) (or (<= main_~a~0.offset 52) (<= main_~length~0 20)) (= main_~arr~0.offset 0)), 5592#(and (or (<= main_~a~0.offset 56) (<= main_~length~0 20)) (or (<= 56 main_~a~0.offset) (< 20 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 5593#(and (or (<= 60 main_~a~0.offset) (< 20 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (or (<= main_~a~0.offset 60) (<= main_~length~0 20)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 5594#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 64) (<= main_~length~0 20)) (= main_~arr~0.offset 0) (or (<= 64 main_~a~0.offset) (< 20 main_~length~0))), 5595#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 64) (<= main_~length~0 20)) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0) (or (<= 64 main_~a~0.offset) (< 20 main_~length~0))), 5596#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 68) (<= main_~length~0 20)) (= main_~arr~0.offset 0) (or (<= 68 main_~a~0.offset) (< 20 main_~length~0))), 5597#(and (<= 8 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 72) (<= main_~length~0 20)) (= main_~arr~0.offset 0) (or (<= 72 main_~a~0.offset) (< 20 main_~length~0))), 5598#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 12 main_~a~0.offset) (or (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (< 20 main_~length~0) (<= main_~a~0.offset 76))))) (= main_~a~0.base main_~arr~0.base) (= main_~arr~0.offset 0)), 5599#(and (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base))) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 12 main_~a~0.offset) (< 20 main_~length~0) (<= main_~a~0.offset 76))) (= main_~arr~0.offset 0)), 5600#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 12 main_~a~0.offset) (< 20 main_~length~0) (<= main_~a~0.offset 76))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset)))) (= main_~arr~0.offset 0)), 5601#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 12 main_~a~0.offset) (< 20 main_~length~0) (= main_~arr~0.offset 0) (<= main_~a~0.offset 76)), 5602#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 12 main_~a~0.offset)), 5603#(and (<= 16 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base)))] [2018-02-02 09:47:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:09,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 09:47:09,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 09:47:09,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:47:09,122 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 30 states. [2018-02-02 09:47:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:11,011 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-02-02 09:47:11,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 09:47:11,011 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 172 [2018-02-02 09:47:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:11,012 INFO L225 Difference]: With dead ends: 189 [2018-02-02 09:47:11,012 INFO L226 Difference]: Without dead ends: 189 [2018-02-02 09:47:11,012 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=255, Invalid=2825, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 09:47:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-02 09:47:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-02-02 09:47:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 09:47:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-02-02 09:47:11,014 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 172 [2018-02-02 09:47:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:11,014 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-02-02 09:47:11,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 09:47:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-02-02 09:47:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-02 09:47:11,015 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:11,015 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:11,015 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:47:11,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1438873707, now seen corresponding path program 21 times [2018-02-02 09:47:11,015 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:11,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:12,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:12,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 09:47:12,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:12,445 INFO L182 omatonBuilderFactory]: Interpolants [6033#true, 6034#false, 6035#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 6036#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 6037#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 6038#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 4 main_~a~0.offset) (< 21 main_~length~0)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 4) (<= main_~length~0 21))), 6039#(and (or (<= main_~a~0.offset 8) (<= main_~length~0 21)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 8 main_~a~0.offset) (< 21 main_~length~0))), 6040#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 12) (<= main_~length~0 21)) (or (<= 12 main_~a~0.offset) (< 21 main_~length~0)) (= main_~arr~0.offset 0)), 6041#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 16) (<= main_~length~0 21)) (or (<= 16 main_~a~0.offset) (< 21 main_~length~0)) (= main_~arr~0.offset 0)), 6042#(and (or (<= 20 main_~a~0.offset) (< 21 main_~length~0)) (or (<= main_~a~0.offset 20) (<= main_~length~0 21)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 6043#(and (or (<= 24 main_~a~0.offset) (< 21 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 24) (<= main_~length~0 21)) (= main_~arr~0.offset 0)), 6044#(and (= main_~arr~0.base main_~a~0.base) (or (<= 28 main_~a~0.offset) (< 21 main_~length~0)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 28) (<= main_~length~0 21)) (= main_~arr~0.offset 0)), 6045#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 21) (<= main_~a~0.offset 32)) (or (<= 32 main_~a~0.offset) (< 21 main_~length~0)) (= main_~arr~0.offset 0)), 6046#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 36) (<= main_~length~0 21)) (or (<= 36 main_~a~0.offset) (< 21 main_~length~0)) (= main_~arr~0.offset 0)), 6047#(and (or (<= 40 main_~a~0.offset) (< 21 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 40) (<= main_~length~0 21)) (= main_~arr~0.offset 0)), 6048#(and (or (<= main_~a~0.offset 44) (<= main_~length~0 21)) (or (<= 44 main_~a~0.offset) (< 21 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 6049#(and (or (<= main_~a~0.offset 48) (<= main_~length~0 21)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 48 main_~a~0.offset) (< 21 main_~length~0))), 6050#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 52) (<= main_~length~0 21)) (or (<= 52 main_~a~0.offset) (< 21 main_~length~0)) (= main_~arr~0.offset 0)), 6051#(and (or (<= 56 main_~a~0.offset) (< 21 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 56) (<= main_~length~0 21))), 6052#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~a~0.offset 60) (<= main_~length~0 21)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 60 main_~a~0.offset) (< 21 main_~length~0)) (= main_~arr~0.offset 0)), 6053#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 64 main_~a~0.offset) (< 21 main_~length~0)) (or (<= main_~a~0.offset 64) (<= main_~length~0 21)) (= main_~arr~0.offset 0)), 6054#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 68) (<= main_~length~0 21)) (= main_~arr~0.offset 0) (or (<= 68 main_~a~0.offset) (< 21 main_~length~0))), 6055#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 72) (<= main_~length~0 21)) (= main_~arr~0.offset 0) (or (<= 72 main_~a~0.offset) (< 21 main_~length~0))), 6056#(and (or (<= main_~a~0.offset 76) (<= main_~length~0 21)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 76 main_~a~0.offset) (< 21 main_~length~0))), 6057#(and (or (and (<= main_~a~0.offset 80) (< 21 main_~length~0)) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 6058#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (or (and (<= 0 main_~a~0.offset) (<= main_~a~0.offset 80) (< 21 main_~length~0)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0)), 6059#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (and (<= 0 main_~a~0.offset) (<= main_~a~0.offset 80) (< 21 main_~length~0)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset))))), 6060#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (<= main_~a~0.offset 80) (= main_~arr~0.offset 0) (< 21 main_~length~0)), 6061#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 0 main_~a~0.offset)), 6062#(and (<= 4 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base)))] [2018-02-02 09:47:12,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:12,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 09:47:12,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 09:47:12,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:47:12,446 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 30 states. [2018-02-02 09:47:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:14,363 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-02-02 09:47:14,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 09:47:14,364 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 180 [2018-02-02 09:47:14,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:14,364 INFO L225 Difference]: With dead ends: 197 [2018-02-02 09:47:14,364 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 09:47:14,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=255, Invalid=2825, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 09:47:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 09:47:14,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-02-02 09:47:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 09:47:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-02-02 09:47:14,367 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 180 [2018-02-02 09:47:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:14,367 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-02-02 09:47:14,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 09:47:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-02-02 09:47:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-02 09:47:14,368 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:14,368 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:14,368 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:47:14,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1076619964, now seen corresponding path program 22 times [2018-02-02 09:47:14,368 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:14,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:15,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:15,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 09:47:15,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:15,900 INFO L182 omatonBuilderFactory]: Interpolants [6528#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 64 main_~a~0.offset) (< 22 main_~length~0)) (or (<= main_~length~0 22) (<= main_~a~0.offset 64)) (= main_~arr~0.offset 0)), 6529#(and (or (<= 68 main_~a~0.offset) (< 22 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (or (<= main_~length~0 22) (<= main_~a~0.offset 68)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 6530#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~a~0.offset 72) (<= main_~length~0 22)) (or (<= 72 main_~a~0.offset) (< 22 main_~length~0)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 6531#(and (or (<= 76 main_~a~0.offset) (< 22 main_~length~0)) (or (<= main_~length~0 22) (<= main_~a~0.offset 76)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 6532#(and (or (<= main_~length~0 22) (<= main_~a~0.offset 80)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 80 main_~a~0.offset) (< 22 main_~length~0))), 6533#(and (or (<= main_~length~0 22) (<= main_~a~0.offset 80)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0) (or (<= 80 main_~a~0.offset) (< 22 main_~length~0))), 6534#(and (= main_~a~0.base main_~arr~0.base) (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= 4 main_~a~0.offset) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= main_~a~0.offset 84) (< 22 main_~length~0))) (= main_~arr~0.offset 0)))), 6535#(and (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base))) (or (and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= main_~a~0.offset 84) (= main_~arr~0.offset 0) (< 22 main_~length~0)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)))), 6536#(and (or (and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= main_~a~0.offset 84) (= main_~arr~0.offset 0) (< 22 main_~length~0)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.base main_~arr~0.base) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset))))), 6537#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= main_~a~0.offset 84) (= main_~arr~0.offset 0) (< 22 main_~length~0)), 6538#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 4 main_~a~0.offset)), 6539#(and (<= 8 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base))), 6508#true, 6509#false, 6510#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 6511#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 6512#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 6513#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~a~0.offset 4) (<= main_~length~0 22)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 4 main_~a~0.offset) (< 22 main_~length~0)) (= main_~arr~0.offset 0)), 6514#(and (= main_~arr~0.base main_~a~0.base) (or (<= 8 main_~a~0.offset) (< 22 main_~length~0)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 8) (<= main_~length~0 22)) (= main_~arr~0.offset 0)), 6515#(and (or (<= 12 main_~a~0.offset) (< 22 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~length~0 22) (<= main_~a~0.offset 12))), 6516#(and (or (<= 16 main_~a~0.offset) (< 22 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 22) (<= main_~a~0.offset 16)) (= main_~arr~0.offset 0)), 6517#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 20) (<= main_~length~0 22)) (= main_~arr~0.offset 0) (or (<= 20 main_~a~0.offset) (< 22 main_~length~0))), 6518#(and (or (<= main_~length~0 22) (<= main_~a~0.offset 24)) (= main_~arr~0.base main_~a~0.base) (or (<= 24 main_~a~0.offset) (< 22 main_~length~0)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 6519#(and (or (<= main_~length~0 22) (<= main_~a~0.offset 28)) (or (< 22 main_~length~0) (<= 28 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 6520#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 32 main_~a~0.offset) (< 22 main_~length~0)) (or (<= main_~length~0 22) (<= main_~a~0.offset 32)) (= main_~arr~0.offset 0)), 6521#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 22) (<= main_~a~0.offset 36)) (= main_~arr~0.offset 0) (or (<= 36 main_~a~0.offset) (< 22 main_~length~0))), 6522#(and (or (<= main_~length~0 22) (<= main_~a~0.offset 40)) (= main_~arr~0.base main_~a~0.base) (or (<= 40 main_~a~0.offset) (< 22 main_~length~0)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 6523#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 44 main_~a~0.offset) (< 22 main_~length~0)) (= main_~arr~0.offset 0) (or (<= main_~length~0 22) (<= main_~a~0.offset 44))), 6524#(and (or (<= main_~length~0 22) (<= main_~a~0.offset 48)) (or (<= 48 main_~a~0.offset) (< 22 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 6525#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 22) (<= main_~a~0.offset 52)) (or (<= 52 main_~a~0.offset) (< 22 main_~length~0)) (= main_~arr~0.offset 0)), 6526#(and (or (<= main_~length~0 22) (<= main_~a~0.offset 56)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 56 main_~a~0.offset) (< 22 main_~length~0)) (= main_~arr~0.offset 0)), 6527#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~a~0.offset 60) (<= main_~length~0 22)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 60 main_~a~0.offset) (< 22 main_~length~0)) (= main_~arr~0.offset 0))] [2018-02-02 09:47:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:15,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 09:47:15,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 09:47:15,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:47:15,901 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 32 states. [2018-02-02 09:47:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:18,052 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-02-02 09:47:18,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 09:47:18,052 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 188 [2018-02-02 09:47:18,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:18,053 INFO L225 Difference]: With dead ends: 205 [2018-02-02 09:47:18,053 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 09:47:18,053 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=273, Invalid=3267, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 09:47:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 09:47:18,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-02-02 09:47:18,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 09:47:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-02-02 09:47:18,055 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 188 [2018-02-02 09:47:18,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:18,055 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-02-02 09:47:18,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 09:47:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-02-02 09:47:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-02 09:47:18,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:18,056 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:18,056 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:47:18,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1515619315, now seen corresponding path program 23 times [2018-02-02 09:47:18,057 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:18,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:19,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:19,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 09:47:19,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:19,608 INFO L182 omatonBuilderFactory]: Interpolants [7005#true, 7006#false, 7007#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 7008#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 7009#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 7010#(and (or (<= 4 main_~a~0.offset) (< 23 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 4) (<= main_~length~0 23))), 7011#(and (or (<= main_~a~0.offset 8) (<= main_~length~0 23)) (or (<= 8 main_~a~0.offset) (< 23 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 7012#(and (or (<= main_~a~0.offset 12) (<= main_~length~0 23)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 12 main_~a~0.offset) (< 23 main_~length~0)) (= main_~arr~0.offset 0)), 7013#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~a~0.offset 16) (<= main_~length~0 23)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 16 main_~a~0.offset) (< 23 main_~length~0))), 7014#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 20 main_~a~0.offset) (< 23 main_~length~0)) (or (<= main_~a~0.offset 20) (<= main_~length~0 23))), 7015#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 23) (<= main_~a~0.offset 24)) (or (< 23 main_~length~0) (<= 24 main_~a~0.offset)) (= main_~arr~0.offset 0)), 7016#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 28) (<= main_~length~0 23)) (or (< 23 main_~length~0) (<= 28 main_~a~0.offset)) (= main_~arr~0.offset 0)), 7017#(and (or (<= main_~length~0 23) (<= main_~a~0.offset 32)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 32 main_~a~0.offset) (< 23 main_~length~0)) (= main_~arr~0.offset 0)), 7018#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 23) (<= main_~a~0.offset 36)) (= main_~arr~0.offset 0) (or (<= 36 main_~a~0.offset) (< 23 main_~length~0))), 7019#(and (or (<= main_~length~0 23) (<= main_~a~0.offset 40)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 40 main_~a~0.offset) (< 23 main_~length~0)) (= main_~arr~0.offset 0)), 7020#(and (or (<= main_~a~0.offset 44) (<= main_~length~0 23)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 44 main_~a~0.offset) (< 23 main_~length~0)) (= main_~arr~0.offset 0)), 7021#(and (or (<= 48 main_~a~0.offset) (< 23 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 48) (<= main_~length~0 23)) (= main_~arr~0.offset 0)), 7022#(and (or (<= main_~length~0 23) (<= main_~a~0.offset 52)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 52 main_~a~0.offset) (< 23 main_~length~0))), 7023#(and (or (< 23 main_~length~0) (<= 56 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 23) (<= main_~a~0.offset 56)) (= main_~arr~0.offset 0)), 7024#(and (or (<= main_~a~0.offset 60) (<= main_~length~0 23)) (or (<= 60 main_~a~0.offset) (< 23 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 7025#(and (or (<= main_~length~0 23) (<= main_~a~0.offset 64)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 64 main_~a~0.offset) (< 23 main_~length~0)) (= main_~arr~0.offset 0)), 7026#(and (or (<= main_~a~0.offset 68) (<= main_~length~0 23)) (or (<= 68 main_~a~0.offset) (< 23 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 7027#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 72 main_~a~0.offset) (< 23 main_~length~0)) (or (<= main_~a~0.offset 72) (<= main_~length~0 23)) (= main_~arr~0.offset 0)), 7028#(and (or (<= main_~length~0 23) (<= main_~a~0.offset 76)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 76 main_~a~0.offset) (< 23 main_~length~0)) (= main_~arr~0.offset 0)), 7029#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 23 main_~length~0) (<= 80 main_~a~0.offset)) (or (<= main_~a~0.offset 80) (<= main_~length~0 23)) (= main_~arr~0.offset 0)), 7030#(and (or (< 23 main_~length~0) (<= 84 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 84) (<= main_~length~0 23)) (= main_~arr~0.offset 0)), 7031#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= main_~a~0.offset 88) (< 23 main_~length~0))) (= main_~arr~0.offset 0)), 7032#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= main_~a~0.offset 88) (<= 0 main_~a~0.offset) (< 23 main_~length~0))) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= main_~arr~0.offset 0)), 7033#(and (or (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (<= main_~a~0.offset 88) (<= 0 main_~a~0.offset) (< 23 main_~length~0))) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset))))), 7034#(and (<= main_~a~0.offset 88) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (< 23 main_~length~0) (= main_~arr~0.offset 0)), 7035#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 0 main_~a~0.offset)), 7036#(and (<= 4 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base)))] [2018-02-02 09:47:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:19,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 09:47:19,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 09:47:19,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:47:19,609 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 32 states. [2018-02-02 09:47:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:21,828 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-02-02 09:47:21,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 09:47:21,828 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 196 [2018-02-02 09:47:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:21,829 INFO L225 Difference]: With dead ends: 213 [2018-02-02 09:47:21,829 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 09:47:21,830 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=273, Invalid=3267, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 09:47:21,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 09:47:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2018-02-02 09:47:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-02 09:47:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-02-02 09:47:21,832 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 196 [2018-02-02 09:47:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:21,832 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-02-02 09:47:21,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 09:47:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-02-02 09:47:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-02-02 09:47:21,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:21,833 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:21,833 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:47:21,833 INFO L82 PathProgramCache]: Analyzing trace with hash 357749666, now seen corresponding path program 24 times [2018-02-02 09:47:21,833 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:21,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:23,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:23,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 09:47:23,407 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:23,407 INFO L182 omatonBuilderFactory]: Interpolants [7518#true, 7519#false, 7520#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 7521#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 7522#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 7523#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 4) (<= main_~length~0 24)) (or (< 24 main_~length~0) (<= 4 main_~a~0.offset)) (= main_~arr~0.offset 0)), 7524#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 24 main_~length~0) (<= 8 main_~a~0.offset)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 8) (<= main_~length~0 24))), 7525#(and (or (<= main_~a~0.offset 12) (<= main_~length~0 24)) (or (< 24 main_~length~0) (<= 12 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 7526#(and (or (< 24 main_~length~0) (<= 16 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 16) (<= main_~length~0 24)) (= main_~arr~0.offset 0)), 7527#(and (or (< 24 main_~length~0) (<= 20 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 20) (<= main_~length~0 24))), 7528#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (< 24 main_~length~0) (<= 24 main_~a~0.offset)) (or (<= main_~length~0 24) (<= main_~a~0.offset 24))), 7529#(and (or (<= main_~a~0.offset 28) (<= main_~length~0 24)) (or (< 24 main_~length~0) (<= 28 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 7530#(and (or (<= main_~length~0 24) (<= main_~a~0.offset 32)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (< 24 main_~length~0) (<= 32 main_~a~0.offset))), 7531#(and (or (<= main_~length~0 24) (<= main_~a~0.offset 36)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (< 24 main_~length~0) (<= 36 main_~a~0.offset))), 7532#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 24) (<= main_~a~0.offset 40)) (or (< 24 main_~length~0) (<= 40 main_~a~0.offset)) (= main_~arr~0.offset 0)), 7533#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 44) (<= main_~length~0 24)) (or (< 24 main_~length~0) (<= 44 main_~a~0.offset))), 7534#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 48) (<= main_~length~0 24)) (= main_~arr~0.offset 0) (or (< 24 main_~length~0) (<= 48 main_~a~0.offset))), 7535#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~length~0 24) (<= main_~a~0.offset 52)) (or (< 24 main_~length~0) (<= 52 main_~a~0.offset))), 7536#(and (or (<= main_~length~0 24) (<= main_~a~0.offset 56)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 24 main_~length~0) (<= 56 main_~a~0.offset)) (= main_~arr~0.offset 0)), 7537#(and (or (<= main_~a~0.offset 60) (<= main_~length~0 24)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 24 main_~length~0) (<= 60 main_~a~0.offset)) (= main_~arr~0.offset 0)), 7538#(and (or (< 24 main_~length~0) (<= 64 main_~a~0.offset)) (or (<= main_~length~0 24) (<= main_~a~0.offset 64)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 7539#(and (or (< 24 main_~length~0) (<= 64 main_~a~0.offset)) (or (<= main_~length~0 24) (<= main_~a~0.offset 64)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 0 main_~a~0.offset) (= main_~arr~0.offset 0)), 7540#(and (<= 4 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 24 main_~length~0) (<= 68 main_~a~0.offset)) (= main_~arr~0.offset 0) (or (<= main_~a~0.offset 68) (<= main_~length~0 24))), 7541#(and (or (<= main_~a~0.offset 72) (<= main_~length~0 24)) (<= 8 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (< 24 main_~length~0) (<= 72 main_~a~0.offset))), 7542#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 24 main_~length~0) (<= 76 main_~a~0.offset)) (<= 12 main_~a~0.offset) (= main_~arr~0.offset 0) (or (<= main_~length~0 24) (<= main_~a~0.offset 76))), 7543#(and (or (<= main_~a~0.offset 80) (<= main_~length~0 24)) (or (< 24 main_~length~0) (<= 80 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 16 main_~a~0.offset) (= main_~arr~0.offset 0)), 7544#(and (or (< 24 main_~length~0) (<= 84 main_~a~0.offset)) (or (<= main_~a~0.offset 84) (<= main_~length~0 24)) (<= 20 main_~a~0.offset) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 7545#(and (or (<= main_~a~0.offset 88) (<= main_~length~0 24)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 24 main_~a~0.offset) (= main_~arr~0.offset 0) (or (< 24 main_~length~0) (<= 88 main_~a~0.offset))), 7546#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (and (< 24 main_~length~0) (<= main_~a~0.offset 92)) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0) (<= 28 main_~a~0.offset)), 7547#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (or (and (< 24 main_~length~0) (<= main_~a~0.offset 92)) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0))) (<= 28 main_~a~0.offset)), 7548#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (and (< 24 main_~length~0) (<= main_~a~0.offset 92)) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0) (< (+ main_~a~0.offset 3) (+ main_~arr~0.offset (* 4 main_~length~0))) (<= 28 main_~a~0.offset) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset))))), 7549#(and (< 24 main_~length~0) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= main_~a~0.offset 92) (= main_~arr~0.offset 0) (<= 28 main_~a~0.offset)), 7550#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 28 main_~a~0.offset)), 7551#(and (<= 32 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base)))] [2018-02-02 09:47:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:23,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 09:47:23,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 09:47:23,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 09:47:23,409 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 34 states. [2018-02-02 09:47:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:25,832 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-02-02 09:47:25,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 09:47:25,832 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 204 [2018-02-02 09:47:25,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:25,833 INFO L225 Difference]: With dead ends: 221 [2018-02-02 09:47:25,833 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 09:47:25,834 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=294, Invalid=3738, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 09:47:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 09:47:25,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2018-02-02 09:47:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 09:47:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-02-02 09:47:25,836 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 204 [2018-02-02 09:47:25,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:25,836 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-02-02 09:47:25,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 09:47:25,836 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-02-02 09:47:25,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-02 09:47:25,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:25,837 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:25,837 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-02-02 09:47:25,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1923611567, now seen corresponding path program 25 times [2018-02-02 09:47:25,837 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:25,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:27,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:27,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 09:47:27,450 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:27,451 INFO L182 omatonBuilderFactory]: Interpolants [8064#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 25 main_~length~0) (<= 28 main_~a~0.offset)) (= main_~arr~0.offset 0) (or (<= main_~length~0 25) (<= main_~a~0.offset 28))), 8065#(and (or (<= main_~length~0 25) (<= main_~a~0.offset 32)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 32 main_~a~0.offset) (< 25 main_~length~0))), 8066#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 36 main_~a~0.offset) (< 25 main_~length~0)) (= main_~arr~0.offset 0) (or (<= main_~length~0 25) (<= main_~a~0.offset 36))), 8067#(and (or (<= 40 main_~a~0.offset) (< 25 main_~length~0)) (or (<= main_~length~0 25) (<= main_~a~0.offset 40)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 8068#(and (or (<= main_~length~0 25) (<= main_~a~0.offset 44)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= 44 main_~a~0.offset) (< 25 main_~length~0))), 8069#(and (or (< 25 main_~length~0) (<= 48 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~length~0 25) (<= main_~a~0.offset 48))), 8070#(and (or (<= 52 main_~a~0.offset) (< 25 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 25) (<= main_~a~0.offset 52)) (= main_~arr~0.offset 0)), 8071#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 25) (<= main_~a~0.offset 56)) (or (< 25 main_~length~0) (<= 56 main_~a~0.offset)) (= main_~arr~0.offset 0)), 8072#(and (or (<= 60 main_~a~0.offset) (< 25 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 60) (<= main_~length~0 25)) (= main_~arr~0.offset 0)), 8073#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 25) (<= main_~a~0.offset 64)) (or (<= 64 main_~a~0.offset) (< 25 main_~length~0)) (= main_~arr~0.offset 0)), 8074#(and (or (<= main_~length~0 25) (<= main_~a~0.offset 68)) (or (<= 68 main_~a~0.offset) (< 25 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 8075#(and (or (<= main_~length~0 25) (<= main_~a~0.offset 72)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 72 main_~a~0.offset) (< 25 main_~length~0)) (= main_~arr~0.offset 0)), 8076#(and (= main_~arr~0.base main_~a~0.base) (or (<= 76 main_~a~0.offset) (< 25 main_~length~0)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 25) (<= main_~a~0.offset 76)) (= main_~arr~0.offset 0)), 8077#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 25) (<= main_~a~0.offset 80)) (or (< 25 main_~length~0) (<= 80 main_~a~0.offset)) (= main_~arr~0.offset 0)), 8078#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 25) (<= main_~a~0.offset 84)) (= main_~arr~0.offset 0) (or (< 25 main_~length~0) (<= 84 main_~a~0.offset))), 8079#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 88 main_~a~0.offset) (< 25 main_~length~0)) (or (<= main_~length~0 25) (<= main_~a~0.offset 88)) (= main_~arr~0.offset 0)), 8080#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 25) (<= main_~a~0.offset 92)) (= main_~arr~0.offset 0) (or (< 25 main_~length~0) (<= 92 main_~a~0.offset))), 8081#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4)) (and (< 25 main_~length~0) (<= main_~a~0.offset 96))) (= main_~arr~0.offset 0)), 8082#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (and (< 25 main_~length~0) (<= 0 main_~a~0.offset) (<= main_~a~0.offset 96)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= main_~arr~0.offset 0)), 8083#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (and (< 25 main_~length~0) (<= 0 main_~a~0.offset) (<= main_~a~0.offset 96)) (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (= main_~arr~0.offset 0) (or (not (= (+ main_~arr~0.offset (* 4 main_~length~0)) (+ main_~a~0.offset 4))) (and (= |main_#t~mem2| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= |main_#t~mem3| (select (select |#memory_int| main_~arr~0.base) main_~a~0.offset))))), 8084#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (< 25 main_~length~0) (<= 0 main_~a~0.offset) (<= main_~a~0.offset 96) (= main_~arr~0.offset 0)), 8085#(and (<= (+ main_~a~0.offset 8) (select |#length| main_~a~0.base)) (<= 0 main_~a~0.offset)), 8086#(and (<= 4 main_~a~0.offset) (<= (+ main_~a~0.offset 4) (select |#length| main_~a~0.base))), 8053#true, 8054#false, 8055#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 8056#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 8057#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~a~0.offset 0) (= main_~arr~0.offset 0)), 8058#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~a~0.offset 4) (<= main_~length~0 25)) (or (<= 4 main_~a~0.offset) (< 25 main_~length~0)) (= main_~arr~0.offset 0)), 8059#(and (= main_~arr~0.base main_~a~0.base) (or (<= main_~length~0 25) (<= main_~a~0.offset 8)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= 8 main_~a~0.offset) (< 25 main_~length~0)) (= main_~arr~0.offset 0)), 8060#(and (or (<= main_~length~0 25) (<= main_~a~0.offset 12)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (< 25 main_~length~0) (<= 12 main_~a~0.offset)) (= main_~arr~0.offset 0)), 8061#(and (or (<= 16 main_~a~0.offset) (< 25 main_~length~0)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (or (<= main_~length~0 25) (<= main_~a~0.offset 16)) (= main_~arr~0.offset 0)), 8062#(and (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (or (<= main_~length~0 25) (<= main_~a~0.offset 20)) (or (<= 20 main_~a~0.offset) (< 25 main_~length~0))), 8063#(and (or (<= main_~length~0 25) (<= main_~a~0.offset 24)) (or (< 25 main_~length~0) (<= 24 main_~a~0.offset)) (= main_~arr~0.base main_~a~0.base) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0))] [2018-02-02 09:47:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:27,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 09:47:27,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 09:47:27,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 09:47:27,453 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 34 states. Received shutdown request... [2018-02-02 09:47:28,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:47:28,418 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 09:47:28,423 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 09:47:28,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:47:28 BoogieIcfgContainer [2018-02-02 09:47:28,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:47:28,425 INFO L168 Benchmark]: Toolchain (without parser) took 53154.33 ms. Allocated memory was 405.3 MB in the beginning and 1.4 GB in the end (delta: 968.4 MB). Free memory was 363.3 MB in the beginning and 1.2 GB in the end (delta: -792.9 MB). Peak memory consumption was 175.5 MB. Max. memory is 5.3 GB. [2018-02-02 09:47:28,426 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 405.3 MB. Free memory is still 368.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:47:28,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.03 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 352.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:47:28,426 INFO L168 Benchmark]: Boogie Preprocessor took 27.88 ms. Allocated memory is still 405.3 MB. Free memory was 352.7 MB in the beginning and 350.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:47:28,427 INFO L168 Benchmark]: RCFGBuilder took 163.78 ms. Allocated memory is still 405.3 MB. Free memory was 350.1 MB in the beginning and 333.9 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:47:28,427 INFO L168 Benchmark]: TraceAbstraction took 52804.67 ms. Allocated memory was 405.3 MB in the beginning and 1.4 GB in the end (delta: 968.4 MB). Free memory was 332.6 MB in the beginning and 1.2 GB in the end (delta: -823.6 MB). Peak memory consumption was 144.8 MB. Max. memory is 5.3 GB. [2018-02-02 09:47:28,428 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 405.3 MB. Free memory is still 368.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 155.03 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 352.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.88 ms. Allocated memory is still 405.3 MB. Free memory was 352.7 MB in the beginning and 350.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 163.78 ms. Allocated memory is still 405.3 MB. Free memory was 350.1 MB in the beginning and 333.9 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52804.67 ms. Allocated memory was 405.3 MB in the beginning and 1.4 GB in the end (delta: 968.4 MB). Free memory was 332.6 MB in the beginning and 1.2 GB in the end (delta: -823.6 MB). Peak memory consumption was 144.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (85 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (85 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (85 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (85 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (85 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (85 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (85 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (85 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (85 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (85 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 540]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 14 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (85 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 11 error locations. TIMEOUT Result, 52.7s OverallTime, 31 OverallIterations, 26 TraceHistogramMax, 27.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 952 SDtfs, 5998 SDslu, 12367 SDs, 0 SdLazy, 39520 SolverSat, 874 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1043 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 981 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6347 ImplicationChecksByTransitivity, 27.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 2/21452 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 32 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 22.7s InterpolantComputationTime, 2988 NumberOfCodeBlocks, 2988 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2957 ConstructedInterpolants, 0 QuantifiedInterpolants, 10708888 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 6 PerfectInterpolantSequences, 2/21452 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-47-28-435.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-47-28-435.csv Completed graceful shutdown