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/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:30:52,519 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:30:52,520 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:30:52,530 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:30:52,530 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:30:52,531 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:30:52,532 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:30:52,533 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:30:52,534 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:30:52,535 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:30:52,536 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:30:52,536 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:30:52,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:30:52,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:30:52,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:30:52,540 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:30:52,542 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:30:52,543 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:30:52,544 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:30:52,545 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:30:52,547 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:30:52,547 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:30:52,547 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:30:52,548 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:30:52,548 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:30:52,549 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:30:52,550 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:30:52,550 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:30:52,550 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:30:52,550 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:30:52,551 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:30:52,551 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 10:30:52,561 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:30:52,561 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:30:52,562 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:30:52,562 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:30:52,562 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:30:52,563 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:30:52,563 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:30:52,563 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:30:52,563 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:30:52,563 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:30:52,563 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:30:52,564 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:30:52,564 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:30:52,564 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:30:52,564 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:30:52,564 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:30:52,564 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:30:52,565 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:30:52,565 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:30:52,565 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:30:52,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:30:52,565 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:30:52,565 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:30:52,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:30:52,605 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:30:52,608 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:30:52,609 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:30:52,609 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:30:52,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:30:52,748 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:30:52,749 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:30:52,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:30:52,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:30:52,754 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:30:52,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:30:52" (1/1) ... [2018-02-02 10:30:52,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3278a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:52, skipping insertion in model container [2018-02-02 10:30:52,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:30:52" (1/1) ... [2018-02-02 10:30:52,768 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:30:52,798 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:30:52,891 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:30:52,903 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:30:52,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:52 WrapperNode [2018-02-02 10:30:52,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:30:52,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:30:52,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:30:52,910 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:30:52,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:52" (1/1) ... [2018-02-02 10:30:52,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:52" (1/1) ... [2018-02-02 10:30:52,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:52" (1/1) ... [2018-02-02 10:30:52,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:52" (1/1) ... [2018-02-02 10:30:52,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:52" (1/1) ... [2018-02-02 10:30:52,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:52" (1/1) ... [2018-02-02 10:30:52,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:52" (1/1) ... [2018-02-02 10:30:52,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:30:52,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:30:52,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:30:52,940 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:30:52,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:52" (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 10:30:52,978 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:30:52,978 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:30:52,978 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:30:52,978 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:30:52,978 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:30:52,978 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:30:52,978 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:30:52,978 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:30:52,978 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:30:52,978 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:30:52,978 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:30:52,979 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:30:52,979 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:30:52,979 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:30:52,979 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:30:52,979 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:30:52,979 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:30:53,283 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:30:53,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:30:53 BoogieIcfgContainer [2018-02-02 10:30:53,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:30:53,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:30:53,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:30:53,289 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:30:53,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:30:52" (1/3) ... [2018-02-02 10:30:53,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbe19aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:30:53, skipping insertion in model container [2018-02-02 10:30:53,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:52" (2/3) ... [2018-02-02 10:30:53,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbe19aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:30:53, skipping insertion in model container [2018-02-02 10:30:53,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:30:53" (3/3) ... [2018-02-02 10:30:53,291 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-circular_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:30:53,297 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:30:53,301 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-02-02 10:30:53,332 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:30:53,333 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:30:53,333 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:30:53,333 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:30:53,333 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:30:53,333 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:30:53,333 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:30:53,333 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:30:53,334 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:30:53,347 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2018-02-02 10:30:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:30:53,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:53,355 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:53,356 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:53,360 INFO L82 PathProgramCache]: Analyzing trace with hash -414871971, now seen corresponding path program 1 times [2018-02-02 10:30:53,408 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:53,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:53,492 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 10:30:53,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:53,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:30:53,495 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:53,495 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 10:30:53,495 INFO L182 omatonBuilderFactory]: Interpolants [106#true, 107#false, 108#(= 1 (select |#valid| |main_#t~malloc0.base|)), 109#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 10:30:53,495 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 10:30:53,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:30:53,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:30:53,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:30:53,505 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2018-02-02 10:30:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:53,711 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2018-02-02 10:30:53,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:30:53,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:30:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:53,718 INFO L225 Difference]: With dead ends: 114 [2018-02-02 10:30:53,718 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 10:30:53,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 10:30:53,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 10:30:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2018-02-02 10:30:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 10:30:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-02-02 10:30:53,747 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 8 [2018-02-02 10:30:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:53,748 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-02-02 10:30:53,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:30:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-02-02 10:30:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:30:53,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:53,748 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:53,748 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash -414871970, now seen corresponding path program 1 times [2018-02-02 10:30:53,749 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:53,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:53,802 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 10:30:53,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:53,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:30:53,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:53,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 10:30:53,803 INFO L182 omatonBuilderFactory]: Interpolants [322#true, 323#false, 324#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 325#(and (= (select |#length| main_~head~0.base) 8) (= main_~head~0.offset 0))] [2018-02-02 10:30:53,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 10:30:53,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:30:53,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:30:53,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:30:53,805 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 4 states. [2018-02-02 10:30:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:53,884 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-02-02 10:30:53,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:30:53,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:30:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:53,885 INFO L225 Difference]: With dead ends: 103 [2018-02-02 10:30:53,885 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 10:30:53,886 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 10:30:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 10:30:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2018-02-02 10:30:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 10:30:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-02-02 10:30:53,893 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 8 [2018-02-02 10:30:53,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:53,893 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-02-02 10:30:53,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:30:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-02-02 10:30:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:30:53,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:53,894 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:53,894 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:53,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1612643290, now seen corresponding path program 1 times [2018-02-02 10:30:53,895 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:53,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:53,934 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 10:30:53,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:53,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:30:53,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:53,935 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 10:30:53,935 INFO L182 omatonBuilderFactory]: Interpolants [523#true, 524#false, 525#(= 1 (select |#valid| main_~head~0.base)), 526#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:30:53,935 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 10:30:53,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:30:53,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:30:53,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:30:53,936 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 4 states. [2018-02-02 10:30:54,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:54,029 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-02-02 10:30:54,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:30:54,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 10:30:54,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:54,030 INFO L225 Difference]: With dead ends: 88 [2018-02-02 10:30:54,030 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 10:30:54,030 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 10:30:54,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 10:30:54,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-02-02 10:30:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:30:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-02 10:30:54,035 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 14 [2018-02-02 10:30:54,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:54,035 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-02 10:30:54,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:30:54,036 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-02 10:30:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:30:54,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:54,036 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:54,036 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:54,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1612643291, now seen corresponding path program 1 times [2018-02-02 10:30:54,037 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:54,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:54,107 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 10:30:54,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:54,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:30:54,107 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:54,107 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 10:30:54,108 INFO L182 omatonBuilderFactory]: Interpolants [698#true, 699#false, 700#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 701#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 702#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))] [2018-02-02 10:30:54,108 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 10:30:54,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:30:54,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:30:54,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:30:54,109 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 5 states. [2018-02-02 10:30:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:54,255 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-02-02 10:30:54,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:30:54,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:30:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:54,256 INFO L225 Difference]: With dead ends: 101 [2018-02-02 10:30:54,256 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 10:30:54,256 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 10:30:54,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 10:30:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 88. [2018-02-02 10:30:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:30:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-02-02 10:30:54,261 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 14 [2018-02-02 10:30:54,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:54,261 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-02-02 10:30:54,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:30:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-02-02 10:30:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:30:54,262 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:54,262 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 10:30:54,262 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:54,263 INFO L82 PathProgramCache]: Analyzing trace with hash -22797273, now seen corresponding path program 1 times [2018-02-02 10:30:54,263 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:54,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:54,322 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 10:30:54,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:54,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:30:54,323 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:54,323 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 10:30:54,323 INFO L182 omatonBuilderFactory]: Interpolants [896#true, 897#false, 898#(= 1 (select |#valid| |main_#t~malloc4.base|)), 899#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 900#(= 1 (select |#valid| |main_#t~mem6.base|)), 901#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:30:54,323 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 10:30:54,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:30:54,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:30:54,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:30:54,324 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 6 states. [2018-02-02 10:30:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:54,490 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2018-02-02 10:30:54,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:30:54,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:30:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:54,491 INFO L225 Difference]: With dead ends: 132 [2018-02-02 10:30:54,491 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 10:30:54,491 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:30:54,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 10:30:54,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 87. [2018-02-02 10:30:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 10:30:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-02-02 10:30:54,494 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 18 [2018-02-02 10:30:54,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:54,494 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-02-02 10:30:54,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:30:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-02-02 10:30:54,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:30:54,495 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:54,495 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 10:30:54,495 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:54,495 INFO L82 PathProgramCache]: Analyzing trace with hash -22797272, now seen corresponding path program 1 times [2018-02-02 10:30:54,496 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:54,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:54,550 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 10:30:54,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:54,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:30:54,550 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:54,551 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 10:30:54,551 INFO L182 omatonBuilderFactory]: Interpolants [1128#true, 1129#false, 1130#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 1131#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 1132#(and (= 0 |main_#t~mem6.offset|) (= 8 (select |#length| |main_#t~mem6.base|))), 1133#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))] [2018-02-02 10:30:54,551 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 10:30:54,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:30:54,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:30:54,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:30:54,552 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 6 states. [2018-02-02 10:30:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:54,824 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-02-02 10:30:54,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:30:54,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:30:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:54,825 INFO L225 Difference]: With dead ends: 131 [2018-02-02 10:30:54,826 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 10:30:54,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:30:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 10:30:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 75. [2018-02-02 10:30:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 10:30:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-02-02 10:30:54,831 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 18 [2018-02-02 10:30:54,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:54,831 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-02-02 10:30:54,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:30:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-02-02 10:30:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:30:54,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:54,832 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:54,832 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:54,833 INFO L82 PathProgramCache]: Analyzing trace with hash -152886338, now seen corresponding path program 1 times [2018-02-02 10:30:54,833 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:54,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:54,969 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 10:30:54,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:54,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:30:54,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:54,970 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 10:30:54,970 INFO L182 omatonBuilderFactory]: Interpolants [1351#true, 1352#false, 1353#(= 0 |main_#t~malloc0.offset|), 1354#(= main_~head~0.offset 0), 1355#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 1356#(and (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 1357#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 1358#(= 1 (select |#valid| |main_#t~mem11.base|)), 1359#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:30:54,970 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 10:30:54,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:30:54,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:30:54,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:30:54,971 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 9 states. [2018-02-02 10:30:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:55,153 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-02-02 10:30:55,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:30:55,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-02 10:30:55,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:55,154 INFO L225 Difference]: With dead ends: 127 [2018-02-02 10:30:55,154 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 10:30:55,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:30:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 10:30:55,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 86. [2018-02-02 10:30:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 10:30:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-02-02 10:30:55,158 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 21 [2018-02-02 10:30:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:55,158 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-02-02 10:30:55,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:30:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-02-02 10:30:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:30:55,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:55,159 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:55,159 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:55,160 INFO L82 PathProgramCache]: Analyzing trace with hash -152886337, now seen corresponding path program 1 times [2018-02-02 10:30:55,160 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:55,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:55,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 10:30:55,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:55,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:30:55,316 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:55,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 10:30:55,317 INFO L182 omatonBuilderFactory]: Interpolants [1589#true, 1590#false, 1591#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 1592#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 1593#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 1594#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 1595#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 1596#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| |main_#t~mem11.base|))), 1597#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset))] [2018-02-02 10:30:55,317 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 10:30:55,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:30:55,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:30:55,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:30:55,317 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 9 states. [2018-02-02 10:30:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:55,530 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2018-02-02 10:30:55,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:30:55,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-02 10:30:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:55,531 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:30:55,531 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:30:55,532 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:30:55,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:30:55,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 99. [2018-02-02 10:30:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:30:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2018-02-02 10:30:55,536 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 21 [2018-02-02 10:30:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:55,536 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2018-02-02 10:30:55,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:30:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2018-02-02 10:30:55,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:30:55,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:55,537 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:55,537 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:55,538 INFO L82 PathProgramCache]: Analyzing trace with hash -986431451, now seen corresponding path program 1 times [2018-02-02 10:30:55,538 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:55,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:55,661 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 10:30:55,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:55,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:30:55,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:55,661 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 10:30:55,661 INFO L182 omatonBuilderFactory]: Interpolants [1872#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 1873#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 1874#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 1875#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 1876#(= 1 (select |#valid| |main_#t~mem13.base|)), 1867#true, 1868#false, 1869#(= 0 |main_#t~malloc0.offset|), 1870#(= main_~head~0.offset 0), 1871#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0))] [2018-02-02 10:30:55,662 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 10:30:55,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:30:55,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:30:55,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:30:55,662 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 10 states. [2018-02-02 10:30:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:55,963 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2018-02-02 10:30:55,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:30:55,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-02-02 10:30:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:55,964 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:30:55,964 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:30:55,965 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:30:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:30:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 99. [2018-02-02 10:30:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:30:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-02-02 10:30:55,969 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 25 [2018-02-02 10:30:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:55,969 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-02-02 10:30:55,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:30:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-02-02 10:30:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:30:55,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:55,970 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:55,971 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:55,971 INFO L82 PathProgramCache]: Analyzing trace with hash -986431450, now seen corresponding path program 1 times [2018-02-02 10:30:55,972 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:55,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:56,136 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 10:30:56,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:56,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:30:56,136 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:56,137 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 10:30:56,137 INFO L182 omatonBuilderFactory]: Interpolants [2144#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 2145#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 2146#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2147#(and (= (select |#length| |main_#t~mem13.base|) 8) (= |main_#t~mem13.offset| 0)), 2139#true, 2140#false, 2141#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 2142#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 2143#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:30:56,137 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 10:30:56,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:30:56,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:30:56,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:30:56,138 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 9 states. [2018-02-02 10:30:56,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:56,461 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-02-02 10:30:56,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:30:56,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-02-02 10:30:56,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:56,462 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:30:56,462 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 10:30:56,463 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:30:56,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 10:30:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 99. [2018-02-02 10:30:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:30:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2018-02-02 10:30:56,466 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 25 [2018-02-02 10:30:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:56,466 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2018-02-02 10:30:56,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:30:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-02-02 10:30:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:30:56,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:56,470 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:56,470 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:56,470 INFO L82 PathProgramCache]: Analyzing trace with hash -515063564, now seen corresponding path program 1 times [2018-02-02 10:30:56,471 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:56,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:56,517 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 10:30:56,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:56,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:30:56,518 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:56,518 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 10:30:56,519 INFO L182 omatonBuilderFactory]: Interpolants [2416#false, 2417#(= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 2418#(= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 2419#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 2420#(= 1 (select |#valid| |main_#t~mem20.base|)), 2421#(= 1 (select |#valid| main_~x~0.base)), 2415#true] [2018-02-02 10:30:56,519 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 10:30:56,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:30:56,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:30:56,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:30:56,520 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 7 states. [2018-02-02 10:30:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:56,736 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2018-02-02 10:30:56,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:30:56,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 10:30:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:56,738 INFO L225 Difference]: With dead ends: 135 [2018-02-02 10:30:56,738 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 10:30:56,738 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:30:56,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 10:30:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 101. [2018-02-02 10:30:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 10:30:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-02-02 10:30:56,741 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 26 [2018-02-02 10:30:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:56,741 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2018-02-02 10:30:56,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:30:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-02-02 10:30:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:30:56,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:56,742 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:56,743 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:56,743 INFO L82 PathProgramCache]: Analyzing trace with hash -515063563, now seen corresponding path program 1 times [2018-02-02 10:30:56,743 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:56,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:56,932 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 10:30:56,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:56,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:30:56,933 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:56,933 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 10:30:56,933 INFO L182 omatonBuilderFactory]: Interpolants [2672#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2673#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 2674#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2675#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 |main_#t~mem11.offset|) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2676#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~x~0.offset)), 2677#(and (= 8 (select |#length| |main_#t~mem20.base|)) (<= |main_#t~mem20.offset| 0) (<= 0 |main_#t~mem20.offset|)), 2678#(and (= (select |#length| main_~x~0.base) 8) (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset)), 2668#true, 2669#false, 2670#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 2671#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0))] [2018-02-02 10:30:56,934 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 10:30:56,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:30:56,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:30:56,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:30:56,934 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 11 states. [2018-02-02 10:30:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:57,214 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2018-02-02 10:30:57,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:30:57,214 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-02-02 10:30:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:57,215 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:30:57,215 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:30:57,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:30:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:30:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2018-02-02 10:30:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:30:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2018-02-02 10:30:57,217 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 26 [2018-02-02 10:30:57,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:57,217 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2018-02-02 10:30:57,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:30:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2018-02-02 10:30:57,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:30:57,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:57,218 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:57,218 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:57,218 INFO L82 PathProgramCache]: Analyzing trace with hash -90305214, now seen corresponding path program 1 times [2018-02-02 10:30:57,219 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:57,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:57,427 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 10:30:57,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:57,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 10:30:57,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:57,427 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 10:30:57,427 INFO L182 omatonBuilderFactory]: Interpolants [2981#true, 2982#false, 2983#(= |#valid| |old(#valid)|), 2984#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (= 0 |main_#t~malloc0.offset|)), 2985#(and (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~head~0.offset 0)), 2986#(and (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2987#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (store |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0) |old(#valid)|) (= main_~head~0.base main_~x~0.base) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 2988#(and (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2989#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 |main_#t~mem11.offset|) (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0))), 2990#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 0 main_~x~0.offset)), 2991#(and (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 2992#(and (not (= 0 |main_#t~mem20.base|)) (= (store |#valid| |main_#t~mem20.base| 0) |old(#valid)|)), 2993#(and (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|))] [2018-02-02 10:30:57,427 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 10:30:57,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:30:57,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:30:57,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:30:57,428 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand 13 states. [2018-02-02 10:30:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:57,902 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-02-02 10:30:57,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:30:57,903 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-02 10:30:57,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:57,903 INFO L225 Difference]: With dead ends: 144 [2018-02-02 10:30:57,903 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 10:30:57,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:30:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 10:30:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 125. [2018-02-02 10:30:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 10:30:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 149 transitions. [2018-02-02 10:30:57,905 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 149 transitions. Word has length 30 [2018-02-02 10:30:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:57,906 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 149 transitions. [2018-02-02 10:30:57,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:30:57,906 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 149 transitions. [2018-02-02 10:30:57,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:30:57,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:57,906 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:57,906 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:57,907 INFO L82 PathProgramCache]: Analyzing trace with hash -709364135, now seen corresponding path program 1 times [2018-02-02 10:30:57,907 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:57,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:58,069 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 10:30:58,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:58,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:30:58,069 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:58,070 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 10:30:58,070 INFO L182 omatonBuilderFactory]: Interpolants [3296#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 3297#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 3298#(= 1 (select |#valid| |main_#t~mem15.base|)), 3289#true, 3290#false, 3291#(= 0 |main_#t~malloc0.offset|), 3292#(= main_~head~0.offset 0), 3293#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 3294#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 3295#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:30:58,070 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 10:30:58,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:30:58,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:30:58,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:30:58,071 INFO L87 Difference]: Start difference. First operand 125 states and 149 transitions. Second operand 10 states. [2018-02-02 10:30:58,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:58,351 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-02-02 10:30:58,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:30:58,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-02-02 10:30:58,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:58,352 INFO L225 Difference]: With dead ends: 144 [2018-02-02 10:30:58,352 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 10:30:58,352 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:30:58,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 10:30:58,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2018-02-02 10:30:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 10:30:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2018-02-02 10:30:58,355 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 30 [2018-02-02 10:30:58,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:58,356 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2018-02-02 10:30:58,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:30:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2018-02-02 10:30:58,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:30:58,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:58,356 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:58,357 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:58,357 INFO L82 PathProgramCache]: Analyzing trace with hash -709364134, now seen corresponding path program 1 times [2018-02-02 10:30:58,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:58,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:58,508 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 10:30:58,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:58,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:30:58,509 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:58,509 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 10:30:58,509 INFO L182 omatonBuilderFactory]: Interpolants [3584#true, 3585#false, 3586#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 3587#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 3588#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3589#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 3590#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 3591#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3592#(and (= (select |#length| |main_#t~mem15.base|) 8) (= |main_#t~mem15.offset| 0))] [2018-02-02 10:30:58,509 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 10:30:58,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:30:58,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:30:58,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:30:58,510 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand 9 states. [2018-02-02 10:30:58,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:58,816 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-02-02 10:30:58,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:30:58,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-02-02 10:30:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:58,817 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:30:58,817 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:30:58,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:30:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:30:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 125. [2018-02-02 10:30:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 10:30:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 147 transitions. [2018-02-02 10:30:58,821 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 147 transitions. Word has length 30 [2018-02-02 10:30:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:58,821 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 147 transitions. [2018-02-02 10:30:58,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:30:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 147 transitions. [2018-02-02 10:30:58,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:30:58,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:58,821 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:58,822 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:58,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1139830908, now seen corresponding path program 1 times [2018-02-02 10:30:58,822 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:58,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:58,841 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 10:30:58,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:58,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:30:58,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:58,842 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 10:30:58,842 INFO L182 omatonBuilderFactory]: Interpolants [3880#true, 3881#false, 3882#(= main_~state~0 1)] [2018-02-02 10:30:58,842 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 10:30:58,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:30:58,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:30:58,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:30:58,843 INFO L87 Difference]: Start difference. First operand 125 states and 147 transitions. Second operand 3 states. [2018-02-02 10:30:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:58,855 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2018-02-02 10:30:58,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:30:58,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-02-02 10:30:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:58,858 INFO L225 Difference]: With dead ends: 191 [2018-02-02 10:30:58,858 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 10:30:58,858 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:30:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 10:30:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 140. [2018-02-02 10:30:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 10:30:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 164 transitions. [2018-02-02 10:30:58,863 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 164 transitions. Word has length 30 [2018-02-02 10:30:58,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:58,863 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 164 transitions. [2018-02-02 10:30:58,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:30:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 164 transitions. [2018-02-02 10:30:58,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:30:58,864 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:58,864 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:58,865 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:58,865 INFO L82 PathProgramCache]: Analyzing trace with hash -836244840, now seen corresponding path program 1 times [2018-02-02 10:30:58,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:58,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:59,131 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 10:30:59,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:59,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:30:59,131 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:59,132 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 10:30:59,132 INFO L182 omatonBuilderFactory]: Interpolants [4224#(and (= 0 |main_#t~mem20.offset|) (= 0 (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 4)))), 4225#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))), 4226#(= 0 |main_#t~mem21|), 4214#true, 4215#false, 4216#(= 0 |main_#t~malloc0.offset|), 4217#(= main_~head~0.offset 0), 4218#(and (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4219#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.offset 0) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 4220#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 |main_#t~mem11.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4221#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4222#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) |main_#t~mem12|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4223#(and (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4))))] [2018-02-02 10:30:59,132 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 10:30:59,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:30:59,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:30:59,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:30:59,133 INFO L87 Difference]: Start difference. First operand 140 states and 164 transitions. Second operand 13 states. [2018-02-02 10:30:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:59,399 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2018-02-02 10:30:59,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:30:59,399 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-02 10:30:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:59,400 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:30:59,400 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 10:30:59,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:30:59,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 10:30:59,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2018-02-02 10:30:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 10:30:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2018-02-02 10:30:59,402 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 32 [2018-02-02 10:30:59,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:59,403 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2018-02-02 10:30:59,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:30:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2018-02-02 10:30:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:30:59,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:59,403 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:59,403 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:59,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1537011505, now seen corresponding path program 1 times [2018-02-02 10:30:59,404 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:59,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:59,577 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 10:30:59,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:59,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:30:59,577 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:59,578 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 10:30:59,578 INFO L182 omatonBuilderFactory]: Interpolants [4545#true, 4546#false, 4547#(= 0 |main_#t~malloc0.offset|), 4548#(= main_~head~0.offset 0), 4549#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 4550#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 4551#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4552#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 4553#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4554#(= 1 (select |#valid| |main_#t~mem19.base|)), 4555#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:30:59,578 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 10:30:59,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:30:59,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:30:59,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:30:59,578 INFO L87 Difference]: Start difference. First operand 140 states and 163 transitions. Second operand 11 states. [2018-02-02 10:30:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:59,944 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2018-02-02 10:30:59,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:30:59,944 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-02-02 10:30:59,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:59,945 INFO L225 Difference]: With dead ends: 156 [2018-02-02 10:30:59,945 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:30:59,945 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:30:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:30:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2018-02-02 10:30:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:30:59,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2018-02-02 10:30:59,949 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 33 [2018-02-02 10:30:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:59,949 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2018-02-02 10:30:59,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:30:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2018-02-02 10:30:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:30:59,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:59,950 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:59,950 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:30:59,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1537011506, now seen corresponding path program 1 times [2018-02-02 10:30:59,951 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:59,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:00,121 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 10:31:00,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:00,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:31:00,121 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:00,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 10:31:00,122 INFO L182 omatonBuilderFactory]: Interpolants [4880#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 4881#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 4882#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4883#(and (= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 4884#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 4875#true, 4876#false, 4877#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 4878#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 4879#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:31:00,122 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 10:31:00,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:31:00,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:31:00,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:31:00,122 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand 10 states. [2018-02-02 10:31:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:00,393 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2018-02-02 10:31:00,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:31:00,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-02-02 10:31:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:00,393 INFO L225 Difference]: With dead ends: 184 [2018-02-02 10:31:00,393 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 10:31:00,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:31:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 10:31:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 156. [2018-02-02 10:31:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:31:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 185 transitions. [2018-02-02 10:31:00,396 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 185 transitions. Word has length 33 [2018-02-02 10:31:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:00,396 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 185 transitions. [2018-02-02 10:31:00,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:31:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 185 transitions. [2018-02-02 10:31:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:31:00,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:00,397 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:00,397 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash 416235869, now seen corresponding path program 1 times [2018-02-02 10:31:00,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:00,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:00,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:00,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:31:00,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:00,524 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 10:31:00,524 INFO L182 omatonBuilderFactory]: Interpolants [5248#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 5249#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|))), 5250#(and (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 5251#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base))), 5252#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 5253#(= 1 (select |#valid| |main_#t~mem11.base|)), 5254#(= 1 (select |#valid| main_~x~0.base)), 5243#true, 5244#false, 5245#(= (select |#valid| main_~head~0.base) 1), 5246#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 5247#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base))] [2018-02-02 10:31:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:00,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:31:00,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:31:00,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:31:00,525 INFO L87 Difference]: Start difference. First operand 156 states and 185 transitions. Second operand 12 states. [2018-02-02 10:31:00,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:00,812 INFO L93 Difference]: Finished difference Result 245 states and 284 transitions. [2018-02-02 10:31:00,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:31:00,813 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-02-02 10:31:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:00,814 INFO L225 Difference]: With dead ends: 245 [2018-02-02 10:31:00,814 INFO L226 Difference]: Without dead ends: 245 [2018-02-02 10:31:00,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:31:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-02 10:31:00,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 186. [2018-02-02 10:31:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 10:31:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 219 transitions. [2018-02-02 10:31:00,818 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 219 transitions. Word has length 35 [2018-02-02 10:31:00,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:00,818 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 219 transitions. [2018-02-02 10:31:00,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:31:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 219 transitions. [2018-02-02 10:31:00,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:31:00,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:00,819 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:00,819 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:00,819 INFO L82 PathProgramCache]: Analyzing trace with hash 416235870, now seen corresponding path program 1 times [2018-02-02 10:31:00,820 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:00,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:00,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:00,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:31:00,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:00,991 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 10:31:00,991 INFO L182 omatonBuilderFactory]: Interpolants [5712#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 5713#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 5714#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5715#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 5716#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5717#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| |main_#t~mem11.base|))), 5718#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset)), 5708#true, 5709#false, 5710#(= (select |#valid| main_~head~0.base) 1), 5711#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 10:31:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:00,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:31:00,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:31:00,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:31:00,992 INFO L87 Difference]: Start difference. First operand 186 states and 219 transitions. Second operand 11 states. [2018-02-02 10:31:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:01,351 INFO L93 Difference]: Finished difference Result 257 states and 293 transitions. [2018-02-02 10:31:01,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:31:01,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-02-02 10:31:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:01,352 INFO L225 Difference]: With dead ends: 257 [2018-02-02 10:31:01,352 INFO L226 Difference]: Without dead ends: 257 [2018-02-02 10:31:01,352 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:31:01,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-02 10:31:01,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 199. [2018-02-02 10:31:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 10:31:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2018-02-02 10:31:01,356 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 35 [2018-02-02 10:31:01,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:01,356 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2018-02-02 10:31:01,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:31:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2018-02-02 10:31:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:31:01,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:01,357 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:01,357 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:01,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1483020824, now seen corresponding path program 1 times [2018-02-02 10:31:01,358 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:01,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:01,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:01,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:31:01,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:01,511 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 10:31:01,511 INFO L182 omatonBuilderFactory]: Interpolants [6192#(= main_~head~0.offset 0), 6193#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 6194#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 6195#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6196#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 6197#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 6198#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 6199#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 6200#(= 1 (select |#valid| |main_#t~mem13.base|)), 6189#true, 6190#false, 6191#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 10:31:01,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:01,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:31:01,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:31:01,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:31:01,512 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand 12 states. [2018-02-02 10:31:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:02,258 INFO L93 Difference]: Finished difference Result 215 states and 239 transitions. [2018-02-02 10:31:02,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:31:02,260 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-02-02 10:31:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:02,261 INFO L225 Difference]: With dead ends: 215 [2018-02-02 10:31:02,261 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 10:31:02,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:31:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 10:31:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 199. [2018-02-02 10:31:02,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 10:31:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 236 transitions. [2018-02-02 10:31:02,265 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 236 transitions. Word has length 37 [2018-02-02 10:31:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:02,265 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 236 transitions. [2018-02-02 10:31:02,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:31:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 236 transitions. [2018-02-02 10:31:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:31:02,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:02,266 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:02,266 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:02,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1483020825, now seen corresponding path program 1 times [2018-02-02 10:31:02,267 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:02,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:02,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:02,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:31:02,649 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:02,649 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 10:31:02,649 INFO L182 omatonBuilderFactory]: Interpolants [6640#false, 6641#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 6642#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 6643#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6644#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 6645#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 6646#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 6647#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 6648#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 6649#(and (= (select |#length| |main_#t~mem13.base|) 8) (= |main_#t~mem13.offset| 0)), 6639#true] [2018-02-02 10:31:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:02,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:31:02,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:31:02,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:31:02,650 INFO L87 Difference]: Start difference. First operand 199 states and 236 transitions. Second operand 11 states. [2018-02-02 10:31:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:02,963 INFO L93 Difference]: Finished difference Result 221 states and 244 transitions. [2018-02-02 10:31:02,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:31:02,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-02-02 10:31:02,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:02,964 INFO L225 Difference]: With dead ends: 221 [2018-02-02 10:31:02,964 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 10:31:02,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:31:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 10:31:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 199. [2018-02-02 10:31:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 10:31:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 235 transitions. [2018-02-02 10:31:02,967 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 235 transitions. Word has length 37 [2018-02-02 10:31:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:02,967 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 235 transitions. [2018-02-02 10:31:02,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:31:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 235 transitions. [2018-02-02 10:31:02,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:31:02,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:02,968 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:02,968 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:02,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1299548604, now seen corresponding path program 1 times [2018-02-02 10:31:02,969 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:02,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:03,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:03,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:31:03,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:03,117 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 10:31:03,117 INFO L182 omatonBuilderFactory]: Interpolants [7088#true, 7089#false, 7090#(= (select |#valid| main_~head~0.base) 1), 7091#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 7092#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 7093#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 7094#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 7095#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 7096#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 7097#(= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 7098#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 7099#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7100#(= 1 (select |#valid| |main_#t~mem13.base|))] [2018-02-02 10:31:03,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:03,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:31:03,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:31:03,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:31:03,118 INFO L87 Difference]: Start difference. First operand 199 states and 235 transitions. Second operand 13 states. [2018-02-02 10:31:03,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:03,595 INFO L93 Difference]: Finished difference Result 254 states and 288 transitions. [2018-02-02 10:31:03,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:31:03,595 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-02-02 10:31:03,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:03,596 INFO L225 Difference]: With dead ends: 254 [2018-02-02 10:31:03,596 INFO L226 Difference]: Without dead ends: 254 [2018-02-02 10:31:03,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:31:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-02-02 10:31:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 199. [2018-02-02 10:31:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 10:31:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 234 transitions. [2018-02-02 10:31:03,599 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 234 transitions. Word has length 39 [2018-02-02 10:31:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:03,599 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 234 transitions. [2018-02-02 10:31:03,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:31:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 234 transitions. [2018-02-02 10:31:03,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:31:03,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:03,600 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:03,600 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:03,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1299548603, now seen corresponding path program 1 times [2018-02-02 10:31:03,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:03,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:03,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:03,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:31:03,911 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:03,911 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 10:31:03,911 INFO L182 omatonBuilderFactory]: Interpolants [7584#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (= (select |#length| main_~head~0.base) 8) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 7585#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= (select |#length| main_~head~0.base) 8) (= main_~x~0.base main_~head~0.base)), 7586#(and (= 0 main_~head~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#length| main_~head~0.base) 8) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 7587#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#length| main_~head~0.base) 8) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 7588#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#length| main_~head~0.base) 8) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 7589#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#length| main_~head~0.base) 8)), 7590#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 7591#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 7592#(and (= |main_#t~mem13.offset| 0) (<= 8 (select |#length| |main_#t~mem13.base|))), 7578#true, 7579#false, 7580#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 7581#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 7582#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 7583#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 10:31:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:03,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:31:03,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:31:03,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:31:03,912 INFO L87 Difference]: Start difference. First operand 199 states and 234 transitions. Second operand 15 states. [2018-02-02 10:31:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:04,716 INFO L93 Difference]: Finished difference Result 256 states and 289 transitions. [2018-02-02 10:31:04,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:31:04,717 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-02-02 10:31:04,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:04,717 INFO L225 Difference]: With dead ends: 256 [2018-02-02 10:31:04,717 INFO L226 Difference]: Without dead ends: 256 [2018-02-02 10:31:04,718 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:31:04,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-02 10:31:04,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 199. [2018-02-02 10:31:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 10:31:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2018-02-02 10:31:04,722 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 39 [2018-02-02 10:31:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:04,722 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2018-02-02 10:31:04,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:31:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2018-02-02 10:31:04,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:31:04,723 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:04,723 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:04,723 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:04,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1631760714, now seen corresponding path program 1 times [2018-02-02 10:31:04,723 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:04,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:04,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:04,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:31:04,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:04,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 10:31:04,891 INFO L182 omatonBuilderFactory]: Interpolants [8076#true, 8077#false, 8078#(= (select |#valid| main_~head~0.base) 1), 8079#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8080#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 8081#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 8082#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8083#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 8084#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 8085#(and (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8086#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0)), 8087#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8088#(and (<= 0 |main_#t~mem20.offset|) (<= (+ |main_#t~mem20.offset| 8) (select |#length| |main_#t~mem20.base|))), 8089#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 10:31:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:04,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:31:04,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:31:04,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:31:04,892 INFO L87 Difference]: Start difference. First operand 199 states and 233 transitions. Second operand 14 states. [2018-02-02 10:31:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:05,333 INFO L93 Difference]: Finished difference Result 256 states and 290 transitions. [2018-02-02 10:31:05,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:31:05,333 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-02-02 10:31:05,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:05,334 INFO L225 Difference]: With dead ends: 256 [2018-02-02 10:31:05,334 INFO L226 Difference]: Without dead ends: 256 [2018-02-02 10:31:05,334 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:31:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-02 10:31:05,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 221. [2018-02-02 10:31:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 10:31:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 268 transitions. [2018-02-02 10:31:05,336 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 268 transitions. Word has length 40 [2018-02-02 10:31:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:05,337 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 268 transitions. [2018-02-02 10:31:05,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:31:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2018-02-02 10:31:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:31:05,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:05,337 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:05,337 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:05,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1429185466, now seen corresponding path program 1 times [2018-02-02 10:31:05,338 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:05,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:31:05,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:05,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:31:05,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:05,393 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 10:31:05,393 INFO L182 omatonBuilderFactory]: Interpolants [8595#true, 8596#false, 8597#(= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 8598#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8599#(= 1 (select |#valid| |main_#t~mem15.base|))] [2018-02-02 10:31:05,393 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:31:05,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:31:05,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:31:05,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:31:05,394 INFO L87 Difference]: Start difference. First operand 221 states and 268 transitions. Second operand 5 states. [2018-02-02 10:31:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:05,476 INFO L93 Difference]: Finished difference Result 226 states and 269 transitions. [2018-02-02 10:31:05,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:31:05,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-02-02 10:31:05,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:05,477 INFO L225 Difference]: With dead ends: 226 [2018-02-02 10:31:05,477 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 10:31:05,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 10:31:05,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 10:31:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 220. [2018-02-02 10:31:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 10:31:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 263 transitions. [2018-02-02 10:31:05,480 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 263 transitions. Word has length 42 [2018-02-02 10:31:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:05,480 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 263 transitions. [2018-02-02 10:31:05,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:31:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 263 transitions. [2018-02-02 10:31:05,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:31:05,480 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:05,481 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:05,481 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1429185465, now seen corresponding path program 1 times [2018-02-02 10:31:05,481 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:05,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:05,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:05,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:31:05,694 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:05,694 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 10:31:05,694 INFO L182 omatonBuilderFactory]: Interpolants [9056#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 9057#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 9058#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 9059#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 9060#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 9061#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 9062#(and (<= 0 |main_#t~mem15.offset|) (<= |main_#t~mem15.offset| 0) (= (select |#length| |main_#t~mem15.base|) 8)), 9051#true, 9052#false, 9053#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 9054#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 9055#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:31:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:05,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:31:05,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:31:05,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:31:05,695 INFO L87 Difference]: Start difference. First operand 220 states and 263 transitions. Second operand 12 states. [2018-02-02 10:31:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:06,021 INFO L93 Difference]: Finished difference Result 240 states and 272 transitions. [2018-02-02 10:31:06,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:31:06,021 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-02 10:31:06,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:06,022 INFO L225 Difference]: With dead ends: 240 [2018-02-02 10:31:06,022 INFO L226 Difference]: Without dead ends: 240 [2018-02-02 10:31:06,022 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:31:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-02 10:31:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 220. [2018-02-02 10:31:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 10:31:06,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 262 transitions. [2018-02-02 10:31:06,024 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 262 transitions. Word has length 42 [2018-02-02 10:31:06,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:06,024 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 262 transitions. [2018-02-02 10:31:06,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:31:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 262 transitions. [2018-02-02 10:31:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:31:06,025 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:06,025 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:06,025 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:06,025 INFO L82 PathProgramCache]: Analyzing trace with hash -458979518, now seen corresponding path program 1 times [2018-02-02 10:31:06,026 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:06,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:06,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:06,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:31:06,195 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:06,195 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 10:31:06,195 INFO L182 omatonBuilderFactory]: Interpolants [9543#true, 9544#false, 9545#(= (select |#valid| main_~head~0.base) 1), 9546#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 9547#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 9548#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 9549#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9550#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 9551#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9552#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9553#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0)), 9554#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9555#(and (= 8 (select |#length| |main_#t~mem20.base|)) (<= 0 |main_#t~mem20.offset|)), 9556#(and (= (select |#length| main_~x~0.base) 8) (<= 0 main_~x~0.offset)), 9557#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset))] [2018-02-02 10:31:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:06,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:31:06,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:31:06,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:31:06,196 INFO L87 Difference]: Start difference. First operand 220 states and 262 transitions. Second operand 15 states. [2018-02-02 10:31:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:06,615 INFO L93 Difference]: Finished difference Result 252 states and 283 transitions. [2018-02-02 10:31:06,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:31:06,615 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-02-02 10:31:06,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:06,616 INFO L225 Difference]: With dead ends: 252 [2018-02-02 10:31:06,616 INFO L226 Difference]: Without dead ends: 252 [2018-02-02 10:31:06,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:31:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-02 10:31:06,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 221. [2018-02-02 10:31:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 10:31:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 263 transitions. [2018-02-02 10:31:06,618 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 263 transitions. Word has length 42 [2018-02-02 10:31:06,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:06,618 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 263 transitions. [2018-02-02 10:31:06,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:31:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 263 transitions. [2018-02-02 10:31:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:31:06,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:06,619 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:06,619 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:06,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1094809275, now seen corresponding path program 1 times [2018-02-02 10:31:06,620 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:06,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:31:06,982 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:06,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:31:06,982 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:06,982 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 10:31:06,982 INFO L182 omatonBuilderFactory]: Interpolants [10057#true, 10058#false, 10059#(= 0 |main_#t~malloc0.offset|), 10060#(= main_~head~0.offset 0), 10061#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 10063#(and (= main_~head~0.base |main_#t~mem11.base|) (= main_~head~0.offset |main_#t~mem11.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) |main_#t~mem11.offset|) |main_#t~mem11.base|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10064#(and (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10065#(and (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem12| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10066#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10067#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= main_~head~0.offset |main_#t~mem13.offset|)), 10068#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~x~0.offset 4)) |main_#t~mem14|) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 10069#(and (not |main_#t~short18|) (= main_~head~0.offset 0))] [2018-02-02 10:31:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:31:06,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:31:06,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:31:06,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:31:06,983 INFO L87 Difference]: Start difference. First operand 221 states and 263 transitions. Second operand 13 states. [2018-02-02 10:31:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:07,238 INFO L93 Difference]: Finished difference Result 230 states and 262 transitions. [2018-02-02 10:31:07,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:31:07,238 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-02-02 10:31:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:07,239 INFO L225 Difference]: With dead ends: 230 [2018-02-02 10:31:07,239 INFO L226 Difference]: Without dead ends: 230 [2018-02-02 10:31:07,239 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:31:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-02 10:31:07,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 221. [2018-02-02 10:31:07,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 10:31:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 262 transitions. [2018-02-02 10:31:07,241 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 262 transitions. Word has length 44 [2018-02-02 10:31:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:07,241 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 262 transitions. [2018-02-02 10:31:07,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:31:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 262 transitions. [2018-02-02 10:31:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:31:07,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:07,242 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:07,242 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:07,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1302319747, now seen corresponding path program 1 times [2018-02-02 10:31:07,242 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:07,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:07,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:07,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:31:07,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:07,487 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 10:31:07,487 INFO L182 omatonBuilderFactory]: Interpolants [10543#true, 10544#false, 10545#(= 0 |main_#t~malloc0.offset|), 10546#(= main_~head~0.offset 0), 10547#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 10548#(and (= main_~head~0.offset main_~x~0.offset) (= main_~state~0 1) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 10549#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~state~0 1) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 10550#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~state~0 1) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 10551#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|) (= main_~state~0 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 10552#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~state~0 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 10553#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10554#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 1) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10555#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~x~0.offset 4)) 1) (= main_~head~0.offset 0)), 10556#(and (= |main_#t~mem12| 1) (= main_~head~0.offset 0))] [2018-02-02 10:31:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:07,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:31:07,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:31:07,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:31:07,488 INFO L87 Difference]: Start difference. First operand 221 states and 262 transitions. Second operand 14 states. [2018-02-02 10:31:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:07,907 INFO L93 Difference]: Finished difference Result 287 states and 331 transitions. [2018-02-02 10:31:07,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:31:07,907 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-02 10:31:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:07,908 INFO L225 Difference]: With dead ends: 287 [2018-02-02 10:31:07,908 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 10:31:07,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:31:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 10:31:07,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 230. [2018-02-02 10:31:07,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 10:31:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 271 transitions. [2018-02-02 10:31:07,910 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 271 transitions. Word has length 44 [2018-02-02 10:31:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:07,910 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 271 transitions. [2018-02-02 10:31:07,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:31:07,910 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 271 transitions. [2018-02-02 10:31:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:31:07,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:07,911 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:07,911 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:07,911 INFO L82 PathProgramCache]: Analyzing trace with hash 683260827, now seen corresponding path program 1 times [2018-02-02 10:31:07,911 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:07,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:08,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:08,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:08,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:31:08,138 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:08,138 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 10:31:08,139 INFO L182 omatonBuilderFactory]: Interpolants [11104#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 11105#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 11106#(and (= 0 main_~head~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 11107#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 11108#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 11109#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11110#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)), 11111#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 11112#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 11113#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 11114#(and (<= 0 |main_#t~mem15.offset|) (<= (+ |main_#t~mem15.offset| 8) (select |#length| |main_#t~mem15.base|))), 11098#true, 11099#false, 11100#(= 0 |main_#t~malloc0.offset|), 11101#(= 0 main_~head~0.offset), 11102#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 11103#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 10:31:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:08,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:31:08,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:31:08,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:31:08,139 INFO L87 Difference]: Start difference. First operand 230 states and 271 transitions. Second operand 17 states. [2018-02-02 10:31:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:08,649 INFO L93 Difference]: Finished difference Result 258 states and 288 transitions. [2018-02-02 10:31:08,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:31:08,649 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-02-02 10:31:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:08,650 INFO L225 Difference]: With dead ends: 258 [2018-02-02 10:31:08,650 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 10:31:08,650 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:31:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 10:31:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 230. [2018-02-02 10:31:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 10:31:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 270 transitions. [2018-02-02 10:31:08,654 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 270 transitions. Word has length 44 [2018-02-02 10:31:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:08,654 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 270 transitions. [2018-02-02 10:31:08,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:31:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 270 transitions. [2018-02-02 10:31:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:31:08,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:08,655 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:08,655 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:08,655 INFO L82 PathProgramCache]: Analyzing trace with hash 385787049, now seen corresponding path program 1 times [2018-02-02 10:31:08,656 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:08,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:08,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:08,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:31:08,958 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:08,958 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 10:31:08,958 INFO L182 omatonBuilderFactory]: Interpolants [11648#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11649#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11650#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~x~0.offset 4)) 0))), 11651#(and (= main_~head~0.offset 0) (not (= |main_#t~mem12| 0))), 11637#true, 11638#false, 11639#(= 0 |main_#t~malloc0.offset|), 11640#(= main_~head~0.offset 0), 11641#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 11642#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 11643#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 11644#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 11645#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 11646#(and (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 11647#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~state~0 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:31:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:08,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:31:08,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:31:08,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:31:08,959 INFO L87 Difference]: Start difference. First operand 230 states and 270 transitions. Second operand 15 states. [2018-02-02 10:31:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:09,435 INFO L93 Difference]: Finished difference Result 290 states and 332 transitions. [2018-02-02 10:31:09,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:31:09,436 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 10:31:09,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:09,436 INFO L225 Difference]: With dead ends: 290 [2018-02-02 10:31:09,436 INFO L226 Difference]: Without dead ends: 290 [2018-02-02 10:31:09,437 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:31:09,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-02-02 10:31:09,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 221. [2018-02-02 10:31:09,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 10:31:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 260 transitions. [2018-02-02 10:31:09,440 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 260 transitions. Word has length 45 [2018-02-02 10:31:09,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:09,440 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 260 transitions. [2018-02-02 10:31:09,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:31:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 260 transitions. [2018-02-02 10:31:09,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:31:09,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:09,440 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:09,441 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:09,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1615923171, now seen corresponding path program 1 times [2018-02-02 10:31:09,441 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:09,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:09,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:09,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:31:09,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:09,454 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 10:31:09,454 INFO L182 omatonBuilderFactory]: Interpolants [12189#true, 12190#false, 12191#(= main_~state~0 2)] [2018-02-02 10:31:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:09,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:31:09,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:31:09,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:31:09,455 INFO L87 Difference]: Start difference. First operand 221 states and 260 transitions. Second operand 3 states. [2018-02-02 10:31:09,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:09,461 INFO L93 Difference]: Finished difference Result 331 states and 388 transitions. [2018-02-02 10:31:09,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:31:09,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-02-02 10:31:09,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:09,462 INFO L225 Difference]: With dead ends: 331 [2018-02-02 10:31:09,462 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 10:31:09,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:31:09,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 10:31:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 237. [2018-02-02 10:31:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 10:31:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 278 transitions. [2018-02-02 10:31:09,465 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 278 transitions. Word has length 45 [2018-02-02 10:31:09,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:09,465 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 278 transitions. [2018-02-02 10:31:09,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:31:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 278 transitions. [2018-02-02 10:31:09,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:31:09,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:09,465 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:09,465 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:09,466 INFO L82 PathProgramCache]: Analyzing trace with hash -156854704, now seen corresponding path program 1 times [2018-02-02 10:31:09,466 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:09,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:09,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:09,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:31:09,499 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:09,499 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 10:31:09,500 INFO L182 omatonBuilderFactory]: Interpolants [12760#true, 12761#false, 12762#(= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 12763#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 12764#(= 1 (select |#valid| |main_#t~mem19.base|)), 12765#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:31:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:09,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:31:09,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:31:09,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:31:09,500 INFO L87 Difference]: Start difference. First operand 237 states and 278 transitions. Second operand 6 states. [2018-02-02 10:31:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:09,579 INFO L93 Difference]: Finished difference Result 240 states and 279 transitions. [2018-02-02 10:31:09,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:31:09,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-02-02 10:31:09,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:09,580 INFO L225 Difference]: With dead ends: 240 [2018-02-02 10:31:09,580 INFO L226 Difference]: Without dead ends: 240 [2018-02-02 10:31:09,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:31:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-02 10:31:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2018-02-02 10:31:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-02 10:31:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 279 transitions. [2018-02-02 10:31:09,583 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 279 transitions. Word has length 47 [2018-02-02 10:31:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:09,584 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 279 transitions. [2018-02-02 10:31:09,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:31:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 279 transitions. [2018-02-02 10:31:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:31:09,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:09,584 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:09,585 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:09,585 INFO L82 PathProgramCache]: Analyzing trace with hash -156854703, now seen corresponding path program 1 times [2018-02-02 10:31:09,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:09,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:09,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:09,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:31:09,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:09,813 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 10:31:09,814 INFO L182 omatonBuilderFactory]: Interpolants [13253#true, 13254#false, 13255#(= 0 |main_#t~malloc0.offset|), 13256#(= 0 main_~head~0.offset), 13257#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 13258#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 13259#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 13260#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 13261#(and (= 0 main_~head~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 13262#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 13263#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 13264#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13265#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)), 13266#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 13267#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 13268#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 13269#(and (<= 0 |main_#t~mem19.offset|) (<= (+ |main_#t~mem19.offset| 8) (select |#length| |main_#t~mem19.base|))), 13270#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 10:31:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:09,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:31:09,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:31:09,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:31:09,814 INFO L87 Difference]: Start difference. First operand 239 states and 279 transitions. Second operand 18 states. [2018-02-02 10:31:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:10,593 INFO L93 Difference]: Finished difference Result 284 states and 317 transitions. [2018-02-02 10:31:10,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:31:10,593 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-02-02 10:31:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:10,594 INFO L225 Difference]: With dead ends: 284 [2018-02-02 10:31:10,594 INFO L226 Difference]: Without dead ends: 284 [2018-02-02 10:31:10,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:31:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-02-02 10:31:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 255. [2018-02-02 10:31:10,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-02 10:31:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 300 transitions. [2018-02-02 10:31:10,596 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 300 transitions. Word has length 47 [2018-02-02 10:31:10,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:10,596 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 300 transitions. [2018-02-02 10:31:10,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:31:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 300 transitions. [2018-02-02 10:31:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:31:10,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:10,597 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:10,597 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:10,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1047954627, now seen corresponding path program 1 times [2018-02-02 10:31:10,597 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:10,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:31:10,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:10,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:31:10,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:10,932 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 10:31:10,932 INFO L182 omatonBuilderFactory]: Interpolants [13856#(and (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem12| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13857#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13858#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem19.offset|) (not (= 0 (select (select |#memory_int| |main_#t~mem19.base|) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13859#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 13860#(and (= main_~head~0.offset 0) (not (= 0 |main_#t~mem12|))), 13848#true, 13849#false, 13850#(= 0 |main_#t~malloc0.offset|), 13851#(= main_~head~0.offset 0), 13852#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13853#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 13854#(and (= main_~head~0.base |main_#t~mem11.base|) (= main_~head~0.offset |main_#t~mem11.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) |main_#t~mem11.offset|) |main_#t~mem11.base|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13855#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:31:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:31:10,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:31:10,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:31:10,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:31:10,933 INFO L87 Difference]: Start difference. First operand 255 states and 300 transitions. Second operand 13 states. [2018-02-02 10:31:11,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:11,169 INFO L93 Difference]: Finished difference Result 264 states and 300 transitions. [2018-02-02 10:31:11,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:31:11,170 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 10:31:11,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:11,170 INFO L225 Difference]: With dead ends: 264 [2018-02-02 10:31:11,170 INFO L226 Difference]: Without dead ends: 264 [2018-02-02 10:31:11,171 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:31:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-02 10:31:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 255. [2018-02-02 10:31:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-02 10:31:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 299 transitions. [2018-02-02 10:31:11,172 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 299 transitions. Word has length 48 [2018-02-02 10:31:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:11,173 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 299 transitions. [2018-02-02 10:31:11,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:31:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 299 transitions. [2018-02-02 10:31:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:31:11,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:11,173 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:11,173 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:11,173 INFO L82 PathProgramCache]: Analyzing trace with hash -731024595, now seen corresponding path program 1 times [2018-02-02 10:31:11,174 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:11,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:11,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:11,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:31:11,325 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:11,325 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 10:31:11,325 INFO L182 omatonBuilderFactory]: Interpolants [14400#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 14401#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 14402#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14403#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 14404#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 14405#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 14406#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 14407#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 14408#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 14409#(and (<= 0 |main_#t~mem19.offset|) (= 8 (select |#length| |main_#t~mem19.base|)) (<= |main_#t~mem19.offset| 0)), 14410#(and (= (select |#length| main_~x~0.base) 8) (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset)), 14398#true, 14399#false] [2018-02-02 10:31:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:11,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:31:11,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:31:11,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:31:11,325 INFO L87 Difference]: Start difference. First operand 255 states and 299 transitions. Second operand 13 states. [2018-02-02 10:31:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:11,723 INFO L93 Difference]: Finished difference Result 292 states and 329 transitions. [2018-02-02 10:31:11,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:31:11,723 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-02-02 10:31:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:11,724 INFO L225 Difference]: With dead ends: 292 [2018-02-02 10:31:11,724 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 10:31:11,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:31:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 10:31:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 271. [2018-02-02 10:31:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-02 10:31:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 320 transitions. [2018-02-02 10:31:11,727 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 320 transitions. Word has length 49 [2018-02-02 10:31:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:11,727 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 320 transitions. [2018-02-02 10:31:11,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:31:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 320 transitions. [2018-02-02 10:31:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:31:11,728 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:11,728 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:11,728 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:11,728 INFO L82 PathProgramCache]: Analyzing trace with hash 403414204, now seen corresponding path program 2 times [2018-02-02 10:31:11,729 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:11,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:11,879 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:11,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:11,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:31:11,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:11,879 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 10:31:11,879 INFO L182 omatonBuilderFactory]: Interpolants [15008#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|))), 15009#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 15010#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 15011#(= 1 (select |#valid| |main_#t~mem11.base|)), 15012#(= 1 (select |#valid| main_~x~0.base)), 14998#true, 14999#false, 15000#(= (select |#valid| main_~head~0.base) 1), 15001#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 15002#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 15003#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 15004#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1)), 15005#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 15006#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 15007#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 10:31:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:11,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:31:11,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:31:11,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:31:11,880 INFO L87 Difference]: Start difference. First operand 271 states and 320 transitions. Second operand 15 states. [2018-02-02 10:31:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:12,241 INFO L93 Difference]: Finished difference Result 384 states and 446 transitions. [2018-02-02 10:31:12,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:31:12,241 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-02-02 10:31:12,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:12,242 INFO L225 Difference]: With dead ends: 384 [2018-02-02 10:31:12,242 INFO L226 Difference]: Without dead ends: 384 [2018-02-02 10:31:12,242 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:31:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-02-02 10:31:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 315. [2018-02-02 10:31:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 10:31:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 369 transitions. [2018-02-02 10:31:12,244 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 369 transitions. Word has length 49 [2018-02-02 10:31:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:12,245 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 369 transitions. [2018-02-02 10:31:12,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:31:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 369 transitions. [2018-02-02 10:31:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:31:12,245 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:12,245 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:12,245 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:12,246 INFO L82 PathProgramCache]: Analyzing trace with hash 403414205, now seen corresponding path program 2 times [2018-02-02 10:31:12,246 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:12,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:12,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:12,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:31:12,538 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:12,538 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 10:31:12,538 INFO L182 omatonBuilderFactory]: Interpolants [15744#true, 15745#false, 15746#(= (select |#valid| main_~head~0.base) 1), 15747#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 15748#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 15749#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 15750#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 15751#(and (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 15752#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 15753#(and (= (select |#length| main_~x~0.base) 8) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 15754#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15755#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15756#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 15757#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15758#(and (<= 8 (select |#length| |main_#t~mem11.base|)) (= 0 |main_#t~mem11.offset|)), 15759#(and (<= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset))] [2018-02-02 10:31:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:12,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:31:12,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:31:12,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:31:12,539 INFO L87 Difference]: Start difference. First operand 315 states and 369 transitions. Second operand 16 states. [2018-02-02 10:31:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:13,055 INFO L93 Difference]: Finished difference Result 390 states and 448 transitions. [2018-02-02 10:31:13,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:31:13,055 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-02-02 10:31:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:13,056 INFO L225 Difference]: With dead ends: 390 [2018-02-02 10:31:13,056 INFO L226 Difference]: Without dead ends: 390 [2018-02-02 10:31:13,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:31:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-02-02 10:31:13,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 330. [2018-02-02 10:31:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 10:31:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 389 transitions. [2018-02-02 10:31:13,058 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 389 transitions. Word has length 49 [2018-02-02 10:31:13,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:13,059 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 389 transitions. [2018-02-02 10:31:13,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:31:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 389 transitions. [2018-02-02 10:31:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:31:13,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:13,059 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:13,059 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:13,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2046302647, now seen corresponding path program 1 times [2018-02-02 10:31:13,060 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:13,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:13,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:13,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:31:13,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:13,259 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 10:31:13,259 INFO L182 omatonBuilderFactory]: Interpolants [16512#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 16513#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 16514#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 16515#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 16516#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 16517#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 16518#(= 1 (select |#valid| |main_#t~mem13.base|)), 16504#true, 16505#false, 16506#(= (select |#valid| main_~head~0.base) 1), 16507#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 16508#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 16509#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 16510#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 16511#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:31:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:13,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:31:13,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:31:13,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:31:13,260 INFO L87 Difference]: Start difference. First operand 330 states and 389 transitions. Second operand 15 states. [2018-02-02 10:31:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:13,882 INFO L93 Difference]: Finished difference Result 347 states and 395 transitions. [2018-02-02 10:31:13,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:31:13,882 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-02-02 10:31:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:13,883 INFO L225 Difference]: With dead ends: 347 [2018-02-02 10:31:13,884 INFO L226 Difference]: Without dead ends: 347 [2018-02-02 10:31:13,884 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:31:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-02 10:31:13,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 330. [2018-02-02 10:31:13,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 10:31:13,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 388 transitions. [2018-02-02 10:31:13,887 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 388 transitions. Word has length 51 [2018-02-02 10:31:13,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:13,888 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 388 transitions. [2018-02-02 10:31:13,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:31:13,888 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 388 transitions. [2018-02-02 10:31:13,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:31:13,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:13,889 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:13,889 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:13,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2046302648, now seen corresponding path program 1 times [2018-02-02 10:31:13,889 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:13,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:14,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:14,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:31:14,139 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:14,139 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 10:31:14,139 INFO L182 omatonBuilderFactory]: Interpolants [17226#true, 17227#false, 17228#(= (select |#valid| main_~head~0.base) 1), 17229#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 17230#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 17231#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 17232#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 17233#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 17234#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 17235#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 17236#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 17237#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 17238#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 17239#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 17240#(and (= (select |#length| |main_#t~mem13.base|) 8) (= |main_#t~mem13.offset| 0))] [2018-02-02 10:31:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:14,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:31:14,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:31:14,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:31:14,140 INFO L87 Difference]: Start difference. First operand 330 states and 388 transitions. Second operand 15 states. [2018-02-02 10:31:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:14,683 INFO L93 Difference]: Finished difference Result 349 states and 396 transitions. [2018-02-02 10:31:14,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:31:14,683 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-02-02 10:31:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:14,684 INFO L225 Difference]: With dead ends: 349 [2018-02-02 10:31:14,684 INFO L226 Difference]: Without dead ends: 349 [2018-02-02 10:31:14,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:31:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-02 10:31:14,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 330. [2018-02-02 10:31:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 10:31:14,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 387 transitions. [2018-02-02 10:31:14,686 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 387 transitions. Word has length 51 [2018-02-02 10:31:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:14,686 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 387 transitions. [2018-02-02 10:31:14,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:31:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 387 transitions. [2018-02-02 10:31:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:31:14,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:14,687 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:14,687 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:14,687 INFO L82 PathProgramCache]: Analyzing trace with hash 755837075, now seen corresponding path program 1 times [2018-02-02 10:31:14,688 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:14,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:14,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:14,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:31:14,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:14,824 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 10:31:14,824 INFO L182 omatonBuilderFactory]: Interpolants [17952#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 17953#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 17954#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 17955#(= 1 (select |#valid| |main_#t~mem13.base|)), 17942#true, 17943#false, 17944#(= 0 |main_#t~malloc0.offset|), 17945#(= main_~head~0.offset 0), 17946#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 17947#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 17948#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 17949#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))))), 17950#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 17951#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))))] [2018-02-02 10:31:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:14,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:31:14,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:31:14,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:31:14,825 INFO L87 Difference]: Start difference. First operand 330 states and 387 transitions. Second operand 14 states. [2018-02-02 10:31:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:15,242 INFO L93 Difference]: Finished difference Result 343 states and 389 transitions. [2018-02-02 10:31:15,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:31:15,242 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2018-02-02 10:31:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:15,243 INFO L225 Difference]: With dead ends: 343 [2018-02-02 10:31:15,243 INFO L226 Difference]: Without dead ends: 343 [2018-02-02 10:31:15,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:31:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-02 10:31:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 330. [2018-02-02 10:31:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 10:31:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 386 transitions. [2018-02-02 10:31:15,246 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 386 transitions. Word has length 53 [2018-02-02 10:31:15,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:15,246 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 386 transitions. [2018-02-02 10:31:15,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:31:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 386 transitions. [2018-02-02 10:31:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:31:15,246 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:15,246 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:15,247 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:15,247 INFO L82 PathProgramCache]: Analyzing trace with hash 755837076, now seen corresponding path program 1 times [2018-02-02 10:31:15,247 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:15,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:15,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:15,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:31:15,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:15,417 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 10:31:15,417 INFO L182 omatonBuilderFactory]: Interpolants [18659#true, 18660#false, 18661#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 18662#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 18663#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18664#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 18665#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))))), 18666#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 18667#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))))), 18668#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 18669#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 18670#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 18671#(and (= (select |#length| |main_#t~mem13.base|) 8) (= |main_#t~mem13.offset| 0))] [2018-02-02 10:31:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:15,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:31:15,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:31:15,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:31:15,418 INFO L87 Difference]: Start difference. First operand 330 states and 386 transitions. Second operand 13 states. [2018-02-02 10:31:15,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:15,855 INFO L93 Difference]: Finished difference Result 349 states and 394 transitions. [2018-02-02 10:31:15,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:31:15,855 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-02-02 10:31:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:15,856 INFO L225 Difference]: With dead ends: 349 [2018-02-02 10:31:15,856 INFO L226 Difference]: Without dead ends: 349 [2018-02-02 10:31:15,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:31:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-02 10:31:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 330. [2018-02-02 10:31:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 10:31:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 385 transitions. [2018-02-02 10:31:15,858 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 385 transitions. Word has length 53 [2018-02-02 10:31:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:15,859 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 385 transitions. [2018-02-02 10:31:15,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:31:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 385 transitions. [2018-02-02 10:31:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:31:15,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:15,859 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:15,859 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:15,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1151595997, now seen corresponding path program 2 times [2018-02-02 10:31:15,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:15,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:16,017 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:16,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:16,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:31:16,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:16,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 10:31:16,018 INFO L182 omatonBuilderFactory]: Interpolants [19373#true, 19374#false, 19375#(= (select |#valid| main_~head~0.base) 1), 19376#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 19377#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 19378#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 19379#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 19380#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 19381#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 19382#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 19383#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 19384#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 19385#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)))), 19386#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 19387#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 19388#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 19389#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 19390#(= 1 (select |#valid| |main_#t~mem13.base|))] [2018-02-02 10:31:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:16,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:31:16,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:31:16,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:31:16,019 INFO L87 Difference]: Start difference. First operand 330 states and 385 transitions. Second operand 18 states. [2018-02-02 10:31:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:16,558 INFO L93 Difference]: Finished difference Result 401 states and 461 transitions. [2018-02-02 10:31:16,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:31:16,559 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-02-02 10:31:16,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:16,559 INFO L225 Difference]: With dead ends: 401 [2018-02-02 10:31:16,559 INFO L226 Difference]: Without dead ends: 401 [2018-02-02 10:31:16,560 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=1072, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:31:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-02 10:31:16,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 330. [2018-02-02 10:31:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 10:31:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 384 transitions. [2018-02-02 10:31:16,563 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 384 transitions. Word has length 53 [2018-02-02 10:31:16,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:16,563 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 384 transitions. [2018-02-02 10:31:16,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:31:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 384 transitions. [2018-02-02 10:31:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:31:16,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:16,564 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:16,564 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:16,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1151595996, now seen corresponding path program 2 times [2018-02-02 10:31:16,565 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:16,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:16,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:16,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:31:16,810 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:16,810 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 10:31:16,810 INFO L182 omatonBuilderFactory]: Interpolants [20160#(= (select |#valid| main_~head~0.base) 1), 20161#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 20162#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 20163#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 20164#(and (= |main_#t~mem6.offset| 0) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 20165#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 20166#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 20167#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 20168#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 20169#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20170#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 20171#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20172#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) 0))), 20173#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0)) (= 0 main_~x~0.offset)), 20174#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 20175#(and (= (select |#length| |main_#t~mem13.base|) 8) (= |main_#t~mem13.offset| 0)), 20158#true, 20159#false] [2018-02-02 10:31:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:16,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:31:16,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:31:16,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:31:16,810 INFO L87 Difference]: Start difference. First operand 330 states and 384 transitions. Second operand 18 states. [2018-02-02 10:31:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:17,459 INFO L93 Difference]: Finished difference Result 388 states and 442 transitions. [2018-02-02 10:31:17,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:31:17,459 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-02-02 10:31:17,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:17,460 INFO L225 Difference]: With dead ends: 388 [2018-02-02 10:31:17,460 INFO L226 Difference]: Without dead ends: 388 [2018-02-02 10:31:17,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:31:17,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-02 10:31:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 330. [2018-02-02 10:31:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 10:31:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 383 transitions. [2018-02-02 10:31:17,462 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 383 transitions. Word has length 53 [2018-02-02 10:31:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:17,463 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 383 transitions. [2018-02-02 10:31:17,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:31:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 383 transitions. [2018-02-02 10:31:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:31:17,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:17,463 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:17,463 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:17,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1340197193, now seen corresponding path program 2 times [2018-02-02 10:31:17,464 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:17,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:17,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:17,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:31:17,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:17,732 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 10:31:17,732 INFO L182 omatonBuilderFactory]: Interpolants [20928#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 20929#(and (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20930#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0)), 20931#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20932#(and (<= 0 |main_#t~mem20.offset|) (<= (+ |main_#t~mem20.offset| 8) (select |#length| |main_#t~mem20.base|))), 20933#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 20916#true, 20917#false, 20918#(= (select |#valid| main_~head~0.base) 1), 20919#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 20920#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 20921#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 20922#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20923#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 20924#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 20925#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20926#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20927#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)))] [2018-02-02 10:31:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:17,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:31:17,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:31:17,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:31:17,733 INFO L87 Difference]: Start difference. First operand 330 states and 383 transitions. Second operand 18 states. [2018-02-02 10:31:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:18,342 INFO L93 Difference]: Finished difference Result 366 states and 411 transitions. [2018-02-02 10:31:18,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:31:18,343 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-02-02 10:31:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:18,344 INFO L225 Difference]: With dead ends: 366 [2018-02-02 10:31:18,344 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 10:31:18,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=878, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:31:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 10:31:18,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 335. [2018-02-02 10:31:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-02 10:31:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 391 transitions. [2018-02-02 10:31:18,347 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 391 transitions. Word has length 54 [2018-02-02 10:31:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:18,347 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 391 transitions. [2018-02-02 10:31:18,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:31:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 391 transitions. [2018-02-02 10:31:18,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:31:18,348 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:18,349 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:18,349 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:18,349 INFO L82 PathProgramCache]: Analyzing trace with hash 209542896, now seen corresponding path program 1 times [2018-02-02 10:31:18,349 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:18,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:18,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:18,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:31:18,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:18,641 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 10:31:18,642 INFO L182 omatonBuilderFactory]: Interpolants [21665#true, 21666#false, 21667#(= 0 |main_#t~malloc0.offset|), 21668#(= main_~head~0.offset 0), 21669#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 21670#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 21671#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 21672#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 21673#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21674#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 21675#(and (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21676#(and (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.base|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21677#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 21678#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem12| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~head~0.offset 0)), 21679#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 21680#(and (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 21681#(not (= 0 (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 4)))), 21682#(or (<= 1 main_~x~0.offset) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (<= (+ main_~x~0.offset 1) 0)), 21683#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0) (not (= 0 |main_#t~mem21|))), 21684#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0))] [2018-02-02 10:31:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:18,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:31:18,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:31:18,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:31:18,642 INFO L87 Difference]: Start difference. First operand 335 states and 391 transitions. Second operand 20 states. [2018-02-02 10:31:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:19,160 INFO L93 Difference]: Finished difference Result 347 states and 394 transitions. [2018-02-02 10:31:19,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:31:19,194 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-02-02 10:31:19,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:19,194 INFO L225 Difference]: With dead ends: 347 [2018-02-02 10:31:19,194 INFO L226 Difference]: Without dead ends: 346 [2018-02-02 10:31:19,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=1343, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:31:19,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-02-02 10:31:19,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 334. [2018-02-02 10:31:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-02 10:31:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 389 transitions. [2018-02-02 10:31:19,197 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 389 transitions. Word has length 56 [2018-02-02 10:31:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:19,197 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 389 transitions. [2018-02-02 10:31:19,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:31:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 389 transitions. [2018-02-02 10:31:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:31:19,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:19,197 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:19,197 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash 209592548, now seen corresponding path program 1 times [2018-02-02 10:31:19,198 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:19,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:19,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:19,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:31:19,299 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:19,299 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 10:31:19,299 INFO L182 omatonBuilderFactory]: Interpolants [22416#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 22417#(= 0 |main_#t~mem20.offset|), 22418#(= 0 main_~x~0.offset), 22419#(= main_~head~0.offset 0), 22408#true, 22409#false, 22410#(= (select |#valid| main_~head~0.base) 1), 22411#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 22412#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 22413#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 22414#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 22415#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)))] [2018-02-02 10:31:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:19,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:31:19,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:31:19,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:31:19,300 INFO L87 Difference]: Start difference. First operand 334 states and 389 transitions. Second operand 12 states. [2018-02-02 10:31:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:19,559 INFO L93 Difference]: Finished difference Result 350 states and 396 transitions. [2018-02-02 10:31:19,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:31:19,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-02-02 10:31:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:19,560 INFO L225 Difference]: With dead ends: 350 [2018-02-02 10:31:19,561 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 10:31:19,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:31:19,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 10:31:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 282. [2018-02-02 10:31:19,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-02 10:31:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 323 transitions. [2018-02-02 10:31:19,564 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 323 transitions. Word has length 56 [2018-02-02 10:31:19,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:19,565 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 323 transitions. [2018-02-02 10:31:19,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:31:19,565 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 323 transitions. [2018-02-02 10:31:19,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:31:19,565 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:19,566 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:19,566 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:19,566 INFO L82 PathProgramCache]: Analyzing trace with hash -409516024, now seen corresponding path program 1 times [2018-02-02 10:31:19,566 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:19,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:19,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:19,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:31:19,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:19,861 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 10:31:19,861 INFO L182 omatonBuilderFactory]: Interpolants [23072#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 23073#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 23074#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23075#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 23076#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 23077#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 23078#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 23079#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 23080#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)), 23081#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 23082#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 23083#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 23084#(and (<= 0 |main_#t~mem15.offset|) (<= (+ |main_#t~mem15.offset| 8) (select |#length| |main_#t~mem15.base|))), 23068#true, 23069#false, 23070#(= (select |#valid| main_~head~0.base) 1), 23071#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 10:31:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:19,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:31:19,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:31:19,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:31:19,862 INFO L87 Difference]: Start difference. First operand 282 states and 323 transitions. Second operand 17 states. [2018-02-02 10:31:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:20,432 INFO L93 Difference]: Finished difference Result 348 states and 394 transitions. [2018-02-02 10:31:20,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:31:20,432 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-02 10:31:20,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:20,433 INFO L225 Difference]: With dead ends: 348 [2018-02-02 10:31:20,433 INFO L226 Difference]: Without dead ends: 348 [2018-02-02 10:31:20,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:31:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-02-02 10:31:20,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 309. [2018-02-02 10:31:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-02-02 10:31:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 353 transitions. [2018-02-02 10:31:20,436 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 353 transitions. Word has length 56 [2018-02-02 10:31:20,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:20,436 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 353 transitions. [2018-02-02 10:31:20,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:31:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 353 transitions. [2018-02-02 10:31:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:31:20,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:20,436 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:20,436 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:20,436 INFO L82 PathProgramCache]: Analyzing trace with hash 560689923, now seen corresponding path program 2 times [2018-02-02 10:31:20,437 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:20,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:20,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:20,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:31:20,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:20,801 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 10:31:20,801 INFO L182 omatonBuilderFactory]: Interpolants [23776#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23777#(and (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 23778#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 23779#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 23780#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23781#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23782#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 23783#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23784#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23785#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0)), 23786#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23787#(and (= 8 (select |#length| |main_#t~mem20.base|)) (<= 0 |main_#t~mem20.offset|)), 23788#(and (= (select |#length| main_~x~0.base) 8) (<= 0 main_~x~0.offset)), 23789#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset)), 23770#true, 23771#false, 23772#(= (select |#valid| main_~head~0.base) 1), 23773#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 23774#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 23775#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 10:31:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:20,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:31:20,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:31:20,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:31:20,802 INFO L87 Difference]: Start difference. First operand 309 states and 353 transitions. Second operand 20 states. [2018-02-02 10:31:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:21,644 INFO L93 Difference]: Finished difference Result 401 states and 458 transitions. [2018-02-02 10:31:21,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:31:21,644 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-02-02 10:31:21,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:21,645 INFO L225 Difference]: With dead ends: 401 [2018-02-02 10:31:21,645 INFO L226 Difference]: Without dead ends: 401 [2018-02-02 10:31:21,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:31:21,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-02 10:31:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 340. [2018-02-02 10:31:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-02-02 10:31:21,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 397 transitions. [2018-02-02 10:31:21,648 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 397 transitions. Word has length 56 [2018-02-02 10:31:21,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:21,649 INFO L432 AbstractCegarLoop]: Abstraction has 340 states and 397 transitions. [2018-02-02 10:31:21,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:31:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 397 transitions. [2018-02-02 10:31:21,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:31:21,649 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:21,650 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:21,650 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:21,650 INFO L82 PathProgramCache]: Analyzing trace with hash 887431852, now seen corresponding path program 1 times [2018-02-02 10:31:21,650 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:21,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:21,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:21,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:31:21,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:21,862 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 10:31:21,862 INFO L182 omatonBuilderFactory]: Interpolants [24576#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 24577#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))))), 24578#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 24579#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 24580#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 24581#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 24582#(and (<= 0 |main_#t~mem15.offset|) (<= |main_#t~mem15.offset| 0) (= (select |#length| |main_#t~mem15.base|) 8)), 24569#true, 24570#false, 24571#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 24572#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 24573#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24574#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 24575#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))))] [2018-02-02 10:31:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:21,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:31:21,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:31:21,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:31:21,863 INFO L87 Difference]: Start difference. First operand 340 states and 397 transitions. Second operand 14 states. [2018-02-02 10:31:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:22,342 INFO L93 Difference]: Finished difference Result 382 states and 439 transitions. [2018-02-02 10:31:22,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:31:22,343 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-02-02 10:31:22,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:22,343 INFO L225 Difference]: With dead ends: 382 [2018-02-02 10:31:22,344 INFO L226 Difference]: Without dead ends: 382 [2018-02-02 10:31:22,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:31:22,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-02 10:31:22,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 313. [2018-02-02 10:31:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-02-02 10:31:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 366 transitions. [2018-02-02 10:31:22,346 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 366 transitions. Word has length 58 [2018-02-02 10:31:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:22,346 INFO L432 AbstractCegarLoop]: Abstraction has 313 states and 366 transitions. [2018-02-02 10:31:22,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:31:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 366 transitions. [2018-02-02 10:31:22,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:31:22,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:22,346 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:22,347 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:22,347 INFO L82 PathProgramCache]: Analyzing trace with hash -445019962, now seen corresponding path program 1 times [2018-02-02 10:31:22,347 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:22,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:22,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:22,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:31:22,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:22,641 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 10:31:22,641 INFO L182 omatonBuilderFactory]: Interpolants [25312#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25313#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25314#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25315#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25316#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25317#(and (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 25318#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0) |main_#t~mem20.base|)) (or (not (= 0 |main_#t~mem20.base|)) (not (= 0 |main_#t~mem20.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)))), 25319#(and (or (not (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (not (= 0 main_~x~0.offset)) (not (= 0 main_~x~0.base)))), 25320#(and (or (not (= 0 main_~head~0.offset)) (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 25321#(and (or (not (= 0 main_~head~0.offset)) (= 1 (select (store |#valid| main_~head~0.base 0) |main_#t~mem22.base|))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 25322#(and (or (not (= 0 main_~head~0.offset)) (= 1 (select (store |#valid| main_~head~0.base 0) main_~x~0.base))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 25323#(= 1 (select |#valid| main_~x~0.base)), 25302#true, 25303#false, 25304#(= 1 (select |#valid| main_~head~0.base)), 25305#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 25306#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 25307#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 25308#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 |main_#t~mem6.offset|)), 25309#(and (= main_~x~0.offset 0) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 25310#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 25311#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:31:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:22,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:31:22,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:31:22,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:31:22,641 INFO L87 Difference]: Start difference. First operand 313 states and 366 transitions. Second operand 22 states. [2018-02-02 10:31:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:23,357 INFO L93 Difference]: Finished difference Result 384 states and 443 transitions. [2018-02-02 10:31:23,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:31:23,358 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 58 [2018-02-02 10:31:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:23,359 INFO L225 Difference]: With dead ends: 384 [2018-02-02 10:31:23,359 INFO L226 Difference]: Without dead ends: 384 [2018-02-02 10:31:23,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=1719, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:31:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-02-02 10:31:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 370. [2018-02-02 10:31:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-02-02 10:31:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 437 transitions. [2018-02-02 10:31:23,362 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 437 transitions. Word has length 58 [2018-02-02 10:31:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:23,362 INFO L432 AbstractCegarLoop]: Abstraction has 370 states and 437 transitions. [2018-02-02 10:31:23,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:31:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 437 transitions. [2018-02-02 10:31:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:31:23,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:23,363 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:23,363 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:23,363 INFO L82 PathProgramCache]: Analyzing trace with hash -445019961, now seen corresponding path program 1 times [2018-02-02 10:31:23,363 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:23,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:23,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:23,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:31:23,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:23,901 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 10:31:23,901 INFO L182 omatonBuilderFactory]: Interpolants [26124#true, 26125#false, 26126#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 26127#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 26128#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 26129#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 26130#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 26131#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26132#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|)), 26133#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 26134#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26135#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 26136#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.base|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 26137#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 26138#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (or (= |main_#t~mem13.offset| 0) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))))) (or (not (= |main_#t~mem13.offset| 0)) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))))), 26139#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))) (and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 26140#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (and (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem19.base|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))))), 26141#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (and (or (and (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select |#length| main_~x~0.base) 8))) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (or (= (select |#length| main_~x~0.base) 8) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))))), 26142#(or (and (or (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 26143#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (or (<= (+ (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0))))) (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) 0)))), 26144#(or (not (= 0 main_~x~0.offset)) (and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 26145#(or (not (= 0 main_~head~0.offset)) (and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 26146#(or (not (= 0 main_~head~0.offset)) (and (<= 0 |main_#t~mem22.offset|) (<= (+ |main_#t~mem22.offset| 8) (select |#length| |main_#t~mem22.base|)))), 26147#(or (not (= 0 main_~head~0.offset)) (and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))), 26148#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 10:31:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:23,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:31:23,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:31:23,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:31:23,902 INFO L87 Difference]: Start difference. First operand 370 states and 437 transitions. Second operand 25 states. [2018-02-02 10:31:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:25,089 INFO L93 Difference]: Finished difference Result 397 states and 454 transitions. [2018-02-02 10:31:25,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:31:25,090 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2018-02-02 10:31:25,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:25,090 INFO L225 Difference]: With dead ends: 397 [2018-02-02 10:31:25,091 INFO L226 Difference]: Without dead ends: 397 [2018-02-02 10:31:25,091 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=440, Invalid=2422, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:31:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-02-02 10:31:25,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 370. [2018-02-02 10:31:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-02-02 10:31:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 437 transitions. [2018-02-02 10:31:25,093 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 437 transitions. Word has length 58 [2018-02-02 10:31:25,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:25,093 INFO L432 AbstractCegarLoop]: Abstraction has 370 states and 437 transitions. [2018-02-02 10:31:25,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:31:25,093 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 437 transitions. [2018-02-02 10:31:25,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:31:25,094 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:25,094 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:25,094 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:25,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1952109060, now seen corresponding path program 2 times [2018-02-02 10:31:25,094 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:25,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:25,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:25,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:31:25,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:25,622 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 10:31:25,622 INFO L182 omatonBuilderFactory]: Interpolants [26974#true, 26975#false, 26976#(= 0 |main_#t~malloc0.offset|), 26977#(= main_~head~0.offset 0), 26978#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 26979#(and (= main_~head~0.offset main_~x~0.offset) (= 1 main_~state~0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 26980#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= 1 main_~state~0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 26981#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 1 main_~state~0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 26982#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 1 main_~state~0) (= 0 |main_#t~mem6.offset|) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 26983#(and (= 1 (select |#valid| main_~head~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (or (= 1 main_~state~0) (not (= main_~head~0.offset main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 26984#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= 1 main_~state~0) (not (= main_~x~0.base main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 26985#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= 1 (select |#valid| main_~head~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 26986#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 26987#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 26988#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base)) (= main_~head~0.offset 0)), 26989#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 1 (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)))), 26990#(and (= 1 (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4) main_~state~0)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 26991#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0)), 26992#(and (= 1 (select (select |#memory_int| |main_#t~mem11.base|) (+ main_~head~0.offset 4))) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 26993#(or (and (or (not (= 1 (select |#valid| main_~x~0.base))) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 4))))) (= main_~head~0.offset 0)) (= 0 (select |#valid| main_~x~0.base))), 26994#(and (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 26995#(not (= 0 (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 4)))), 26996#(or (<= 1 main_~x~0.offset) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (<= (+ main_~x~0.offset 1) 0)), 26997#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0) (not (= 0 |main_#t~mem21|))), 26998#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0))] [2018-02-02 10:31:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:25,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:31:25,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:31:25,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:31:25,623 INFO L87 Difference]: Start difference. First operand 370 states and 437 transitions. Second operand 25 states. [2018-02-02 10:31:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:26,699 INFO L93 Difference]: Finished difference Result 509 states and 595 transitions. [2018-02-02 10:31:26,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:31:26,699 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2018-02-02 10:31:26,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:26,700 INFO L225 Difference]: With dead ends: 509 [2018-02-02 10:31:26,700 INFO L226 Difference]: Without dead ends: 508 [2018-02-02 10:31:26,701 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=496, Invalid=2366, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:31:26,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-02-02 10:31:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 419. [2018-02-02 10:31:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-02-02 10:31:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 500 transitions. [2018-02-02 10:31:26,703 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 500 transitions. Word has length 58 [2018-02-02 10:31:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:26,703 INFO L432 AbstractCegarLoop]: Abstraction has 419 states and 500 transitions. [2018-02-02 10:31:26,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:31:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 500 transitions. [2018-02-02 10:31:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:31:26,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:26,704 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:26,704 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:26,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1952158712, now seen corresponding path program 1 times [2018-02-02 10:31:26,704 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:26,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:26,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:26,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:31:26,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:26,856 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 10:31:26,857 INFO L182 omatonBuilderFactory]: Interpolants [28000#(= main_~head~0.offset 0), 27985#true, 27986#false, 27987#(= (select |#valid| main_~head~0.base) 1), 27988#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 27989#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 27990#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 27991#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 27992#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 27993#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 27994#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 27995#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 27996#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 27997#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 27998#(= 0 |main_#t~mem20.offset|), 27999#(= 0 main_~x~0.offset)] [2018-02-02 10:31:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:26,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:31:26,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:31:26,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:31:26,857 INFO L87 Difference]: Start difference. First operand 419 states and 500 transitions. Second operand 16 states. [2018-02-02 10:31:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:27,204 INFO L93 Difference]: Finished difference Result 437 states and 510 transitions. [2018-02-02 10:31:27,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:31:27,204 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-02-02 10:31:27,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:27,205 INFO L225 Difference]: With dead ends: 437 [2018-02-02 10:31:27,205 INFO L226 Difference]: Without dead ends: 437 [2018-02-02 10:31:27,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:31:27,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-02 10:31:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 395. [2018-02-02 10:31:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-02 10:31:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 464 transitions. [2018-02-02 10:31:27,208 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 464 transitions. Word has length 58 [2018-02-02 10:31:27,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:27,208 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 464 transitions. [2018-02-02 10:31:27,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:31:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 464 transitions. [2018-02-02 10:31:27,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:31:27,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:27,209 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:27,209 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:27,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1333050140, now seen corresponding path program 2 times [2018-02-02 10:31:27,209 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:27,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:27,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:27,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:31:27,461 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:27,462 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 10:31:27,462 INFO L182 omatonBuilderFactory]: Interpolants [28864#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 28865#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 28866#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))), 28867#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 28868#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28869#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)), 28870#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 28871#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 28872#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 28873#(and (<= 0 |main_#t~mem15.offset|) (<= (+ |main_#t~mem15.offset| 8) (select |#length| |main_#t~mem15.base|))), 28855#true, 28856#false, 28857#(= (select |#valid| main_~head~0.base) 1), 28858#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 28859#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 28860#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 28861#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 28862#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 28863#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 10:31:27,462 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:27,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:31:27,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:31:27,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:31:27,462 INFO L87 Difference]: Start difference. First operand 395 states and 464 transitions. Second operand 19 states. [2018-02-02 10:31:28,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:28,081 INFO L93 Difference]: Finished difference Result 460 states and 531 transitions. [2018-02-02 10:31:28,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:31:28,082 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-02-02 10:31:28,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:28,083 INFO L225 Difference]: With dead ends: 460 [2018-02-02 10:31:28,083 INFO L226 Difference]: Without dead ends: 460 [2018-02-02 10:31:28,083 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:31:28,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-02-02 10:31:28,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 400. [2018-02-02 10:31:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-02-02 10:31:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 469 transitions. [2018-02-02 10:31:28,086 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 469 transitions. Word has length 58 [2018-02-02 10:31:28,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:28,086 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 469 transitions. [2018-02-02 10:31:28,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:31:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 469 transitions. [2018-02-02 10:31:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:31:28,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:28,086 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:28,086 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:28,086 INFO L82 PathProgramCache]: Analyzing trace with hash -722212438, now seen corresponding path program 1 times [2018-02-02 10:31:28,087 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:28,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:28,605 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:28,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:31:28,606 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:28,606 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 10:31:28,606 INFO L182 omatonBuilderFactory]: Interpolants [29762#true, 29763#false, 29764#(= 0 |main_#t~malloc0.offset|), 29765#(= main_~head~0.offset 0), 29766#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 29767#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 29768#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 29769#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 29770#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 29771#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 29772#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 29773#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~state~0 0)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 29774#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~state~0 0)) (= 1 (select |#valid| main_~head~0.base)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 29775#(and (not (= main_~state~0 0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 29776#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~state~0 0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0) (= main_~head~0.offset main_~x~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 29777#(and (not (= main_~state~0 0)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) main_~state~0) (= main_~head~0.offset 0)), 29778#(and (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) main_~state~0) (not (= main_~state~0 0)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 29779#(and (= (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4) main_~state~0)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) main_~state~0) (not (= main_~state~0 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 29780#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0)), 29781#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_int| |main_#t~mem11.base|) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0)), 29782#(and (or (not (= 1 (select |#valid| main_~x~0.base))) (and (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 4)) 0)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= main_~head~0.offset 0)), 29783#(not (= (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 4)) 0)), 29784#(or (<= 1 main_~x~0.offset) (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)) (<= (+ main_~x~0.offset 1) 0)), 29785#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0) (not (= |main_#t~mem21| 0))), 29786#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0))] [2018-02-02 10:31:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:28,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:31:28,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:31:28,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:31:28,606 INFO L87 Difference]: Start difference. First operand 400 states and 469 transitions. Second operand 25 states. [2018-02-02 10:31:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:29,640 INFO L93 Difference]: Finished difference Result 521 states and 607 transitions. [2018-02-02 10:31:29,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:31:29,641 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2018-02-02 10:31:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:29,642 INFO L225 Difference]: With dead ends: 521 [2018-02-02 10:31:29,642 INFO L226 Difference]: Without dead ends: 520 [2018-02-02 10:31:29,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=500, Invalid=2362, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:31:29,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-02-02 10:31:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 393. [2018-02-02 10:31:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-02-02 10:31:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 461 transitions. [2018-02-02 10:31:29,645 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 461 transitions. Word has length 59 [2018-02-02 10:31:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:29,645 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 461 transitions. [2018-02-02 10:31:29,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:31:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 461 transitions. [2018-02-02 10:31:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:31:29,646 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:29,646 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:29,646 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:29,646 INFO L82 PathProgramCache]: Analyzing trace with hash 780080836, now seen corresponding path program 2 times [2018-02-02 10:31:29,646 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:29,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:29,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:29,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:31:29,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:29,883 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 10:31:29,883 INFO L182 omatonBuilderFactory]: Interpolants [30759#true, 30760#false, 30761#(= (select |#valid| main_~head~0.base) 1), 30762#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 30763#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 30764#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 30765#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30766#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 30767#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 30768#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 30769#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 30770#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 30771#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)), 30772#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 30773#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 30774#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 30775#(and (<= 0 |main_#t~mem19.offset|) (<= (+ |main_#t~mem19.offset| 8) (select |#length| |main_#t~mem19.base|))), 30776#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 10:31:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:29,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:31:29,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:31:29,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:31:29,883 INFO L87 Difference]: Start difference. First operand 393 states and 461 transitions. Second operand 18 states. [2018-02-02 10:31:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:30,610 INFO L93 Difference]: Finished difference Result 425 states and 487 transitions. [2018-02-02 10:31:30,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:31:30,610 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2018-02-02 10:31:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:30,611 INFO L225 Difference]: With dead ends: 425 [2018-02-02 10:31:30,611 INFO L226 Difference]: Without dead ends: 425 [2018-02-02 10:31:30,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:31:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-02-02 10:31:30,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 409. [2018-02-02 10:31:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-02-02 10:31:30,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 482 transitions. [2018-02-02 10:31:30,614 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 482 transitions. Word has length 59 [2018-02-02 10:31:30,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:30,614 INFO L432 AbstractCegarLoop]: Abstraction has 409 states and 482 transitions. [2018-02-02 10:31:30,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:31:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 482 transitions. [2018-02-02 10:31:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:31:30,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:30,614 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:30,614 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:30,615 INFO L82 PathProgramCache]: Analyzing trace with hash 381373034, now seen corresponding path program 1 times [2018-02-02 10:31:30,615 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:30,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:31:30,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:30,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:31:30,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:30,957 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 10:31:30,957 INFO L182 omatonBuilderFactory]: Interpolants [31648#(= main_~head~0.offset 0), 31649#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 31650#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 31651#(and (= main_~head~0.base |main_#t~mem11.base|) (= main_~head~0.offset |main_#t~mem11.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) |main_#t~mem11.offset|)) |main_#t~mem11.base|)), 31652#(and (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 31653#(and (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem12| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 31654#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 31655#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem19.offset|) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base |main_#t~mem19.base|) (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) |main_#t~mem19.offset|)) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 31656#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (+ |main_#t~mem13.offset| 4)))) (= main_~head~0.offset 0)), 31657#(and (not (= 0 |main_#t~mem14|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 31658#(and (not |main_#t~short18|) (= main_~head~0.offset 0)), 31645#true, 31646#false, 31647#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 10:31:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:31:30,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:31:30,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:31:30,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:31:30,957 INFO L87 Difference]: Start difference. First operand 409 states and 482 transitions. Second operand 14 states. [2018-02-02 10:31:31,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:31,262 INFO L93 Difference]: Finished difference Result 407 states and 466 transitions. [2018-02-02 10:31:31,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:31:31,262 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-02-02 10:31:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:31,263 INFO L225 Difference]: With dead ends: 407 [2018-02-02 10:31:31,263 INFO L226 Difference]: Without dead ends: 407 [2018-02-02 10:31:31,263 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:31:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-02-02 10:31:31,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 399. [2018-02-02 10:31:31,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-02 10:31:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 466 transitions. [2018-02-02 10:31:31,265 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 466 transitions. Word has length 60 [2018-02-02 10:31:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:31,265 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 466 transitions. [2018-02-02 10:31:31,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:31:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 466 transitions. [2018-02-02 10:31:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:31:31,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:31,266 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:31,266 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:31,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1832550675, now seen corresponding path program 1 times [2018-02-02 10:31:31,266 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:31,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:31,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:31,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:31:31,562 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:31,562 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 10:31:31,562 INFO L182 omatonBuilderFactory]: Interpolants [32489#true, 32490#false, 32491#(= 0 |main_#t~malloc0.offset|), 32492#(= 0 main_~head~0.offset), 32493#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 32494#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 32495#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 32496#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 32497#(and (= 0 main_~head~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|)), 32498#(and (= 0 main_~head~0.offset) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 32499#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 32500#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)), 32501#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.base|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.offset|)), 32502#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))), 32503#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (or (= |main_#t~mem13.offset| 0) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))))), 32504#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (or (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 32505#(or (and (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 32506#(or (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) 0))) (and (<= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (<= (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|) 0))), 32507#(or (not (= 0 main_~x~0.offset)) (and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 32508#(or (not (= 0 main_~head~0.offset)) (and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 32509#(or (not (= 0 main_~head~0.offset)) (and (<= 0 |main_#t~mem22.offset|) (<= |main_#t~mem22.offset| 0))), 32510#(or (and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset)) (not (= 0 main_~head~0.offset))), 32511#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset))] [2018-02-02 10:31:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:31,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:31:31,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:31:31,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:31:31,563 INFO L87 Difference]: Start difference. First operand 399 states and 466 transitions. Second operand 23 states. [2018-02-02 10:31:32,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:32,322 INFO L93 Difference]: Finished difference Result 410 states and 469 transitions. [2018-02-02 10:31:32,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:31:32,323 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2018-02-02 10:31:32,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:32,324 INFO L225 Difference]: With dead ends: 410 [2018-02-02 10:31:32,324 INFO L226 Difference]: Without dead ends: 410 [2018-02-02 10:31:32,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=354, Invalid=1626, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:31:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-02-02 10:31:32,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 395. [2018-02-02 10:31:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-02 10:31:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 461 transitions. [2018-02-02 10:31:32,327 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 461 transitions. Word has length 60 [2018-02-02 10:31:32,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:32,328 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 461 transitions. [2018-02-02 10:31:32,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:31:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 461 transitions. [2018-02-02 10:31:32,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:31:32,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:32,328 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:32,329 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:32,329 INFO L82 PathProgramCache]: Analyzing trace with hash -876181798, now seen corresponding path program 1 times [2018-02-02 10:31:32,329 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:32,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:32,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:32,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:31:32,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:32,761 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 10:31:32,761 INFO L182 omatonBuilderFactory]: Interpolants [33376#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 33377#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 33378#(and (or (not (= 0 |main_#t~mem20.base|)) (not (= 0 |main_#t~mem20.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0))) (not (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0)))), 33379#(and (or (not (= main_~x~0.offset 0)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))) (or (not (= 0 main_~x~0.offset)) (not (= 0 main_~x~0.base)))), 33380#(and (or (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.offset 0))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 33381#(and (or (= 1 (select (store |#valid| main_~head~0.base 0) |main_#t~mem22.base|)) (not (= main_~head~0.offset 0))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 33382#(and (or (= 1 (select (store |#valid| main_~head~0.base 0) main_~x~0.base)) (not (= main_~head~0.offset 0))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 33383#(= 1 (select |#valid| main_~x~0.base)), 33361#true, 33362#false, 33363#(= (select |#valid| main_~head~0.base) 1), 33364#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 33365#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= |main_#t~malloc4.offset| 0) (= main_~x~0.base main_~head~0.base)), 33366#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 33367#(and (= |main_#t~mem6.offset| 0) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 33368#(and (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 33369#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 33370#(and (= 1 (select |#valid| |main_#t~malloc4.base|)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 33371#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 33372#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 33373#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0)))), 33374#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 33375#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))))] [2018-02-02 10:31:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:32,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:31:32,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:31:32,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:31:32,762 INFO L87 Difference]: Start difference. First operand 395 states and 461 transitions. Second operand 23 states. [2018-02-02 10:31:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:33,983 INFO L93 Difference]: Finished difference Result 466 states and 536 transitions. [2018-02-02 10:31:33,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:31:33,983 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2018-02-02 10:31:33,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:33,984 INFO L225 Difference]: With dead ends: 466 [2018-02-02 10:31:33,984 INFO L226 Difference]: Without dead ends: 466 [2018-02-02 10:31:33,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=356, Invalid=2194, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 10:31:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-02-02 10:31:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 425. [2018-02-02 10:31:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 10:31:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 503 transitions. [2018-02-02 10:31:33,987 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 503 transitions. Word has length 60 [2018-02-02 10:31:33,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:33,988 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 503 transitions. [2018-02-02 10:31:33,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:31:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 503 transitions. [2018-02-02 10:31:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:31:33,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:33,988 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:33,988 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:33,988 INFO L82 PathProgramCache]: Analyzing trace with hash -876181797, now seen corresponding path program 1 times [2018-02-02 10:31:33,989 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:33,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:34,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:34,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:31:34,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:34,285 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 10:31:34,285 INFO L182 omatonBuilderFactory]: Interpolants [34336#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 34337#(and (= |main_#t~mem6.offset| 0) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 34338#(and (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 34339#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 34340#(and (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 34341#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 34342#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))), 34343#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 34344#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 34345#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) 0))), 34346#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 34347#(and (= main_~x~0.offset main_~head~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 34348#(and (or (= 8 (select |#length| |main_#t~mem22.base|)) (not (= main_~head~0.offset 0))) (or (= 0 |main_#t~mem22.offset|) (not (= main_~head~0.offset 0)))), 34349#(and (or (= (select |#length| main_~x~0.base) 8) (not (= main_~head~0.offset 0))) (or (= main_~x~0.offset 0) (not (= main_~head~0.offset 0)))), 34350#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 34331#true, 34332#false, 34333#(= (select |#valid| main_~head~0.base) 1), 34334#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 34335#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= |main_#t~malloc4.offset| 0) (= main_~x~0.base main_~head~0.base))] [2018-02-02 10:31:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:34,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:31:34,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:31:34,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:31:34,286 INFO L87 Difference]: Start difference. First operand 425 states and 503 transitions. Second operand 20 states. [2018-02-02 10:31:35,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:35,057 INFO L93 Difference]: Finished difference Result 463 states and 532 transitions. [2018-02-02 10:31:35,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:31:35,057 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-02-02 10:31:35,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:35,058 INFO L225 Difference]: With dead ends: 463 [2018-02-02 10:31:35,058 INFO L226 Difference]: Without dead ends: 463 [2018-02-02 10:31:35,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:31:35,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-02 10:31:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 427. [2018-02-02 10:31:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-02-02 10:31:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 505 transitions. [2018-02-02 10:31:35,062 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 505 transitions. Word has length 60 [2018-02-02 10:31:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:35,062 INFO L432 AbstractCegarLoop]: Abstraction has 427 states and 505 transitions. [2018-02-02 10:31:35,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:31:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 505 transitions. [2018-02-02 10:31:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:31:35,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:35,062 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:35,062 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:35,063 INFO L82 PathProgramCache]: Analyzing trace with hash 751984768, now seen corresponding path program 1 times [2018-02-02 10:31:35,063 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:35,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:35,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:31:35,630 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:35,631 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 10:31:35,631 INFO L182 omatonBuilderFactory]: Interpolants [35267#true, 35268#false, 35269#(= 0 |main_#t~malloc0.offset|), 35270#(= main_~head~0.offset 0), 35271#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 35272#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 35273#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 35274#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 35275#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 |main_#t~mem6.offset|) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 35276#(and (= main_~head~0.offset main_~x~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 35277#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 35278#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~state~0 0)) (= main_~head~0.offset main_~x~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 35279#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~state~0 0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0) (= main_~head~0.offset main_~x~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 35280#(and (not (= main_~state~0 0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 35281#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~state~0 0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0) (= main_~head~0.offset main_~x~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 35282#(and (not (= main_~state~0 0)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) main_~state~0) (= main_~head~0.offset 0)), 35283#(and (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) main_~state~0) (not (= main_~state~0 0)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 35284#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 35285#(and (not (= (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4) main_~state~0)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 35286#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0)), 35287#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_int| |main_#t~mem11.base|) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0)), 35288#(and (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 4)) 0)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 35289#(not (= (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 4)) 0)), 35290#(or (<= 1 main_~x~0.offset) (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)) (<= (+ main_~x~0.offset 1) 0)), 35291#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0) (not (= |main_#t~mem21| 0))), 35292#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0))] [2018-02-02 10:31:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:31:35,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:31:35,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:31:35,631 INFO L87 Difference]: Start difference. First operand 427 states and 505 transitions. Second operand 26 states. [2018-02-02 10:31:36,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:36,703 INFO L93 Difference]: Finished difference Result 583 states and 684 transitions. [2018-02-02 10:31:36,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:31:36,703 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-02-02 10:31:36,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:36,704 INFO L225 Difference]: With dead ends: 583 [2018-02-02 10:31:36,704 INFO L226 Difference]: Without dead ends: 582 [2018-02-02 10:31:36,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=508, Invalid=2462, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 10:31:36,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-02-02 10:31:36,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 385. [2018-02-02 10:31:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-02 10:31:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 450 transitions. [2018-02-02 10:31:36,707 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 450 transitions. Word has length 61 [2018-02-02 10:31:36,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:36,707 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 450 transitions. [2018-02-02 10:31:36,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:31:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 450 transitions. [2018-02-02 10:31:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:31:36,708 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:36,708 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:36,708 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:36,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1982120890, now seen corresponding path program 1 times [2018-02-02 10:31:36,708 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:36,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:37,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:37,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:31:37,052 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:37,052 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 10:31:37,052 INFO L182 omatonBuilderFactory]: Interpolants [36320#false, 36321#(= |main_#t~malloc0.offset| 0), 36322#(= main_~head~0.offset 0), 36323#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 36324#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 36325#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 36326#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 36327#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 36328#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 36329#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 36330#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 36331#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0)), 36332#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 36333#(and (= main_~head~0.offset |main_#t~malloc4.offset|) (or (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))))), 36334#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 36335#(and (= main_~head~0.offset |main_#t~mem6.offset|) (or (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 36336#(or (and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 36337#(or (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)) (and (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)))), 36338#(or (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 36339#(= 1 (select |#valid| |main_#t~mem11.base|)), 36340#(= (select |#valid| main_~x~0.base) 1), 36319#true] [2018-02-02 10:31:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:37,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:31:37,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:31:37,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:31:37,053 INFO L87 Difference]: Start difference. First operand 385 states and 450 transitions. Second operand 22 states. [2018-02-02 10:31:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:38,381 INFO L93 Difference]: Finished difference Result 494 states and 574 transitions. [2018-02-02 10:31:38,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:31:38,381 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-02-02 10:31:38,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:38,382 INFO L225 Difference]: With dead ends: 494 [2018-02-02 10:31:38,382 INFO L226 Difference]: Without dead ends: 494 [2018-02-02 10:31:38,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=621, Invalid=2135, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:31:38,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-02-02 10:31:38,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 384. [2018-02-02 10:31:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-02-02 10:31:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 449 transitions. [2018-02-02 10:31:38,385 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 449 transitions. Word has length 61 [2018-02-02 10:31:38,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:38,385 INFO L432 AbstractCegarLoop]: Abstraction has 384 states and 449 transitions. [2018-02-02 10:31:38,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:31:38,386 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 449 transitions. [2018-02-02 10:31:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:31:38,386 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:38,386 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:38,386 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:38,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1982120891, now seen corresponding path program 1 times [2018-02-02 10:31:38,386 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:38,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:39,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:39,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:31:39,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:39,016 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 10:31:39,016 INFO L182 omatonBuilderFactory]: Interpolants [37281#true, 37282#false, 37283#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= |main_#t~malloc0.offset| 0)), 37284#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 37285#(and (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 37286#(and (= 8 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 37287#(and (= 8 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 37288#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 37289#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 37290#(and (= 8 (select |#length| main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 37291#(and (= (select |#length| main_~x~0.base) 8) (= 8 (select |#length| main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 37292#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 37293#(and (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 37294#(and (= 8 (select |#length| main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 1) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 37295#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset |main_#t~malloc4.offset|) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)))), 37296#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 37297#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem6.offset|)), 37298#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (or (and (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (and (= 8 (select |#length| main_~head~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)))), 37299#(and (or (and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base)) (and (not (= main_~x~0.base main_~head~0.base)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))) (or (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 37300#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 37301#(and (<= 8 (select |#length| |main_#t~mem11.base|)) (= 0 |main_#t~mem11.offset|)), 37302#(and (<= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset))] [2018-02-02 10:31:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:39,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:31:39,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:31:39,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:31:39,016 INFO L87 Difference]: Start difference. First operand 384 states and 449 transitions. Second operand 22 states. [2018-02-02 10:31:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:40,430 INFO L93 Difference]: Finished difference Result 412 states and 473 transitions. [2018-02-02 10:31:40,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:31:40,430 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-02-02 10:31:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:40,431 INFO L225 Difference]: With dead ends: 412 [2018-02-02 10:31:40,431 INFO L226 Difference]: Without dead ends: 412 [2018-02-02 10:31:40,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=497, Invalid=1573, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:31:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-02 10:31:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 384. [2018-02-02 10:31:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-02-02 10:31:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 448 transitions. [2018-02-02 10:31:40,434 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 448 transitions. Word has length 61 [2018-02-02 10:31:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:40,434 INFO L432 AbstractCegarLoop]: Abstraction has 384 states and 448 transitions. [2018-02-02 10:31:40,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:31:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 448 transitions. [2018-02-02 10:31:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:31:40,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:40,434 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:40,435 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:40,435 INFO L82 PathProgramCache]: Analyzing trace with hash 298965808, now seen corresponding path program 3 times [2018-02-02 10:31:40,435 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:40,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 10:31:40,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:40,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:31:40,468 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:40,469 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 10:31:40,469 INFO L182 omatonBuilderFactory]: Interpolants [38147#true, 38148#false, 38149#(and (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 38150#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 4))), 38151#(and (<= (+ |main_#t~mem19.offset| 8) (select |#length| |main_#t~mem19.base|)) (<= 0 (+ |main_#t~mem19.offset| 4))), 38152#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 (+ main_~x~0.offset 4)))] [2018-02-02 10:31:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 10:31:40,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:31:40,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:31:40,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:31:40,469 INFO L87 Difference]: Start difference. First operand 384 states and 448 transitions. Second operand 6 states. [2018-02-02 10:31:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:40,566 INFO L93 Difference]: Finished difference Result 383 states and 441 transitions. [2018-02-02 10:31:40,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:31:40,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-02-02 10:31:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:40,567 INFO L225 Difference]: With dead ends: 383 [2018-02-02 10:31:40,567 INFO L226 Difference]: Without dead ends: 383 [2018-02-02 10:31:40,567 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:31:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-02-02 10:31:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 382. [2018-02-02 10:31:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 10:31:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 440 transitions. [2018-02-02 10:31:40,569 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 440 transitions. Word has length 61 [2018-02-02 10:31:40,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:40,569 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 440 transitions. [2018-02-02 10:31:40,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:31:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 440 transitions. [2018-02-02 10:31:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:31:40,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:40,570 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:40,570 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 10:31:40,570 INFO L82 PathProgramCache]: Analyzing trace with hash 144612372, now seen corresponding path program 1 times [2018-02-02 10:31:40,570 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:40,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:41,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:41,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:31:41,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:41,175 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 10:31:41,175 INFO L182 omatonBuilderFactory]: Interpolants [38944#(or (not (= 0 main_~head~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (not (= 0 main_~head~0.base)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|))), 38945#(or (not (= 0 main_~head~0.offset)) (and (= (store (store |#valid| main_~head~0.base 0) |main_#t~mem22.base| 0) |old(#valid)|) (not (= 0 |main_#t~mem22.base|)) (not (= |main_#t~mem22.base| main_~head~0.base)) (not (= 0 main_~head~0.base)))), 38946#(or (not (= 0 main_~head~0.offset)) (and (not (= main_~head~0.base main_~x~0.base)) (not (= 0 main_~x~0.base)) (= (store (store |#valid| main_~head~0.base 0) main_~x~0.base 0) |old(#valid)|) (not (= 0 main_~head~0.base)))), 38947#(and (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|)), 38926#true, 38927#false, 38928#(= |#valid| |old(#valid)|), 38929#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 38930#(and (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 38931#(and (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 38932#(and (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 38933#(and (= main_~x~0.offset main_~head~0.offset) (= |old(#valid)| (store (store |#valid| |main_#t~malloc4.base| 0) main_~head~0.base 0)) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 38934#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 38935#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= 0 |main_#t~mem6.offset|)), 38936#(and (= (store (store |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (= main_~x~0.offset 0) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 38937#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 38938#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 38939#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 38940#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 38941#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) |old(#valid)|) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 38942#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0) |main_#t~mem20.base|)) (= (store (store |#valid| |main_#t~mem20.base| 0) (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0) 0) |old(#valid)|) (or (not (= 0 |main_#t~mem20.base|)) (not (= 0 |main_#t~mem20.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0)))), 38943#(or (not (= 0 main_~x~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~x~0.base)) (= (store (store |#valid| main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))))] [2018-02-02 10:31:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:41,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:31:41,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:31:41,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:31:41,176 INFO L87 Difference]: Start difference. First operand 382 states and 440 transitions. Second operand 22 states. Received shutdown request... [2018-02-02 10:31:42,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:31:42,213 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:31:42,217 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:31:42,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:31:42 BoogieIcfgContainer [2018-02-02 10:31:42,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:31:42,218 INFO L168 Benchmark]: Toolchain (without parser) took 49469.66 ms. Allocated memory was 392.7 MB in the beginning and 1.3 GB in the end (delta: 918.6 MB). Free memory was 349.4 MB in the beginning and 1.2 GB in the end (delta: -857.4 MB). Peak memory consumption was 61.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:31:42,219 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 392.7 MB. Free memory is still 354.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:31:42,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.20 ms. Allocated memory is still 392.7 MB. Free memory was 349.4 MB in the beginning and 336.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:31:42,219 INFO L168 Benchmark]: Boogie Preprocessor took 29.16 ms. Allocated memory is still 392.7 MB. Free memory is still 336.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:31:42,219 INFO L168 Benchmark]: RCFGBuilder took 344.73 ms. Allocated memory is still 392.7 MB. Free memory was 336.2 MB in the beginning and 303.1 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:31:42,220 INFO L168 Benchmark]: TraceAbstraction took 48932.76 ms. Allocated memory was 392.7 MB in the beginning and 1.3 GB in the end (delta: 918.6 MB). Free memory was 303.1 MB in the beginning and 1.2 GB in the end (delta: -903.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:31:42,220 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.21 ms. Allocated memory is still 392.7 MB. Free memory is still 354.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.20 ms. Allocated memory is still 392.7 MB. Free memory was 349.4 MB in the beginning and 336.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.16 ms. Allocated memory is still 392.7 MB. Free memory is still 336.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 344.73 ms. Allocated memory is still 392.7 MB. Free memory was 336.2 MB in the beginning and 303.1 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 48932.76 ms. Allocated memory was 392.7 MB in the beginning and 1.3 GB in the end (delta: 918.6 MB). Free memory was 303.1 MB in the beginning and 1.2 GB in the end (delta: -903.7 MB). Peak memory consumption was 14.9 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 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 29 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 103 locations, 41 error locations. TIMEOUT Result, 48.8s OverallTime, 68 OverallIterations, 3 TraceHistogramMax, 33.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4852 SDtfs, 21368 SDslu, 32508 SDs, 0 SdLazy, 36108 SolverSat, 2915 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1904 GetRequests, 131 SyntacticMatches, 122 SemanticMatches, 1650 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9864 ImplicationChecksByTransitivity, 26.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=427occurred in iteration=63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 77/664 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 67 MinimizatonAttempts, 2670 StatesRemovedByMinimization, 67 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 2945 NumberOfCodeBlocks, 2945 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 2877 ConstructedInterpolants, 0 QuantifiedInterpolants, 2882860 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 68 InterpolantComputations, 22 PerfectInterpolantSequences, 77/664 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/sll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-31-42-225.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-31-42-225.csv Completed graceful shutdown