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/dll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:27:18,520 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:27:18,521 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:27:18,533 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:27:18,534 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:27:18,534 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:27:18,535 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:27:18,537 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:27:18,538 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:27:18,539 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:27:18,540 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:27:18,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:27:18,541 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:27:18,542 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:27:18,542 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:27:18,544 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:27:18,546 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:27:18,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:27:18,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:27:18,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:27:18,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:27:18,551 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:27:18,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:27:18,552 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:27:18,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:27:18,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:27:18,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:27:18,555 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:27:18,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:27:18,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:27:18,555 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:27:18,555 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:27:18,564 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:27:18,564 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:27:18,565 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:27:18,565 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:27:18,565 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:27:18,566 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:27:18,566 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:27:18,566 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:27:18,566 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:27:18,566 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:27:18,566 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:27:18,566 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:27:18,566 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:27:18,566 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:27:18,566 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:27:18,567 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:27:18,567 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:27:18,567 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:27:18,567 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:27:18,567 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:27:18,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:27:18,567 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:27:18,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:27:18,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:27:18,602 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:27:18,604 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:27:18,605 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:27:18,605 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:27:18,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:27:18,744 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:27:18,745 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:27:18,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:27:18,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:27:18,750 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:27:18,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:27:18" (1/1) ... [2018-02-02 10:27:18,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e89376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:18, skipping insertion in model container [2018-02-02 10:27:18,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:27:18" (1/1) ... [2018-02-02 10:27:18,764 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:27:18,798 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:27:18,897 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:27:18,912 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:27:18,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:18 WrapperNode [2018-02-02 10:27:18,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:27:18,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:27:18,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:27:18,919 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:27:18,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:18" (1/1) ... [2018-02-02 10:27:18,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:18" (1/1) ... [2018-02-02 10:27:18,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:18" (1/1) ... [2018-02-02 10:27:18,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:18" (1/1) ... [2018-02-02 10:27:18,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:18" (1/1) ... [2018-02-02 10:27:18,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:18" (1/1) ... [2018-02-02 10:27:18,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:18" (1/1) ... [2018-02-02 10:27:18,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:27:18,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:27:18,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:27:18,952 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:27:18,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:18" (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:27:18,991 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:27:18,991 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:27:18,991 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:27:18,991 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:27:18,991 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:27:18,991 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:27:18,991 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:27:18,991 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:27:18,991 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:27:18,991 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:27:18,992 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:27:18,992 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:27:18,992 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:27:18,992 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:27:18,992 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:27:18,992 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:27:18,992 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:27:19,314 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:27:19,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:27:19 BoogieIcfgContainer [2018-02-02 10:27:19,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:27:19,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:27:19,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:27:19,318 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:27:19,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:27:18" (1/3) ... [2018-02-02 10:27:19,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fc8f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:27:19, skipping insertion in model container [2018-02-02 10:27:19,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:18" (2/3) ... [2018-02-02 10:27:19,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fc8f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:27:19, skipping insertion in model container [2018-02-02 10:27:19,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:27:19" (3/3) ... [2018-02-02 10:27:19,320 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-circular_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:27:19,327 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:27:19,334 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-02-02 10:27:19,360 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:27:19,361 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:27:19,361 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:27:19,361 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:27:19,361 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:27:19,361 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:27:19,361 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:27:19,362 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:27:19,362 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:27:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-02-02 10:27:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:27:19,383 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:19,384 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:19,384 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:19,387 INFO L82 PathProgramCache]: Analyzing trace with hash 414289043, now seen corresponding path program 1 times [2018-02-02 10:27:19,420 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:19,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:19,497 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:27:19,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:19,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:27:19,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:19,500 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:27:19,501 INFO L182 omatonBuilderFactory]: Interpolants [116#true, 117#false, 118#(= 1 (select |#valid| |main_#t~malloc0.base|)), 119#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 10:27:19,501 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:27:19,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:27:19,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:27:19,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:27:19,511 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 4 states. [2018-02-02 10:27:19,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:19,735 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-02-02 10:27:19,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:27:19,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:27:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:19,742 INFO L225 Difference]: With dead ends: 123 [2018-02-02 10:27:19,742 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:27:19,743 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:27:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:27:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2018-02-02 10:27:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 10:27:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-02-02 10:27:19,768 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 8 [2018-02-02 10:27:19,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:19,768 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-02-02 10:27:19,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:27:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-02-02 10:27:19,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:27:19,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:19,769 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:19,769 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:19,769 INFO L82 PathProgramCache]: Analyzing trace with hash 414289044, now seen corresponding path program 1 times [2018-02-02 10:27:19,770 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:19,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:19,831 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:27:19,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:19,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:27:19,832 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:19,832 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:27:19,832 INFO L182 omatonBuilderFactory]: Interpolants [352#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 353#(and (= (select |#length| main_~head~0.base) 12) (= main_~head~0.offset 0)), 350#true, 351#false] [2018-02-02 10:27:19,833 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:27:19,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:27:19,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:27:19,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:27:19,834 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 4 states. [2018-02-02 10:27:19,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:19,942 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-02-02 10:27:19,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:27:19,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:27:19,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:19,944 INFO L225 Difference]: With dead ends: 111 [2018-02-02 10:27:19,944 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 10:27:19,944 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:27:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 10:27:19,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-02-02 10:27:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 10:27:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-02-02 10:27:19,951 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 8 [2018-02-02 10:27:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:19,952 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-02-02 10:27:19,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:27:19,952 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-02-02 10:27:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:27:19,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:19,952 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:19,952 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:19,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556376, now seen corresponding path program 1 times [2018-02-02 10:27:19,953 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:19,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:20,005 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:27:20,006 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:20,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:27:20,006 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:20,006 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:27:20,007 INFO L182 omatonBuilderFactory]: Interpolants [567#true, 568#false, 569#(= 1 (select |#valid| main_~head~0.base)), 570#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:27:20,007 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:27:20,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:27:20,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:27:20,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:27:20,007 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 4 states. [2018-02-02 10:27:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:20,118 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-02-02 10:27:20,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:27:20,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 10:27:20,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:20,120 INFO L225 Difference]: With dead ends: 95 [2018-02-02 10:27:20,120 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 10:27:20,121 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:27:20,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 10:27:20,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-02-02 10:27:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:27:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-02-02 10:27:20,126 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 15 [2018-02-02 10:27:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:20,127 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-02-02 10:27:20,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:27:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-02-02 10:27:20,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:27:20,127 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:20,128 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:20,128 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:20,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556377, now seen corresponding path program 1 times [2018-02-02 10:27:20,129 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:20,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:20,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:20,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:27:20,202 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:20,202 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:27:20,202 INFO L182 omatonBuilderFactory]: Interpolants [756#true, 757#false, 758#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 759#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 760#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:27:20,203 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:27:20,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:27:20,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:27:20,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:27:20,204 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 5 states. [2018-02-02 10:27:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:20,323 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2018-02-02 10:27:20,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:27:20,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 10:27:20,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:20,324 INFO L225 Difference]: With dead ends: 113 [2018-02-02 10:27:20,324 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 10:27:20,324 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:27:20,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 10:27:20,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2018-02-02 10:27:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 10:27:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2018-02-02 10:27:20,328 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 15 [2018-02-02 10:27:20,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:20,328 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2018-02-02 10:27:20,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:27:20,328 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2018-02-02 10:27:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:27:20,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:20,329 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:27:20,329 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:20,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426684, now seen corresponding path program 1 times [2018-02-02 10:27:20,330 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:20,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:20,437 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:27:20,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:20,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:27:20,438 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:20,438 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:27:20,439 INFO L182 omatonBuilderFactory]: Interpolants [976#true, 977#false, 978#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|))), 979#(and (= 12 (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))), 980#(and (= (select |#length| |main_#t~mem7.base|) 12) (= |main_#t~mem7.offset| 0))] [2018-02-02 10:27:20,439 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:27:20,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:27:20,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:27:20,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:27:20,440 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 5 states. [2018-02-02 10:27:20,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:20,626 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-02-02 10:27:20,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:27:20,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:27:20,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:20,628 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:27:20,628 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:27:20,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:27:20,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:27:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 97. [2018-02-02 10:27:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 10:27:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-02-02 10:27:20,634 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 18 [2018-02-02 10:27:20,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:20,634 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-02-02 10:27:20,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:27:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-02-02 10:27:20,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:27:20,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:20,635 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:27:20,635 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:20,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426685, now seen corresponding path program 1 times [2018-02-02 10:27:20,635 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:20,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:20,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:27:20,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:20,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:27:20,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:20,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:27:20,663 INFO L182 omatonBuilderFactory]: Interpolants [1232#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 1233#(= 1 (select |#valid| |main_#t~mem7.base|)), 1229#true, 1230#false, 1231#(= 1 (select |#valid| |main_#t~malloc5.base|))] [2018-02-02 10:27:20,663 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:27:20,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:27:20,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:27:20,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:27:20,663 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 5 states. [2018-02-02 10:27:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:20,794 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-02-02 10:27:20,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:27:20,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:27:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:20,795 INFO L225 Difference]: With dead ends: 141 [2018-02-02 10:27:20,795 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 10:27:20,795 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:27:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 10:27:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2018-02-02 10:27:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 10:27:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-02-02 10:27:20,799 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 18 [2018-02-02 10:27:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:20,800 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-02-02 10:27:20,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:27:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-02-02 10:27:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:27:20,800 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:20,801 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] [2018-02-02 10:27:20,801 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:20,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867382, now seen corresponding path program 1 times [2018-02-02 10:27:20,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:20,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:20,977 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:27:20,977 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:20,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:27:20,977 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:20,978 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:27:20,978 INFO L182 omatonBuilderFactory]: Interpolants [1475#true, 1476#false, 1477#(= 0 |main_#t~malloc0.offset|), 1478#(= main_~head~0.offset 0), 1479#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 1480#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 1481#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1)), 1482#(= 1 (select |#valid| |main_#t~mem14.base|)), 1483#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:27:20,978 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:27:20,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:27:20,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:27:20,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:27:20,979 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 9 states. [2018-02-02 10:27:21,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:21,212 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-02-02 10:27:21,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:27:21,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 10:27:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:21,213 INFO L225 Difference]: With dead ends: 139 [2018-02-02 10:27:21,213 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 10:27:21,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:27:21,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 10:27:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 103. [2018-02-02 10:27:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 10:27:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-02-02 10:27:21,220 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 22 [2018-02-02 10:27:21,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:21,221 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-02-02 10:27:21,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:27:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-02-02 10:27:21,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:27:21,222 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:21,222 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] [2018-02-02 10:27:21,222 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:21,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867381, now seen corresponding path program 1 times [2018-02-02 10:27:21,223 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:21,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:21,378 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:27:21,378 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:21,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:27:21,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:21,379 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:27:21,379 INFO L182 omatonBuilderFactory]: Interpolants [1744#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 1745#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= 12 (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)), 1746#(and (= 12 (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))), 1747#(and (= 0 |main_#t~mem14.offset|) (= 12 (select |#length| |main_#t~mem14.base|))), 1748#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset)), 1740#true, 1741#false, 1742#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 1743#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0))] [2018-02-02 10:27:21,379 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:27:21,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:27:21,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:27:21,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:27:21,379 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 9 states. [2018-02-02 10:27:21,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:21,625 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2018-02-02 10:27:21,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:27:21,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 10:27:21,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:21,626 INFO L225 Difference]: With dead ends: 172 [2018-02-02 10:27:21,626 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 10:27:21,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 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:27:21,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 10:27:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 116. [2018-02-02 10:27:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 10:27:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-02-02 10:27:21,630 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 22 [2018-02-02 10:27:21,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:21,630 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-02-02 10:27:21,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:27:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-02-02 10:27:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:27:21,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:21,631 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] [2018-02-02 10:27:21,631 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:21,631 INFO L82 PathProgramCache]: Analyzing trace with hash 687906629, now seen corresponding path program 1 times [2018-02-02 10:27:21,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:21,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:21,711 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:27:21,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:21,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:27:21,712 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:21,712 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:27:21,712 INFO L182 omatonBuilderFactory]: Interpolants [2049#true, 2050#false, 2051#(= (select |#valid| main_~head~0.base) 1), 2052#(= (select |#valid| main_~x~0.base) 1), 2053#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 1 (select |#valid| |main_#t~malloc5.base|))), 2054#(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)))), 2055#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|))), 2056#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 2057#(= 1 (select |#valid| |main_#t~mem9.base|))] [2018-02-02 10:27:21,712 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:27:21,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:27:21,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:27:21,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:27:21,713 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 9 states. [2018-02-02 10:27:21,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:21,981 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-02-02 10:27:21,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:27:21,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 10:27:21,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:21,982 INFO L225 Difference]: With dead ends: 122 [2018-02-02 10:27:21,982 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 10:27:21,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:27:21,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 10:27:21,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2018-02-02 10:27:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 10:27:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2018-02-02 10:27:21,985 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 22 [2018-02-02 10:27:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:21,985 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2018-02-02 10:27:21,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:27:21,985 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-02-02 10:27:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:27:21,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:21,986 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] [2018-02-02 10:27:21,986 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:21,986 INFO L82 PathProgramCache]: Analyzing trace with hash 687906630, now seen corresponding path program 1 times [2018-02-02 10:27:21,987 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:21,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:22,095 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:27:22,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:22,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:27:22,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:22,096 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:27:22,096 INFO L182 omatonBuilderFactory]: Interpolants [2309#true, 2310#false, 2311#(= (select |#valid| main_~head~0.base) 1), 2312#(= (select |#valid| main_~x~0.base) 1), 2313#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 12 (select |#length| |main_#t~malloc5.base|))), 2314#(and (= 12 (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))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2315#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2316#(and (= 12 (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))), 2317#(and (= 0 |main_#t~mem9.offset|) (= 12 (select |#length| |main_#t~mem9.base|))), 2318#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:27:22,096 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:27:22,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:27:22,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:27:22,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:27:22,097 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 10 states. [2018-02-02 10:27:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:22,497 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2018-02-02 10:27:22,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:27:22,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 10:27:22,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:22,497 INFO L225 Difference]: With dead ends: 117 [2018-02-02 10:27:22,497 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 10:27:22,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:27:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 10:27:22,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2018-02-02 10:27:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 10:27:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-02-02 10:27:22,501 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 22 [2018-02-02 10:27:22,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:22,501 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-02-02 10:27:22,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:27:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-02-02 10:27:22,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:27:22,503 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:22,503 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:27:22,503 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:22,503 INFO L82 PathProgramCache]: Analyzing trace with hash 36223985, now seen corresponding path program 1 times [2018-02-02 10:27:22,504 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:22,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:22,647 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:27:22,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:22,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:27:22,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:22,647 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:27:22,647 INFO L182 omatonBuilderFactory]: Interpolants [2561#true, 2562#false, 2563#(= 0 |main_#t~malloc0.offset|), 2564#(= main_~head~0.offset 0), 2565#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 2566#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= 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))), 2567#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2568#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 2569#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 2570#(= 1 (select |#valid| |main_#t~mem16.base|))] [2018-02-02 10:27:22,647 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:27:22,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:27:22,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:27:22,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:27:22,648 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 10 states. [2018-02-02 10:27:22,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:22,880 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2018-02-02 10:27:22,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:27:22,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-02-02 10:27:22,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:22,882 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:27:22,882 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:27:22,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:27:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:27:22,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2018-02-02 10:27:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 10:27:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-02-02 10:27:22,884 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 26 [2018-02-02 10:27:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:22,884 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-02-02 10:27:22,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:27:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-02-02 10:27:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:27:22,884 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:22,884 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:27:22,884 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:22,885 INFO L82 PathProgramCache]: Analyzing trace with hash 36223986, now seen corresponding path program 1 times [2018-02-02 10:27:22,885 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:22,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:23,061 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:27:23,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:23,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:27:23,061 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:23,062 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:27:23,062 INFO L182 omatonBuilderFactory]: Interpolants [2836#true, 2837#false, 2838#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 2839#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 2840#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 2841#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (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) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 2842#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 2843#(and (= 12 (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))), 2844#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 10:27:23,062 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:27:23,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:27:23,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:27:23,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:27:23,062 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 9 states. [2018-02-02 10:27:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:23,284 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2018-02-02 10:27:23,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:27:23,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-02 10:27:23,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:23,285 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:27:23,285 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:27:23,285 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 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:27:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:27:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2018-02-02 10:27:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 10:27:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-02-02 10:27:23,286 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 26 [2018-02-02 10:27:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:23,287 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-02-02 10:27:23,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:27:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-02-02 10:27:23,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:27:23,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:23,287 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] [2018-02-02 10:27:23,287 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:23,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483890, now seen corresponding path program 1 times [2018-02-02 10:27:23,288 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:23,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:23,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:23,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:27:23,336 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:23,336 INFO L182 omatonBuilderFactory]: Interpolants [3120#true, 3121#false, 3122#(= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 3123#(= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 3124#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 3125#(= 1 (select |#valid| |main_#t~mem23.base|)), 3126#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:27:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:23,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:27:23,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:27:23,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:27:23,337 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 7 states. [2018-02-02 10:27:23,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:23,513 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2018-02-02 10:27:23,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:27:23,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 10:27:23,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:23,516 INFO L225 Difference]: With dead ends: 139 [2018-02-02 10:27:23,516 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 10:27:23,516 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:27:23,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 10:27:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 105. [2018-02-02 10:27:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 10:27:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-02-02 10:27:23,519 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 27 [2018-02-02 10:27:23,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:23,519 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-02-02 10:27:23,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:27:23,519 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-02-02 10:27:23,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:27:23,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:23,520 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] [2018-02-02 10:27:23,520 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:23,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483891, now seen corresponding path program 1 times [2018-02-02 10:27:23,521 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:23,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:23,771 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:27:23,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:23,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:27:23,772 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:23,772 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:27:23,772 INFO L182 omatonBuilderFactory]: Interpolants [3381#true, 3382#false, 3383#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 3384#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 3385#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 3386#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= 12 (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)), 3387#(and (= 12 (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))), 3388#(and (= 0 |main_#t~mem14.offset|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem14.offset|) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 3389#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 main_~x~0.offset)), 3390#(and (<= 0 |main_#t~mem23.offset|) (<= |main_#t~mem23.offset| 0) (= 12 (select |#length| |main_#t~mem23.base|))), 3391#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:27:23,772 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:27:23,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:27:23,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:27:23,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:27:23,773 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 11 states. [2018-02-02 10:27:24,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:24,104 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-02-02 10:27:24,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:27:24,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-02-02 10:27:24,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:24,105 INFO L225 Difference]: With dead ends: 165 [2018-02-02 10:27:24,105 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 10:27:24,105 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:27:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 10:27:24,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 130. [2018-02-02 10:27:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 10:27:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2018-02-02 10:27:24,109 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 27 [2018-02-02 10:27:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:24,109 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2018-02-02 10:27:24,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:27:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2018-02-02 10:27:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:27:24,110 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:24,110 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, 1] [2018-02-02 10:27:24,111 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:24,111 INFO L82 PathProgramCache]: Analyzing trace with hash -152260992, now seen corresponding path program 1 times [2018-02-02 10:27:24,112 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:24,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:24,386 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:27:24,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:24,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 10:27:24,387 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:24,387 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:27:24,387 INFO L182 omatonBuilderFactory]: Interpolants [3712#(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))), 3713#(and (= 0 |main_#t~mem14.offset|) (= |main_#t~mem14.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))), 3714#(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)), 3715#(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)))), 3716#(and (= (store |#valid| |main_#t~mem23.base| 0) |old(#valid)|) (not (= 0 |main_#t~mem23.base|))), 3717#(and (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|)), 3705#true, 3706#false, 3707#(= |#valid| |old(#valid)|), 3708#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (= 0 |main_#t~malloc0.offset|)), 3709#(and (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~head~0.offset 0)), 3710#(and (= (store |#valid| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset) 0) |old(#valid)|) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 3711#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= 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))] [2018-02-02 10:27:24,387 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:27:24,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:27:24,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:27:24,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:27:24,388 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand 13 states. [2018-02-02 10:27:24,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:24,906 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2018-02-02 10:27:24,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:27:24,907 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-02-02 10:27:24,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:24,907 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:27:24,907 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:27:24,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:27:24,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:27:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2018-02-02 10:27:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 10:27:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 153 transitions. [2018-02-02 10:27:24,910 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 153 transitions. Word has length 31 [2018-02-02 10:27:24,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:24,910 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 153 transitions. [2018-02-02 10:27:24,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:27:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2018-02-02 10:27:24,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:27:24,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:24,911 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, 1] [2018-02-02 10:27:24,911 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:24,912 INFO L82 PathProgramCache]: Analyzing trace with hash -771319912, now seen corresponding path program 1 times [2018-02-02 10:27:24,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:24,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:25,048 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:27:25,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:25,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:27:25,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:25,049 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:27:25,049 INFO L182 omatonBuilderFactory]: Interpolants [4021#true, 4022#false, 4023#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 4024#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 4025#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 4026#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (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) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 4027#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 4028#(and (= 12 (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))), 4029#(and (= |main_#t~mem18.offset| 0) (= (select |#length| |main_#t~mem18.base|) 12))] [2018-02-02 10:27:25,049 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:27:25,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:27:25,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:27:25,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:27:25,049 INFO L87 Difference]: Start difference. First operand 129 states and 153 transitions. Second operand 9 states. [2018-02-02 10:27:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:25,247 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2018-02-02 10:27:25,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:27:25,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-02 10:27:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:25,248 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:27:25,248 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 10:27:25,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:27:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 10:27:25,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 129. [2018-02-02 10:27:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 10:27:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2018-02-02 10:27:25,252 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2018-02-02 10:27:25,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:25,252 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2018-02-02 10:27:25,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:27:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2018-02-02 10:27:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:27:25,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:25,253 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, 1] [2018-02-02 10:27:25,253 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:25,253 INFO L82 PathProgramCache]: Analyzing trace with hash -771319913, now seen corresponding path program 1 times [2018-02-02 10:27:25,253 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:25,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:25,369 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:27:25,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:25,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:27:25,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:25,369 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:27:25,369 INFO L182 omatonBuilderFactory]: Interpolants [4326#true, 4327#false, 4328#(= 0 |main_#t~malloc0.offset|), 4329#(= main_~head~0.offset 0), 4330#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 4331#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= 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))), 4332#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4333#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 4334#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4335#(= 1 (select |#valid| |main_#t~mem18.base|))] [2018-02-02 10:27:25,370 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:27:25,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:27:25,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:27:25,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:27:25,370 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 10 states. [2018-02-02 10:27:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:25,586 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2018-02-02 10:27:25,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:27:25,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-02 10:27:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:25,587 INFO L225 Difference]: With dead ends: 147 [2018-02-02 10:27:25,587 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:27:25,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:27:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:27:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2018-02-02 10:27:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 10:27:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2018-02-02 10:27:25,589 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 31 [2018-02-02 10:27:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:25,590 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2018-02-02 10:27:25,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:27:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2018-02-02 10:27:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:27:25,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:25,590 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:27:25,590 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:25,590 INFO L82 PathProgramCache]: Analyzing trace with hash -246205034, now seen corresponding path program 1 times [2018-02-02 10:27:25,595 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:25,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:25,774 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:27:25,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:25,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:27:25,775 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:25,775 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:27:25,775 INFO L182 omatonBuilderFactory]: Interpolants [4640#(= 0 |main_#t~mem24|), 4628#true, 4629#false, 4630#(= 0 |main_#t~malloc0.offset|), 4631#(= main_~head~0.offset 0), 4632#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 4633#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= 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)), 4634#(and (= 0 |main_#t~mem14.offset|) (= |main_#t~mem14.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))), 4635#(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))), 4636#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) |main_#t~mem15|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4637#(and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4638#(and (= 0 |main_#t~mem23.offset|) (= 0 (select (select |#memory_int| |main_#t~mem23.base|) (+ 0 8)))), 4639#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))] [2018-02-02 10:27:25,775 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:27:25,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:27:25,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:27:25,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:27:25,776 INFO L87 Difference]: Start difference. First operand 129 states and 151 transitions. Second operand 13 states. [2018-02-02 10:27:26,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:26,044 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2018-02-02 10:27:26,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:27:26,044 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-02-02 10:27:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:26,045 INFO L225 Difference]: With dead ends: 147 [2018-02-02 10:27:26,045 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 10:27:26,045 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:27:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 10:27:26,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-02-02 10:27:26,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 10:27:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-02-02 10:27:26,047 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 33 [2018-02-02 10:27:26,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:26,048 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-02-02 10:27:26,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:27:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-02-02 10:27:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:27:26,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:26,048 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, 1] [2018-02-02 10:27:26,049 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:26,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1646590979, now seen corresponding path program 1 times [2018-02-02 10:27:26,049 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:26,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:26,158 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:27:26,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:26,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:27:26,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:26,159 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:27:26,159 INFO L182 omatonBuilderFactory]: Interpolants [4944#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 4945#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4946#(= 1 (select |#valid| |main_#t~mem22.base|)), 4947#(= 1 (select |#valid| main_~x~0.base)), 4937#true, 4938#false, 4939#(= 0 |main_#t~malloc0.offset|), 4940#(= main_~head~0.offset 0), 4941#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 4942#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= 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))), 4943#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:27:26,159 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:27:26,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:27:26,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:27:26,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:27:26,160 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 11 states. [2018-02-02 10:27:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:26,468 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2018-02-02 10:27:26,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:27:26,469 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-02-02 10:27:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:26,469 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:27:26,469 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:27:26,470 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:27:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:27:26,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2018-02-02 10:27:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 10:27:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2018-02-02 10:27:26,472 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 34 [2018-02-02 10:27:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:26,472 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2018-02-02 10:27:26,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:27:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2018-02-02 10:27:26,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:27:26,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:26,473 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, 1] [2018-02-02 10:27:26,473 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:26,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1646590978, now seen corresponding path program 1 times [2018-02-02 10:27:26,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:26,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:26,612 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:27:26,613 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:26,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:27:26,613 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:26,613 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:27:26,613 INFO L182 omatonBuilderFactory]: Interpolants [5248#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 5249#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 5250#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (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) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 5251#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 5252#(and (= 12 (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))), 5253#(and (= 12 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 5254#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 5245#true, 5246#false, 5247#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|)))] [2018-02-02 10:27:26,613 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:27:26,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:27:26,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:27:26,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:27:26,614 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 10 states. [2018-02-02 10:27:26,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:26,927 INFO L93 Difference]: Finished difference Result 176 states and 188 transitions. [2018-02-02 10:27:26,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:27:26,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 10:27:26,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:26,928 INFO L225 Difference]: With dead ends: 176 [2018-02-02 10:27:26,928 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 10:27:26,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 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:27:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 10:27:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2018-02-02 10:27:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:27:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 172 transitions. [2018-02-02 10:27:26,930 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 172 transitions. Word has length 34 [2018-02-02 10:27:26,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:26,930 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 172 transitions. [2018-02-02 10:27:26,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:27:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 172 transitions. [2018-02-02 10:27:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:27:26,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:26,931 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, 1, 1, 1, 1] [2018-02-02 10:27:26,931 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:26,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1352500762, now seen corresponding path program 1 times [2018-02-02 10:27:26,931 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:26,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:26,947 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:27:26,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:26,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:27:26,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:26,948 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:27:26,948 INFO L182 omatonBuilderFactory]: Interpolants [5594#true, 5595#false, 5596#(= main_~state~0 1)] [2018-02-02 10:27:26,948 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:27:26,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:27:26,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:27:26,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:27:26,948 INFO L87 Difference]: Start difference. First operand 145 states and 172 transitions. Second operand 3 states. [2018-02-02 10:27:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:26,956 INFO L93 Difference]: Finished difference Result 214 states and 246 transitions. [2018-02-02 10:27:26,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:27:26,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-02-02 10:27:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:26,958 INFO L225 Difference]: With dead ends: 214 [2018-02-02 10:27:26,958 INFO L226 Difference]: Without dead ends: 214 [2018-02-02 10:27:26,958 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:27:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-02 10:27:26,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 163. [2018-02-02 10:27:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:27:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2018-02-02 10:27:26,962 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 34 [2018-02-02 10:27:26,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:26,962 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2018-02-02 10:27:26,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:27:26,962 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2018-02-02 10:27:26,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:27:26,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:26,963 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] [2018-02-02 10:27:26,963 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:26,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1891146596, now seen corresponding path program 1 times [2018-02-02 10:27:26,963 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:26,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:27,098 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:27:27,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:27,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:27:27,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:27,099 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:27:27,099 INFO L182 omatonBuilderFactory]: Interpolants [5984#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5985#(= 1 (select |#valid| |main_#t~mem16.base|)), 5974#true, 5975#false, 5976#(= 0 |main_#t~malloc0.offset|), 5977#(= main_~head~0.offset 0), 5978#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 5979#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= 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))), 5980#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5981#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))), 5982#(= 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)))), 5983#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))] [2018-02-02 10:27:27,099 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:27:27,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:27:27,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:27:27,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:27:27,100 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand 12 states. [2018-02-02 10:27:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:27,479 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2018-02-02 10:27:27,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:27:27,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-02-02 10:27:27,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:27,481 INFO L225 Difference]: With dead ends: 181 [2018-02-02 10:27:27,481 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 10:27:27,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:27:27,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 10:27:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2018-02-02 10:27:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:27:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 191 transitions. [2018-02-02 10:27:27,483 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 191 transitions. Word has length 38 [2018-02-02 10:27:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:27,484 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 191 transitions. [2018-02-02 10:27:27,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:27:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 191 transitions. [2018-02-02 10:27:27,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:27:27,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:27,484 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] [2018-02-02 10:27:27,484 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:27,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1891146597, now seen corresponding path program 1 times [2018-02-02 10:27:27,484 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:27,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:27,624 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:27:27,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:27,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:27:27,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:27,624 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:27:27,625 INFO L182 omatonBuilderFactory]: Interpolants [6354#true, 6355#false, 6356#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 6357#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 6358#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 6359#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (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) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 6360#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))))), 6361#(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))) (= 12 (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))))), 6362#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 6363#(and (= 12 (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))), 6364#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 10:27:27,625 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:27:27,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:27:27,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:27:27,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:27:27,625 INFO L87 Difference]: Start difference. First operand 163 states and 191 transitions. Second operand 11 states. [2018-02-02 10:27:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:27,946 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2018-02-02 10:27:27,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:27:27,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-02 10:27:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:27,947 INFO L225 Difference]: With dead ends: 187 [2018-02-02 10:27:27,947 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 10:27:27,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:27:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 10:27:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 163. [2018-02-02 10:27:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:27:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 190 transitions. [2018-02-02 10:27:27,950 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 190 transitions. Word has length 38 [2018-02-02 10:27:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:27,950 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 190 transitions. [2018-02-02 10:27:27,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:27:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 190 transitions. [2018-02-02 10:27:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:27:27,950 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:27,950 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:27:27,950 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:27,951 INFO L82 PathProgramCache]: Analyzing trace with hash 102012898, now seen corresponding path program 1 times [2018-02-02 10:27:27,951 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:27,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:28,093 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:27:28,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:28,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:27:28,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:28,094 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:27:28,094 INFO L182 omatonBuilderFactory]: Interpolants [6736#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 6737#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 6738#(and (= 1 (select |#valid| (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_~x~0.base main_~head~0.base)), 6739#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 6740#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 6741#(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))), 6742#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 6743#(= 1 (select |#valid| |main_#t~mem14.base|)), 6744#(= 1 (select |#valid| main_~x~0.base)), 6733#true, 6734#false, 6735#(= (select |#valid| main_~head~0.base) 1)] [2018-02-02 10:27:28,094 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:27:28,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:27:28,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:27:28,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:27:28,095 INFO L87 Difference]: Start difference. First operand 163 states and 190 transitions. Second operand 12 states. [2018-02-02 10:27:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:28,485 INFO L93 Difference]: Finished difference Result 261 states and 298 transitions. [2018-02-02 10:27:28,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:27:28,486 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-02-02 10:27:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:28,487 INFO L225 Difference]: With dead ends: 261 [2018-02-02 10:27:28,487 INFO L226 Difference]: Without dead ends: 261 [2018-02-02 10:27:28,487 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:27:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-02 10:27:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 196. [2018-02-02 10:27:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 10:27:28,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 227 transitions. [2018-02-02 10:27:28,491 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 227 transitions. Word has length 39 [2018-02-02 10:27:28,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:28,492 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 227 transitions. [2018-02-02 10:27:28,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:27:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 227 transitions. [2018-02-02 10:27:28,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:27:28,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:28,492 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:27:28,492 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:28,492 INFO L82 PathProgramCache]: Analyzing trace with hash 102012899, now seen corresponding path program 1 times [2018-02-02 10:27:28,493 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:28,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:27:28,741 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:27:28,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:28,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:27:28,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:28,742 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:27:28,742 INFO L182 omatonBuilderFactory]: Interpolants [7232#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 7233#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 7234#(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)) (= 12 (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)))), 7235#(and (= 12 (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))), 7236#(and (= 0 |main_#t~mem14.offset|) (= 12 (select |#length| |main_#t~mem14.base|))), 7237#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset)), 7226#true, 7227#false, 7228#(= (select |#valid| main_~head~0.base) 1), 7229#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 7230#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 7231#(and (= 12 (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))] [2018-02-02 10:27:28,743 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:27:28,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:27:28,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:27:28,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:27:28,743 INFO L87 Difference]: Start difference. First operand 196 states and 227 transitions. Second operand 12 states. [2018-02-02 10:27:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:29,265 INFO L93 Difference]: Finished difference Result 265 states and 299 transitions. [2018-02-02 10:27:29,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:27:29,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-02-02 10:27:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:29,266 INFO L225 Difference]: With dead ends: 265 [2018-02-02 10:27:29,266 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 10:27:29,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:27:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 10:27:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 209. [2018-02-02 10:27:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 10:27:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 245 transitions. [2018-02-02 10:27:29,270 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 245 transitions. Word has length 39 [2018-02-02 10:27:29,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:29,270 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 245 transitions. [2018-02-02 10:27:29,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:27:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 245 transitions. [2018-02-02 10:27:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:27:29,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:29,271 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] [2018-02-02 10:27:29,271 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:29,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1908893701, now seen corresponding path program 1 times [2018-02-02 10:27:29,272 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:29,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:29,504 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:27:29,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:29,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:27:29,505 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:29,505 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:27:29,505 INFO L182 omatonBuilderFactory]: Interpolants [7728#true, 7729#false, 7730#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 7731#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 7732#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 7733#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (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) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 7734#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))))), 7735#(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))) (= 12 (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))))), 7736#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 7737#(and (= 12 (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))), 7738#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0)), 7739#(and (<= |main_#t~mem18.offset| 0) (<= 0 |main_#t~mem18.offset|) (= (select |#length| |main_#t~mem18.base|) 12))] [2018-02-02 10:27:29,505 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:27:29,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:27:29,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:27:29,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:27:29,506 INFO L87 Difference]: Start difference. First operand 209 states and 245 transitions. Second operand 12 states. [2018-02-02 10:27:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:30,060 INFO L93 Difference]: Finished difference Result 231 states and 254 transitions. [2018-02-02 10:27:30,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:27:30,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-02-02 10:27:30,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:30,061 INFO L225 Difference]: With dead ends: 231 [2018-02-02 10:27:30,061 INFO L226 Difference]: Without dead ends: 231 [2018-02-02 10:27:30,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:27:30,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-02 10:27:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 209. [2018-02-02 10:27:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 10:27:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 244 transitions. [2018-02-02 10:27:30,065 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 244 transitions. Word has length 43 [2018-02-02 10:27:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:30,065 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 244 transitions. [2018-02-02 10:27:30,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:27:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 244 transitions. [2018-02-02 10:27:30,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:27:30,066 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:30,066 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] [2018-02-02 10:27:30,066 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:30,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1908893700, now seen corresponding path program 1 times [2018-02-02 10:27:30,067 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:30,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:30,094 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:27:30,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:30,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:27:30,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:30,095 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:27:30,095 INFO L182 omatonBuilderFactory]: Interpolants [8200#true, 8201#false, 8202#(= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 8203#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8204#(= 1 (select |#valid| |main_#t~mem18.base|))] [2018-02-02 10:27:30,095 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:27:30,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:27:30,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:27:30,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:27:30,096 INFO L87 Difference]: Start difference. First operand 209 states and 244 transitions. Second operand 5 states. [2018-02-02 10:27:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:30,222 INFO L93 Difference]: Finished difference Result 213 states and 245 transitions. [2018-02-02 10:27:30,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:27:30,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-02-02 10:27:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:30,224 INFO L225 Difference]: With dead ends: 213 [2018-02-02 10:27:30,224 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 10:27:30,225 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:27:30,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 10:27:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 208. [2018-02-02 10:27:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:27:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 240 transitions. [2018-02-02 10:27:30,229 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 240 transitions. Word has length 43 [2018-02-02 10:27:30,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:30,230 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 240 transitions. [2018-02-02 10:27:30,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:27:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 240 transitions. [2018-02-02 10:27:30,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:27:30,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:30,230 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] [2018-02-02 10:27:30,230 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:30,231 INFO L82 PathProgramCache]: Analyzing trace with hash 948679881, now seen corresponding path program 1 times [2018-02-02 10:27:30,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:30,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:30,483 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:27:30,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:30,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:27:30,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:30,483 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:27:30,483 INFO L182 omatonBuilderFactory]: Interpolants [8640#(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))), 8641#(= 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))), 8642#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 8643#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8644#(= 1 (select |#valid| |main_#t~mem16.base|)), 8631#true, 8632#false, 8633#(= (select |#valid| main_~head~0.base) 1), 8634#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8635#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 8636#(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)), 8637#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 8638#(and (= |main_#t~mem9.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~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|))), 8639#(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:27:30,483 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:27:30,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:27:30,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:27:30,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:27:30,484 INFO L87 Difference]: Start difference. First operand 208 states and 240 transitions. Second operand 14 states. [2018-02-02 10:27:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:30,892 INFO L93 Difference]: Finished difference Result 267 states and 298 transitions. [2018-02-02 10:27:30,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:27:30,892 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-02-02 10:27:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:30,893 INFO L225 Difference]: With dead ends: 267 [2018-02-02 10:27:30,893 INFO L226 Difference]: Without dead ends: 267 [2018-02-02 10:27:30,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:27:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-02 10:27:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 208. [2018-02-02 10:27:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:27:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 239 transitions. [2018-02-02 10:27:30,896 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 239 transitions. Word has length 43 [2018-02-02 10:27:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:30,896 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 239 transitions. [2018-02-02 10:27:30,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:27:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 239 transitions. [2018-02-02 10:27:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:27:30,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:30,897 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] [2018-02-02 10:27:30,897 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:30,897 INFO L82 PathProgramCache]: Analyzing trace with hash 948679882, now seen corresponding path program 1 times [2018-02-02 10:27:30,897 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:30,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:31,168 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:27:31,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:31,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:27:31,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:31,169 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:27:31,169 INFO L182 omatonBuilderFactory]: Interpolants [9152#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 9153#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (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)), 9154#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 9155#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= |main_#t~mem9.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~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|))), 9156#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 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))), 9157#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (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)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 9158#(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))) (= 12 (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))))), 9159#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 9160#(and (= 12 (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))), 9161#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12)), 9146#true, 9147#false, 9148#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 9149#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 9150#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 9151#(and (= 0 main_~head~0.offset) (= 12 (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:27:31,169 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:27:31,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:27:31,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:27:31,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:27:31,170 INFO L87 Difference]: Start difference. First operand 208 states and 239 transitions. Second operand 16 states. [2018-02-02 10:27:31,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:31,860 INFO L93 Difference]: Finished difference Result 269 states and 299 transitions. [2018-02-02 10:27:31,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:27:31,860 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-02-02 10:27:31,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:31,861 INFO L225 Difference]: With dead ends: 269 [2018-02-02 10:27:31,861 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 10:27:31,861 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:27:31,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 10:27:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 208. [2018-02-02 10:27:31,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:27:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 238 transitions. [2018-02-02 10:27:31,867 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 238 transitions. Word has length 43 [2018-02-02 10:27:31,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:31,867 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 238 transitions. [2018-02-02 10:27:31,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:27:31,867 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 238 transitions. [2018-02-02 10:27:31,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:27:31,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:31,868 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:27:31,868 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:31,868 INFO L82 PathProgramCache]: Analyzing trace with hash -656154405, now seen corresponding path program 1 times [2018-02-02 10:27:31,869 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:31,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:32,044 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:27:32,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:32,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:27:32,044 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:32,045 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:27:32,045 INFO L182 omatonBuilderFactory]: Interpolants [9669#true, 9670#false, 9671#(= (select |#valid| main_~head~0.base) 1), 9672#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 9673#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 9674#(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)), 9675#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 9676#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9677#(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))), 9678#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 9679#(and (= |main_#t~mem14.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~mem14.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9680#(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)), 9681#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 9682#(and (<= 0 |main_#t~mem23.offset|) (<= (+ |main_#t~mem23.offset| 12) (select |#length| |main_#t~mem23.base|))), 9683#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 10:27:32,045 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:27:32,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:27:32,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:27:32,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:27:32,045 INFO L87 Difference]: Start difference. First operand 208 states and 238 transitions. Second operand 15 states. [2018-02-02 10:27:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:32,507 INFO L93 Difference]: Finished difference Result 261 states and 292 transitions. [2018-02-02 10:27:32,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:27:32,507 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-02 10:27:32,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:32,508 INFO L225 Difference]: With dead ends: 261 [2018-02-02 10:27:32,508 INFO L226 Difference]: Without dead ends: 261 [2018-02-02 10:27:32,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:27:32,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-02 10:27:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 230. [2018-02-02 10:27:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 10:27:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 272 transitions. [2018-02-02 10:27:32,510 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 272 transitions. Word has length 44 [2018-02-02 10:27:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:32,511 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 272 transitions. [2018-02-02 10:27:32,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:27:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 272 transitions. [2018-02-02 10:27:32,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:27:32,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:32,511 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] [2018-02-02 10:27:32,511 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:32,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1541300541, now seen corresponding path program 1 times [2018-02-02 10:27:32,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:32,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:32,855 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:27:32,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:32,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:27:32,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:32,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:27:32,856 INFO L182 omatonBuilderFactory]: Interpolants [10208#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= 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))), 10209#(and (= main_~head~0.base |main_#t~mem14.base|) (= main_~head~0.offset |main_#t~mem14.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) |main_#t~mem14.offset|) |main_#t~mem14.base|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10210#(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))), 10211#(and (= |main_#t~mem15| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= 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))), 10212#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= 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))), 10213#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset |main_#t~mem16.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)), 10214#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~x~0.offset 8)) |main_#t~mem17|) (= 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)), 10215#(and (= main_~head~0.offset main_~x~0.offset) (not |main_#t~short21|) (= main_~head~0.offset 0)), 10203#true, 10204#false, 10205#(= 0 |main_#t~malloc0.offset|), 10206#(= main_~head~0.offset 0), 10207#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0))] [2018-02-02 10:27:32,856 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:27:32,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:27:32,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:27:32,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:27:32,857 INFO L87 Difference]: Start difference. First operand 230 states and 272 transitions. Second operand 13 states. [2018-02-02 10:27:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:33,135 INFO L93 Difference]: Finished difference Result 239 states and 271 transitions. [2018-02-02 10:27:33,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:27:33,135 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-02-02 10:27:33,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:33,136 INFO L225 Difference]: With dead ends: 239 [2018-02-02 10:27:33,136 INFO L226 Difference]: Without dead ends: 239 [2018-02-02 10:27:33,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:27:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-02 10:27:33,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 230. [2018-02-02 10:27:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 10:27:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 271 transitions. [2018-02-02 10:27:33,138 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 271 transitions. Word has length 45 [2018-02-02 10:27:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:33,138 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 271 transitions. [2018-02-02 10:27:33,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:27:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 271 transitions. [2018-02-02 10:27:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:27:33,139 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:33,139 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, 1] [2018-02-02 10:27:33,139 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:33,139 INFO L82 PathProgramCache]: Analyzing trace with hash 795813223, now seen corresponding path program 1 times [2018-02-02 10:27:33,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:33,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:33,454 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:27:33,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:33,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:27:33,455 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:33,455 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:27:33,456 INFO L182 omatonBuilderFactory]: Interpolants [10703#true, 10704#false, 10705#(= (select |#valid| main_~head~0.base) 1), 10706#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 10707#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 10708#(and (= 12 (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)), 10709#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 10710#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10711#(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)) (= 12 (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)))), 10712#(and (= 12 (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))), 10713#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (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))), 10714#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.offset 0)), 10715#(and (= 12 (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))), 10716#(and (<= 0 |main_#t~mem23.offset|) (= 12 (select |#length| |main_#t~mem23.base|))), 10717#(and (<= 0 main_~x~0.offset) (= (select |#length| main_~x~0.base) 12)), 10718#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset))] [2018-02-02 10:27:33,456 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:27:33,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:27:33,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:27:33,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:27:33,456 INFO L87 Difference]: Start difference. First operand 230 states and 271 transitions. Second operand 16 states. [2018-02-02 10:27:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:33,986 INFO L93 Difference]: Finished difference Result 260 states and 290 transitions. [2018-02-02 10:27:33,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:27:33,986 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 10:27:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:33,987 INFO L225 Difference]: With dead ends: 260 [2018-02-02 10:27:33,987 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 10:27:33,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:27:33,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 10:27:33,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 231. [2018-02-02 10:27:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:27:33,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 272 transitions. [2018-02-02 10:27:33,991 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 272 transitions. Word has length 46 [2018-02-02 10:27:33,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:33,991 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 272 transitions. [2018-02-02 10:27:33,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:27:33,991 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 272 transitions. [2018-02-02 10:27:33,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:27:33,992 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:33,992 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, 1, 1, 1] [2018-02-02 10:27:33,992 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:33,992 INFO L82 PathProgramCache]: Analyzing trace with hash 272333992, now seen corresponding path program 1 times [2018-02-02 10:27:33,993 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:34,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:34,347 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:27:34,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:34,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:27:34,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:34,348 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:27:34,348 INFO L182 omatonBuilderFactory]: Interpolants [11238#true, 11239#false, 11240#(= 0 |main_#t~malloc0.offset|), 11241#(= main_~head~0.offset 0), 11242#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 11243#(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)), 11244#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 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)), 11245#(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)), 11246#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~state~0 1) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 11247#(and (= 0 |main_#t~mem9.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~state~0 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11248#(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)), 11249#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11250#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) 1) (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem14.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))), 11251#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~x~0.offset 8)) 1) (= 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)), 11252#(and (= |main_#t~mem15| 1) (= main_~head~0.offset 0))] [2018-02-02 10:27:34,348 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:27:34,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:27:34,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:27:34,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:27:34,349 INFO L87 Difference]: Start difference. First operand 231 states and 272 transitions. Second operand 15 states. [2018-02-02 10:27:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:34,810 INFO L93 Difference]: Finished difference Result 299 states and 343 transitions. [2018-02-02 10:27:34,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:27:34,810 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-02-02 10:27:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:34,811 INFO L225 Difference]: With dead ends: 299 [2018-02-02 10:27:34,811 INFO L226 Difference]: Without dead ends: 299 [2018-02-02 10:27:34,812 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:27:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-02 10:27:34,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 240. [2018-02-02 10:27:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 10:27:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 281 transitions. [2018-02-02 10:27:34,815 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 281 transitions. Word has length 48 [2018-02-02 10:27:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:34,815 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 281 transitions. [2018-02-02 10:27:34,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:27:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 281 transitions. [2018-02-02 10:27:34,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:27:34,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:34,816 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, 1, 1, 1] [2018-02-02 10:27:34,816 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:34,816 INFO L82 PathProgramCache]: Analyzing trace with hash -346724928, now seen corresponding path program 1 times [2018-02-02 10:27:34,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:34,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:35,110 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:27:35,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:35,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:27:35,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:35,111 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:27:35,111 INFO L182 omatonBuilderFactory]: Interpolants [11818#true, 11819#false, 11820#(= 0 |main_#t~malloc0.offset|), 11821#(= 0 main_~head~0.offset), 11822#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 11823#(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)), 11824#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 11825#(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)), 11826#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 11827#(and (= 0 main_~head~0.offset) (= |main_#t~mem9.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~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|))), 11828#(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))), 11829#(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))), 11830#(= 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))), 11831#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)), 11832#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 11833#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 11834#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 11835#(and (<= 0 |main_#t~mem18.offset|) (<= (+ |main_#t~mem18.offset| 12) (select |#length| |main_#t~mem18.base|)))] [2018-02-02 10:27:35,111 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:27:35,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:27:35,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:27:35,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:27:35,112 INFO L87 Difference]: Start difference. First operand 240 states and 281 transitions. Second operand 18 states. [2018-02-02 10:27:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:35,739 INFO L93 Difference]: Finished difference Result 274 states and 304 transitions. [2018-02-02 10:27:35,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:27:35,739 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-02 10:27:35,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:35,740 INFO L225 Difference]: With dead ends: 274 [2018-02-02 10:27:35,740 INFO L226 Difference]: Without dead ends: 274 [2018-02-02 10:27:35,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:27:35,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-02 10:27:35,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 240. [2018-02-02 10:27:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 10:27:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 280 transitions. [2018-02-02 10:27:35,742 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 280 transitions. Word has length 48 [2018-02-02 10:27:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:35,742 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 280 transitions. [2018-02-02 10:27:35,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:27:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2018-02-02 10:27:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:27:35,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:35,743 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, 1] [2018-02-02 10:27:35,743 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:35,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1817072699, now seen corresponding path program 1 times [2018-02-02 10:27:35,744 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:35,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:36,040 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:27:36,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:36,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:27:36,040 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:36,040 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:27:36,040 INFO L182 omatonBuilderFactory]: Interpolants [12386#true, 12387#false, 12388#(= 0 |main_#t~malloc0.offset|), 12389#(= main_~head~0.offset 0), 12390#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 12391#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= 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))), 12392#(and (= main_~head~0.base |main_#t~mem14.base|) (= main_~head~0.offset |main_#t~mem14.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) |main_#t~mem14.offset|) |main_#t~mem14.base|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12393#(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))), 12394#(and (= |main_#t~mem15| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= 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))), 12395#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= 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))), 12396#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem22.offset|) (not (= 0 (select (select |#memory_int| |main_#t~mem22.base|) (+ main_~head~0.offset 8)))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12397#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 12398#(and (= main_~head~0.offset 0) (not (= 0 |main_#t~mem15|)))] [2018-02-02 10:27:36,040 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:27:36,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:27:36,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:27:36,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:27:36,041 INFO L87 Difference]: Start difference. First operand 240 states and 280 transitions. Second operand 13 states. [2018-02-02 10:27:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:36,239 INFO L93 Difference]: Finished difference Result 250 states and 280 transitions. [2018-02-02 10:27:36,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:27:36,239 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-02-02 10:27:36,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:36,240 INFO L225 Difference]: With dead ends: 250 [2018-02-02 10:27:36,240 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 10:27:36,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 6 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:27:36,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 10:27:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 240. [2018-02-02 10:27:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 10:27:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 279 transitions. [2018-02-02 10:27:36,243 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 279 transitions. Word has length 49 [2018-02-02 10:27:36,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:36,243 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 279 transitions. [2018-02-02 10:27:36,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:27:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 279 transitions. [2018-02-02 10:27:36,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:27:36,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:36,243 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, 1, 1, 1, 1] [2018-02-02 10:27:36,243 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:36,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1609972004, now seen corresponding path program 1 times [2018-02-02 10:27:36,244 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:36,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:27:36,656 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:27:36,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:36,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:27:36,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:36,657 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:27:36,657 INFO L182 omatonBuilderFactory]: Interpolants [12907#true, 12908#false, 12909#(= 0 |main_#t~malloc0.offset|), 12910#(= main_~head~0.offset 0), 12911#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 12912#(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)), 12913#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 12914#(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)), 12915#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 12916#(and (= 0 |main_#t~mem9.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12917#(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) (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)), 12918#(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))), 12919#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) 0)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12920#(and (= |main_#t~mem14.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 8)) 0)) (= |main_#t~mem14.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))), 12921#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~x~0.offset 8)) 0)) (= 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)), 12922#(and (not (= |main_#t~mem15| 0)) (= main_~head~0.offset 0))] [2018-02-02 10:27:36,657 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:27:36,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:27:36,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:27:36,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:27:36,658 INFO L87 Difference]: Start difference. First operand 240 states and 279 transitions. Second operand 16 states. [2018-02-02 10:27:37,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:37,169 INFO L93 Difference]: Finished difference Result 305 states and 346 transitions. [2018-02-02 10:27:37,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:27:37,169 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-02-02 10:27:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:37,170 INFO L225 Difference]: With dead ends: 305 [2018-02-02 10:27:37,170 INFO L226 Difference]: Without dead ends: 305 [2018-02-02 10:27:37,170 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:27:37,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-02 10:27:37,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 231. [2018-02-02 10:27:37,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:27:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 269 transitions. [2018-02-02 10:27:37,172 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 269 transitions. Word has length 49 [2018-02-02 10:27:37,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:37,172 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 269 transitions. [2018-02-02 10:27:37,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:27:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 269 transitions. [2018-02-02 10:27:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:27:37,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:37,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, 1] [2018-02-02 10:27:37,173 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:37,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2109490696, now seen corresponding path program 1 times [2018-02-02 10:27:37,173 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:37,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:27:37,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:37,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:27:37,202 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:37,202 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:27:37,202 INFO L182 omatonBuilderFactory]: Interpolants [13488#false, 13489#(= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 13490#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 13491#(= 1 (select |#valid| |main_#t~mem22.base|)), 13492#(= 1 (select |#valid| main_~x~0.base)), 13487#true] [2018-02-02 10:27:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:27:37,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:27:37,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:27:37,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:27:37,203 INFO L87 Difference]: Start difference. First operand 231 states and 269 transitions. Second operand 6 states. [2018-02-02 10:27:37,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:37,287 INFO L93 Difference]: Finished difference Result 234 states and 270 transitions. [2018-02-02 10:27:37,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:27:37,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-02-02 10:27:37,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:37,288 INFO L225 Difference]: With dead ends: 234 [2018-02-02 10:27:37,288 INFO L226 Difference]: Without dead ends: 234 [2018-02-02 10:27:37,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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:27:37,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-02 10:27:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-02-02 10:27:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-02 10:27:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 270 transitions. [2018-02-02 10:27:37,291 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 270 transitions. Word has length 50 [2018-02-02 10:27:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:37,291 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 270 transitions. [2018-02-02 10:27:37,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:27:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 270 transitions. [2018-02-02 10:27:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:27:37,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:37,292 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, 1] [2018-02-02 10:27:37,292 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:37,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2109490695, now seen corresponding path program 1 times [2018-02-02 10:27:37,293 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:37,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:37,473 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:27:37,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:37,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:27:37,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:37,473 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:27:37,473 INFO L182 omatonBuilderFactory]: Interpolants [13971#true, 13972#false, 13973#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 13974#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 13975#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 13976#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (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) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 13977#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))))), 13978#(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))) (= 12 (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))))), 13979#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 13980#(and (= 12 (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))), 13981#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0)), 13982#(and (= 12 (select |#length| |main_#t~mem22.base|)) (<= 0 |main_#t~mem22.offset|) (<= |main_#t~mem22.offset| 0)), 13983#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:27:37,473 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:27:37,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:27:37,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:27:37,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:27:37,474 INFO L87 Difference]: Start difference. First operand 233 states and 270 transitions. Second operand 13 states. [2018-02-02 10:27:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:37,911 INFO L93 Difference]: Finished difference Result 270 states and 300 transitions. [2018-02-02 10:27:37,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:27:37,911 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-02-02 10:27:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:37,912 INFO L225 Difference]: With dead ends: 270 [2018-02-02 10:27:37,912 INFO L226 Difference]: Without dead ends: 270 [2018-02-02 10:27:37,912 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:27:37,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-02 10:27:37,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 249. [2018-02-02 10:27:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-02 10:27:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 291 transitions. [2018-02-02 10:27:37,914 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 291 transitions. Word has length 50 [2018-02-02 10:27:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:37,914 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 291 transitions. [2018-02-02 10:27:37,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:27:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 291 transitions. [2018-02-02 10:27:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:27:37,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:37,915 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, 1, 1, 1] [2018-02-02 10:27:37,915 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:37,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1216109354, now seen corresponding path program 1 times [2018-02-02 10:27:37,915 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:37,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:38,114 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:27:38,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:38,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:27:38,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:38,114 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:27:38,115 INFO L182 omatonBuilderFactory]: Interpolants [14528#false, 14529#(= 0 |main_#t~malloc0.offset|), 14530#(= 0 main_~head~0.offset), 14531#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 14532#(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)), 14533#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 14534#(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)), 14535#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 14536#(and (= 0 main_~head~0.offset) (= |main_#t~mem9.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~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|))), 14537#(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))), 14538#(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))), 14539#(= 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))), 14540#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)), 14541#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 14542#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 14543#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 14544#(and (<= 0 |main_#t~mem22.offset|) (<= (+ |main_#t~mem22.offset| 12) (select |#length| |main_#t~mem22.base|))), 14545#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 14527#true] [2018-02-02 10:27:38,115 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:27:38,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:27:38,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:27:38,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:27:38,115 INFO L87 Difference]: Start difference. First operand 249 states and 291 transitions. Second operand 19 states. [2018-02-02 10:27:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:38,768 INFO L93 Difference]: Finished difference Result 300 states and 335 transitions. [2018-02-02 10:27:38,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:27:38,768 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-02-02 10:27:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:38,769 INFO L225 Difference]: With dead ends: 300 [2018-02-02 10:27:38,769 INFO L226 Difference]: Without dead ends: 300 [2018-02-02 10:27:38,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1208, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:27:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-02 10:27:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 265. [2018-02-02 10:27:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-02 10:27:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 312 transitions. [2018-02-02 10:27:38,773 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 312 transitions. Word has length 51 [2018-02-02 10:27:38,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:38,773 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 312 transitions. [2018-02-02 10:27:38,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:27:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 312 transitions. [2018-02-02 10:27:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:27:38,774 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:38,774 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:27:38,774 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:38,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1098072126, now seen corresponding path program 1 times [2018-02-02 10:27:38,775 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:38,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:38,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:38,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:27:38,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:38,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:27:38,802 INFO L182 omatonBuilderFactory]: Interpolants [15152#false, 15153#(= main_~state~0 2), 15151#true] [2018-02-02 10:27:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:38,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:27:38,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:27:38,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:27:38,803 INFO L87 Difference]: Start difference. First operand 265 states and 312 transitions. Second operand 3 states. [2018-02-02 10:27:38,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:38,816 INFO L93 Difference]: Finished difference Result 396 states and 466 transitions. [2018-02-02 10:27:38,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:27:38,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-02-02 10:27:38,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:38,817 INFO L225 Difference]: With dead ends: 396 [2018-02-02 10:27:38,817 INFO L226 Difference]: Without dead ends: 396 [2018-02-02 10:27:38,817 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:27:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-02-02 10:27:38,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 284. [2018-02-02 10:27:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-02 10:27:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 333 transitions. [2018-02-02 10:27:38,821 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 333 transitions. Word has length 52 [2018-02-02 10:27:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:38,822 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 333 transitions. [2018-02-02 10:27:38,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:27:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 333 transitions. [2018-02-02 10:27:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:27:38,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:38,822 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, 1] [2018-02-02 10:27:38,822 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:38,823 INFO L82 PathProgramCache]: Analyzing trace with hash -443556897, now seen corresponding path program 1 times [2018-02-02 10:27:38,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:38,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:27:39,026 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:27:39,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:39,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:27:39,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:39,026 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:27:39,026 INFO L182 omatonBuilderFactory]: Interpolants [15840#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15841#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))))), 15842#(= 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))))), 15843#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 15844#(= 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)))), 15845#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|))), 15846#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 15847#(= 1 (select |#valid| |main_#t~mem16.base|)), 15834#true, 15835#false, 15836#(= 0 |main_#t~malloc0.offset|), 15837#(= main_~head~0.offset 0), 15838#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 15839#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= 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)))] [2018-02-02 10:27:39,026 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:27:39,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:27:39,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:27:39,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:27:39,027 INFO L87 Difference]: Start difference. First operand 284 states and 333 transitions. Second operand 14 states. [2018-02-02 10:27:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:39,443 INFO L93 Difference]: Finished difference Result 297 states and 335 transitions. [2018-02-02 10:27:39,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:27:39,443 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-02-02 10:27:39,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:39,444 INFO L225 Difference]: With dead ends: 297 [2018-02-02 10:27:39,444 INFO L226 Difference]: Without dead ends: 297 [2018-02-02 10:27:39,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:27:39,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-02-02 10:27:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 284. [2018-02-02 10:27:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-02 10:27:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 332 transitions. [2018-02-02 10:27:39,447 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 332 transitions. Word has length 54 [2018-02-02 10:27:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:39,447 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 332 transitions. [2018-02-02 10:27:39,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:27:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 332 transitions. [2018-02-02 10:27:39,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:27:39,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:39,447 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, 1] [2018-02-02 10:27:39,447 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:39,447 INFO L82 PathProgramCache]: Analyzing trace with hash -443556896, now seen corresponding path program 1 times [2018-02-02 10:27:39,448 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:39,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:39,670 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:27:39,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:39,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:27:39,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:39,670 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:27:39,670 INFO L182 omatonBuilderFactory]: Interpolants [16459#true, 16460#false, 16461#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 16462#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 16463#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 16464#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (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) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 16465#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))))), 16466#(and (= 12 (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))))) (= 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))))), 16467#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))))), 16468#(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))) (= 12 (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))))), 16469#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 16470#(and (= 12 (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))), 16471#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 10:27:39,670 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:27:39,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:27:39,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:27:39,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:27:39,671 INFO L87 Difference]: Start difference. First operand 284 states and 332 transitions. Second operand 13 states. [2018-02-02 10:27:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:40,169 INFO L93 Difference]: Finished difference Result 303 states and 340 transitions. [2018-02-02 10:27:40,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:27:40,169 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-02-02 10:27:40,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:40,170 INFO L225 Difference]: With dead ends: 303 [2018-02-02 10:27:40,170 INFO L226 Difference]: Without dead ends: 303 [2018-02-02 10:27:40,170 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:27:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-02 10:27:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 284. [2018-02-02 10:27:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-02 10:27:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 331 transitions. [2018-02-02 10:27:40,173 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 331 transitions. Word has length 54 [2018-02-02 10:27:40,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:40,173 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 331 transitions. [2018-02-02 10:27:40,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:27:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 331 transitions. [2018-02-02 10:27:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:27:40,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:40,174 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, 1, 1, 1, 1] [2018-02-02 10:27:40,174 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:40,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1358237756, now seen corresponding path program 1 times [2018-02-02 10:27:40,175 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:40,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:40,368 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:27:40,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:40,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:27:40,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:40,369 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:27:40,369 INFO L182 omatonBuilderFactory]: Interpolants [17088#(and (= |main_#t~mem9.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~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 17089#(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))) (= 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))), 17090#(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_~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)) (not (= main_~x~0.base main_~head~0.base))), 17091#(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)))))), 17092#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))), 17093#(= 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)))), 17094#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|))), 17095#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 17096#(= 1 (select |#valid| |main_#t~mem16.base|)), 17081#true, 17082#false, 17083#(= (select |#valid| main_~head~0.base) 1), 17084#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 17085#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 17086#(and (= 1 (select |#valid| (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) (= main_~x~0.base main_~head~0.base)), 17087#(and (= main_~head~0.offset main_~x~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)))] [2018-02-02 10:27:40,369 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:27:40,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:27:40,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:27:40,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:27:40,370 INFO L87 Difference]: Start difference. First operand 284 states and 331 transitions. Second operand 16 states. [2018-02-02 10:27:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:40,933 INFO L93 Difference]: Finished difference Result 315 states and 351 transitions. [2018-02-02 10:27:40,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:27:40,933 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-02-02 10:27:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:40,934 INFO L225 Difference]: With dead ends: 315 [2018-02-02 10:27:40,934 INFO L226 Difference]: Without dead ends: 315 [2018-02-02 10:27:40,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:27:40,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-02 10:27:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 284. [2018-02-02 10:27:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-02 10:27:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 330 transitions. [2018-02-02 10:27:40,938 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 330 transitions. Word has length 55 [2018-02-02 10:27:40,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:40,938 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 330 transitions. [2018-02-02 10:27:40,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:27:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 330 transitions. [2018-02-02 10:27:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:27:40,939 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:40,939 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, 1, 1, 1, 1] [2018-02-02 10:27:40,939 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:40,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1358237757, now seen corresponding path program 1 times [2018-02-02 10:27:40,940 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:40,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:41,192 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:27:41,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:41,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:27:41,193 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:41,193 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:27:41,193 INFO L182 omatonBuilderFactory]: Interpolants [17728#true, 17729#false, 17730#(= (select |#valid| main_~head~0.base) 1), 17731#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 17732#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 17733#(and (= 12 (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)), 17734#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 17735#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem9.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~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 17736#(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)) (= 12 (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.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))), 17737#(and (= 12 (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_~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))), 17738#(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)))) (= 12 (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)))))), 17739#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))))), 17740#(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))) (= 12 (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))))), 17741#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 17742#(and (= 12 (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))), 17743#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 10:27:41,193 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:27:41,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:27:41,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:27:41,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:27:41,194 INFO L87 Difference]: Start difference. First operand 284 states and 330 transitions. Second operand 16 states. [2018-02-02 10:27:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:41,817 INFO L93 Difference]: Finished difference Result 317 states and 352 transitions. [2018-02-02 10:27:41,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:27:41,817 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-02-02 10:27:41,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:41,818 INFO L225 Difference]: With dead ends: 317 [2018-02-02 10:27:41,818 INFO L226 Difference]: Without dead ends: 317 [2018-02-02 10:27:41,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:27:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-02 10:27:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 284. [2018-02-02 10:27:41,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-02 10:27:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 329 transitions. [2018-02-02 10:27:41,821 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 329 transitions. Word has length 55 [2018-02-02 10:27:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:41,821 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 329 transitions. [2018-02-02 10:27:41,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:27:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 329 transitions. [2018-02-02 10:27:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:27:41,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:41,821 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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] [2018-02-02 10:27:41,821 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:41,821 INFO L82 PathProgramCache]: Analyzing trace with hash 761708042, now seen corresponding path program 2 times [2018-02-02 10:27:41,822 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:41,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:42,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:42,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:27:42,124 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:42,124 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:27:42,124 INFO L182 omatonBuilderFactory]: Interpolants [18369#true, 18370#false, 18371#(= (select |#valid| main_~head~0.base) 1), 18372#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 18373#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 18374#(and (= 1 (select |#valid| main_~x~0.base)) (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)), 18375#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 18376#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 18377#(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))), 18378#(and (= 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)), 18379#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.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~malloc5.base|)) main_~head~0.base) main_~head~0.offset))), 18380#(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 (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)))), 18381#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|))), 18382#(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_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 18383#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 18384#(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))), 18385#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 18386#(= 1 (select |#valid| |main_#t~mem14.base|)), 18387#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:27:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:42,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:27:42,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:27:42,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:27:42,125 INFO L87 Difference]: Start difference. First operand 284 states and 329 transitions. Second operand 19 states. [2018-02-02 10:27:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:42,734 INFO L93 Difference]: Finished difference Result 412 states and 470 transitions. [2018-02-02 10:27:42,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:27:42,735 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-02-02 10:27:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:42,736 INFO L225 Difference]: With dead ends: 412 [2018-02-02 10:27:42,736 INFO L226 Difference]: Without dead ends: 412 [2018-02-02 10:27:42,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:27:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-02 10:27:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 334. [2018-02-02 10:27:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-02 10:27:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 384 transitions. [2018-02-02 10:27:42,739 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 384 transitions. Word has length 56 [2018-02-02 10:27:42,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:42,739 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 384 transitions. [2018-02-02 10:27:42,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:27:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 384 transitions. [2018-02-02 10:27:42,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:27:42,739 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:42,739 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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] [2018-02-02 10:27:42,740 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:42,740 INFO L82 PathProgramCache]: Analyzing trace with hash 761708043, now seen corresponding path program 2 times [2018-02-02 10:27:42,740 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:42,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:43,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:43,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:27:43,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:43,114 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:27:43,114 INFO L182 omatonBuilderFactory]: Interpolants [19172#true, 19173#false, 19174#(= (select |#valid| main_~head~0.base) 1), 19175#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 19176#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 19177#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (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)), 19178#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 19179#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 19180#(and (= 12 (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))), 19181#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (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)), 19182#(and (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.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~malloc5.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_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 19183#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (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_~head~0.base) main_~head~0.offset))), 19184#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 19185#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (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))), 19186#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 19187#(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)) (= 12 (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)))), 19188#(and (= 12 (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))), 19189#(and (= 0 |main_#t~mem14.offset|) (= 12 (select |#length| |main_#t~mem14.base|))), 19190#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset))] [2018-02-02 10:27:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:43,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:27:43,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:27:43,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:27:43,115 INFO L87 Difference]: Start difference. First operand 334 states and 384 transitions. Second operand 19 states. [2018-02-02 10:27:43,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:43,831 INFO L93 Difference]: Finished difference Result 406 states and 460 transitions. [2018-02-02 10:27:43,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:27:43,831 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-02-02 10:27:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:43,832 INFO L225 Difference]: With dead ends: 406 [2018-02-02 10:27:43,832 INFO L226 Difference]: Without dead ends: 406 [2018-02-02 10:27:43,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:27:43,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-02-02 10:27:43,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 349. [2018-02-02 10:27:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-02-02 10:27:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 404 transitions. [2018-02-02 10:27:43,835 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 404 transitions. Word has length 56 [2018-02-02 10:27:43,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:43,835 INFO L432 AbstractCegarLoop]: Abstraction has 349 states and 404 transitions. [2018-02-02 10:27:43,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:27:43,835 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 404 transitions. [2018-02-02 10:27:43,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:27:43,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:43,836 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, 1] [2018-02-02 10:27:43,836 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:43,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1935424618, now seen corresponding path program 1 times [2018-02-02 10:27:43,836 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:43,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:44,098 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:27:44,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:44,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:27:44,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:44,099 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:27:44,099 INFO L182 omatonBuilderFactory]: Interpolants [19972#true, 19973#false, 19974#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 19975#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 19976#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 19977#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (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) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 19978#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))))), 19979#(and (= 12 (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))))) (= 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))))), 19980#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))))), 19981#(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))) (= 12 (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))))), 19982#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 19983#(and (= 12 (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))), 19984#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0)), 19985#(and (<= |main_#t~mem18.offset| 0) (<= 0 |main_#t~mem18.offset|) (= (select |#length| |main_#t~mem18.base|) 12))] [2018-02-02 10:27:44,100 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:27:44,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:27:44,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:27:44,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:27:44,100 INFO L87 Difference]: Start difference. First operand 349 states and 404 transitions. Second operand 14 states. [2018-02-02 10:27:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:44,664 INFO L93 Difference]: Finished difference Result 368 states and 413 transitions. [2018-02-02 10:27:44,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:27:44,664 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-02-02 10:27:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:44,665 INFO L225 Difference]: With dead ends: 368 [2018-02-02 10:27:44,665 INFO L226 Difference]: Without dead ends: 368 [2018-02-02 10:27:44,666 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:27:44,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-02-02 10:27:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 349. [2018-02-02 10:27:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-02-02 10:27:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 403 transitions. [2018-02-02 10:27:44,670 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 403 transitions. Word has length 59 [2018-02-02 10:27:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:44,670 INFO L432 AbstractCegarLoop]: Abstraction has 349 states and 403 transitions. [2018-02-02 10:27:44,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:27:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 403 transitions. [2018-02-02 10:27:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:27:44,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:44,671 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, 1, 1, 1, 1] [2018-02-02 10:27:44,671 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:44,671 INFO L82 PathProgramCache]: Analyzing trace with hash -558870251, now seen corresponding path program 1 times [2018-02-02 10:27:44,672 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:44,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:44,992 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:27:44,993 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:44,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:27:44,993 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:44,993 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:27:44,993 INFO L182 omatonBuilderFactory]: Interpolants [20736#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20737#(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)), 20738#(and (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20739#(and (= |main_#t~mem14.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~mem14.base|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20740#(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)), 20741#(and (= |main_#t~mem15| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= 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)), 20742#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= 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)), 20743#(and (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)))) (= main_~head~0.offset 0)), 20744#(not (= 0 (select (select |#memory_int| |main_#t~mem23.base|) (+ 0 8)))), 20745#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0)), 20746#(or (<= 1 main_~x~0.offset) (not (= 0 |main_#t~mem24|)) (<= (+ main_~x~0.offset 1) 0)), 20747#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0)), 20727#true, 20728#false, 20729#(= 0 |main_#t~malloc0.offset|), 20730#(= main_~head~0.offset 0), 20731#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 20732#(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)), 20733#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 20734#(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)), 20735#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0))] [2018-02-02 10:27:44,993 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:27:44,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:27:44,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:27:44,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:27:44,994 INFO L87 Difference]: Start difference. First operand 349 states and 403 transitions. Second operand 21 states. [2018-02-02 10:27:45,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:45,554 INFO L93 Difference]: Finished difference Result 362 states and 407 transitions. [2018-02-02 10:27:45,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:27:45,555 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-02-02 10:27:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:45,556 INFO L225 Difference]: With dead ends: 362 [2018-02-02 10:27:45,556 INFO L226 Difference]: Without dead ends: 361 [2018-02-02 10:27:45,556 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=1488, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:27:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-02 10:27:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 348. [2018-02-02 10:27:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-02 10:27:45,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 401 transitions. [2018-02-02 10:27:45,558 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 401 transitions. Word has length 60 [2018-02-02 10:27:45,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:45,558 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 401 transitions. [2018-02-02 10:27:45,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:27:45,559 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 401 transitions. [2018-02-02 10:27:45,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:27:45,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:45,559 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, 1, 1, 1, 1] [2018-02-02 10:27:45,559 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:45,559 INFO L82 PathProgramCache]: Analyzing trace with hash -558820599, now seen corresponding path program 1 times [2018-02-02 10:27:45,560 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:45,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:45,664 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:27:45,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:45,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:27:45,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:45,665 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:27:45,665 INFO L182 omatonBuilderFactory]: Interpolants [21504#(= (select |#valid| main_~head~0.base) 1), 21505#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 21506#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 21507#(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)), 21508#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 21509#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21510#(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))), 21511#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 21512#(= 0 |main_#t~mem23.offset|), 21513#(= 0 main_~x~0.offset), 21514#(= main_~head~0.offset 0), 21502#true, 21503#false] [2018-02-02 10:27:45,665 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:27:45,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:27:45,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:27:45,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:27:45,666 INFO L87 Difference]: Start difference. First operand 348 states and 401 transitions. Second operand 13 states. [2018-02-02 10:27:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:45,955 INFO L93 Difference]: Finished difference Result 365 states and 409 transitions. [2018-02-02 10:27:45,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:27:45,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-02-02 10:27:45,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:45,956 INFO L225 Difference]: With dead ends: 365 [2018-02-02 10:27:45,956 INFO L226 Difference]: Without dead ends: 365 [2018-02-02 10:27:45,956 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:27:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-02 10:27:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 322. [2018-02-02 10:27:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-02-02 10:27:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 365 transitions. [2018-02-02 10:27:45,958 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 365 transitions. Word has length 60 [2018-02-02 10:27:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:45,959 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 365 transitions. [2018-02-02 10:27:45,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:27:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 365 transitions. [2018-02-02 10:27:45,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:27:45,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:45,959 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, 1, 1, 1, 1] [2018-02-02 10:27:45,959 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:45,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1177929171, now seen corresponding path program 1 times [2018-02-02 10:27:45,960 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:45,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:46,191 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:27:46,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:46,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:27:46,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:46,192 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:27:46,192 INFO L182 omatonBuilderFactory]: Interpolants [22220#true, 22221#false, 22222#(= (select |#valid| main_~head~0.base) 1), 22223#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 22224#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 22225#(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)), 22226#(and (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 22227#(and (= |main_#t~mem9.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~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 22228#(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))), 22229#(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))), 22230#(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))))), 22231#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 22232#(= 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))), 22233#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)), 22234#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 22235#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 22236#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 22237#(and (<= 0 |main_#t~mem18.offset|) (<= (+ |main_#t~mem18.offset| 12) (select |#length| |main_#t~mem18.base|)))] [2018-02-02 10:27:46,192 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:27:46,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:27:46,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:27:46,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:27:46,192 INFO L87 Difference]: Start difference. First operand 322 states and 365 transitions. Second operand 18 states. [2018-02-02 10:27:46,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:46,804 INFO L93 Difference]: Finished difference Result 363 states and 407 transitions. [2018-02-02 10:27:46,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:27:46,804 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-02-02 10:27:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:46,805 INFO L225 Difference]: With dead ends: 363 [2018-02-02 10:27:46,805 INFO L226 Difference]: Without dead ends: 363 [2018-02-02 10:27:46,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:27:46,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-02-02 10:27:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 295. [2018-02-02 10:27:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-02 10:27:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 334 transitions. [2018-02-02 10:27:46,807 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 334 transitions. Word has length 60 [2018-02-02 10:27:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:46,808 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 334 transitions. [2018-02-02 10:27:46,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:27:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 334 transitions. [2018-02-02 10:27:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:27:46,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:46,808 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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] [2018-02-02 10:27:46,808 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:46,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2138142991, now seen corresponding path program 2 times [2018-02-02 10:27:46,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:46,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:47,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:47,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:27:47,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:47,102 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:27:47,102 INFO L182 omatonBuilderFactory]: Interpolants [22944#(= 1 (select |#valid| |main_#t~mem16.base|)), 22926#true, 22927#false, 22928#(= (select |#valid| main_~head~0.base) 1), 22929#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 22930#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 22931#(and (= 1 (select |#valid| main_~x~0.base)) (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)), 22932#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 22933#(and (= |main_#t~mem9.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~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 22934#(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))), 22935#(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)), 22936#(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~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.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~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| |main_#t~malloc5.base|))), 22937#(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))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| 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)))), 22938#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.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_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))))), 22939#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= 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))))), 22940#(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)) (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))), 22941#(= 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)))), 22942#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 22943#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 10:27:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:47,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:27:47,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:27:47,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:27:47,103 INFO L87 Difference]: Start difference. First operand 295 states and 334 transitions. Second operand 19 states. [2018-02-02 10:27:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:47,880 INFO L93 Difference]: Finished difference Result 400 states and 452 transitions. [2018-02-02 10:27:47,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:27:47,880 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-02 10:27:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:47,881 INFO L225 Difference]: With dead ends: 400 [2018-02-02 10:27:47,881 INFO L226 Difference]: Without dead ends: 400 [2018-02-02 10:27:47,881 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=1309, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:27:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-02-02 10:27:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 295. [2018-02-02 10:27:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-02 10:27:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 333 transitions. [2018-02-02 10:27:47,884 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 333 transitions. Word has length 60 [2018-02-02 10:27:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:47,884 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 333 transitions. [2018-02-02 10:27:47,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:27:47,884 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 333 transitions. [2018-02-02 10:27:47,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:27:47,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:47,885 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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] [2018-02-02 10:27:47,885 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:47,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2138142990, now seen corresponding path program 2 times [2018-02-02 10:27:47,885 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:47,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:48,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:48,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:27:48,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:48,181 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:27:48,182 INFO L182 omatonBuilderFactory]: Interpolants [23682#true, 23683#false, 23684#(= (select |#valid| main_~head~0.base) 1), 23685#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 23686#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 23687#(and (= 1 (select |#valid| main_~x~0.base)) (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)), 23688#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 23689#(and (= |main_#t~mem9.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~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 23690#(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))), 23691#(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)), 23692#(and (= 0 |main_#t~malloc5.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_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.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~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| |main_#t~malloc5.base|))), 23693#(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))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| 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_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 23694#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))))), 23695#(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))) (= 12 (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 (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|))), 23696#(and (= 12 (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)) (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)) (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))), 23697#(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))) (= 12 (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))))), 23698#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 23699#(and (= 12 (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))), 23700#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 10:27:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:48,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:27:48,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:27:48,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:27:48,182 INFO L87 Difference]: Start difference. First operand 295 states and 333 transitions. Second operand 19 states. [2018-02-02 10:27:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:48,911 INFO L93 Difference]: Finished difference Result 350 states and 388 transitions. [2018-02-02 10:27:48,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:27:48,912 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-02 10:27:48,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:48,912 INFO L225 Difference]: With dead ends: 350 [2018-02-02 10:27:48,913 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 10:27:48,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:27:48,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 10:27:48,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 295. [2018-02-02 10:27:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-02 10:27:48,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 332 transitions. [2018-02-02 10:27:48,915 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 332 transitions. Word has length 60 [2018-02-02 10:27:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:48,915 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 332 transitions. [2018-02-02 10:27:48,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:27:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 332 transitions. [2018-02-02 10:27:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:27:48,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:48,915 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, 1] [2018-02-02 10:27:48,915 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:48,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1814893080, now seen corresponding path program 1 times [2018-02-02 10:27:48,916 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:48,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:49,254 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:27:49,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:49,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:27:49,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:49,255 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:27:49,255 INFO L182 omatonBuilderFactory]: Interpolants [24384#(and (not (= 0 |main_#t~mem17|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 24385#(and (not |main_#t~short21|) (= main_~head~0.offset 0)), 24372#true, 24373#false, 24374#(= 0 |main_#t~malloc0.offset|), 24375#(= main_~head~0.offset 0), 24376#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 24377#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= 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))), 24378#(and (= main_~head~0.base |main_#t~mem14.base|) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) |main_#t~mem14.offset|)) (= main_~head~0.offset |main_#t~mem14.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24379#(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))), 24380#(and (= |main_#t~mem15| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.offset main_~x~0.offset) (= 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.base main_~x~0.base) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24381#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= 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))), 24382#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem22.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem22.base|) (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) |main_#t~mem22.offset|)) (+ main_~head~0.offset 8)))) (= main_~head~0.base |main_#t~mem22.base|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24383#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset |main_#t~mem16.offset|) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (+ |main_#t~mem16.offset| 8)))))] [2018-02-02 10:27:49,256 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:27:49,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:27:49,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:27:49,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:27:49,256 INFO L87 Difference]: Start difference. First operand 295 states and 332 transitions. Second operand 14 states. [2018-02-02 10:27:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:49,547 INFO L93 Difference]: Finished difference Result 350 states and 387 transitions. [2018-02-02 10:27:49,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:27:49,547 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-02-02 10:27:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:49,548 INFO L225 Difference]: With dead ends: 350 [2018-02-02 10:27:49,548 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 10:27:49,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 8 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:27:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 10:27:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 342. [2018-02-02 10:27:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-02 10:27:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 387 transitions. [2018-02-02 10:27:49,550 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 387 transitions. Word has length 61 [2018-02-02 10:27:49,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:49,550 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 387 transitions. [2018-02-02 10:27:49,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:27:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 387 transitions. [2018-02-02 10:27:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:27:49,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:49,551 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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] [2018-02-02 10:27:49,551 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:49,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1858382925, now seen corresponding path program 2 times [2018-02-02 10:27:49,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:49,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 10:27:49,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:49,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:27:49,598 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:49,598 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:27:49,598 INFO L182 omatonBuilderFactory]: Interpolants [25104#(and (= |main_#t~mem14.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~mem14.base|)), 25105#(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))), 25106#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 12) (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) 8))), 25107#(and (<= 0 (+ |main_#t~mem23.offset| 8)) (<= (+ |main_#t~mem23.offset| 12) (select |#length| |main_#t~mem23.base|))), 25108#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 (+ main_~x~0.offset 8))), 25102#true, 25103#false] [2018-02-02 10:27:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 10:27:49,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:27:49,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:27:49,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:27:49,599 INFO L87 Difference]: Start difference. First operand 342 states and 387 transitions. Second operand 7 states. [2018-02-02 10:27:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:49,742 INFO L93 Difference]: Finished difference Result 371 states and 414 transitions. [2018-02-02 10:27:49,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:27:49,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-02-02 10:27:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:49,743 INFO L225 Difference]: With dead ends: 371 [2018-02-02 10:27:49,743 INFO L226 Difference]: Without dead ends: 371 [2018-02-02 10:27:49,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:27:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-02-02 10:27:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 341. [2018-02-02 10:27:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-02-02 10:27:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 383 transitions. [2018-02-02 10:27:49,745 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 383 transitions. Word has length 61 [2018-02-02 10:27:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:49,745 INFO L432 AbstractCegarLoop]: Abstraction has 341 states and 383 transitions. [2018-02-02 10:27:49,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:27:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 383 transitions. [2018-02-02 10:27:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:27:49,746 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:49,746 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, 1, 1, 1, 1] [2018-02-02 10:27:49,746 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash -155678997, now seen corresponding path program 1 times [2018-02-02 10:27:49,746 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:49,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:50,080 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:27:50,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:50,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:27:50,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:50,081 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:27:50,081 INFO L182 omatonBuilderFactory]: Interpolants [25831#true, 25832#false, 25833#(= 1 (select |#valid| main_~head~0.base)), 25834#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 25835#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 25836#(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))), 25837#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset)))), 25838#(and (= 0 |main_#t~mem9.offset|) (= |main_#t~mem9.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)))), 25839#(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))), 25840#(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))), 25841#(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))), 25842#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem14.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)))), 25843#(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)))), 25844#(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)))), 25845#(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~mem16.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)))), 25846#(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)))), 25847#(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))))), 25848#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (or (not (= 0 |main_#t~mem23.offset|)) (not (= 0 |main_#t~mem23.base|))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) |main_#t~mem23.base|))), 25849#(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)))), 25850#(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)))), 25851#(and (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= 0 main_~head~0.offset)) (= 1 (select (store |#valid| main_~head~0.base 0) |main_#t~mem25.base|)))), 25852#(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)))), 25853#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:27:50,081 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:27:50,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:27:50,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:27:50,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:27:50,082 INFO L87 Difference]: Start difference. First operand 341 states and 383 transitions. Second operand 23 states. [2018-02-02 10:27:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:50,820 INFO L93 Difference]: Finished difference Result 357 states and 394 transitions. [2018-02-02 10:27:50,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:27:50,821 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2018-02-02 10:27:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:50,821 INFO L225 Difference]: With dead ends: 357 [2018-02-02 10:27:50,822 INFO L226 Difference]: Without dead ends: 357 [2018-02-02 10:27:50,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=1887, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:27:50,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-02 10:27:50,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 343. [2018-02-02 10:27:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-02 10:27:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 386 transitions. [2018-02-02 10:27:50,824 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 386 transitions. Word has length 62 [2018-02-02 10:27:50,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:50,824 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 386 transitions. [2018-02-02 10:27:50,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:27:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 386 transitions. [2018-02-02 10:27:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:27:50,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:50,825 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, 1, 1, 1, 1] [2018-02-02 10:27:50,825 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:50,825 INFO L82 PathProgramCache]: Analyzing trace with hash -155678996, now seen corresponding path program 1 times [2018-02-02 10:27:50,825 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:50,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:51,297 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:27:51,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:51,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:27:51,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:51,297 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:27:51,297 INFO L182 omatonBuilderFactory]: Interpolants [26624#(and (or (not (= 0 main_~head~0.offset)) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 26625#(and (or (not (= 0 main_~head~0.offset)) (<= 0 |main_#t~mem25.offset|)) (<= (+ |main_#t~mem25.offset| 12) (select |#length| |main_#t~mem25.base|))), 26626#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (or (not (= 0 main_~head~0.offset)) (<= 0 main_~x~0.offset))), 26627#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 26602#true, 26603#false, 26604#(= 0 |main_#t~malloc0.offset|), 26605#(= 0 main_~head~0.offset), 26606#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 26607#(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)), 26608#(and (= 0 |main_#t~malloc5.offset|) (= 0 main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 26609#(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))), 26610#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26611#(and (= 0 main_~head~0.offset) (= 0 |main_#t~mem9.offset|) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|))), 26612#(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))), 26613#(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))), 26614#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)), 26615#(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$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem14.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem14.base|)), 26616#(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))), 26617#(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~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~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))) (= |main_#t~mem16.offset| 0))), 26618#(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))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 26619#(and (or (<= 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)))) (<= (+ (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)) 12) (select |#length| |main_#t~mem22.base|)) (= |main_#t~mem22.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)))), 26620#(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)) 12) (select |#length| main_~x~0.base)) (or (<= 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)))) (= 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)))), 26621#(and (or (<= 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)))) (<= (+ (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)) 12) (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))))), 26622#(and (or (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|) (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) 0))) (<= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (<= (+ (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)))), 26623#(and (or (not (= 0 main_~x~0.offset)) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))] [2018-02-02 10:27:51,298 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:27:51,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:27:51,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:27:51,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:27:51,298 INFO L87 Difference]: Start difference. First operand 343 states and 386 transitions. Second operand 26 states. [2018-02-02 10:27:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:52,459 INFO L93 Difference]: Finished difference Result 364 states and 400 transitions. [2018-02-02 10:27:52,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:27:52,460 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-02-02 10:27:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:52,461 INFO L225 Difference]: With dead ends: 364 [2018-02-02 10:27:52,461 INFO L226 Difference]: Without dead ends: 364 [2018-02-02 10:27:52,461 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=415, Invalid=2665, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 10:27:52,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-02-02 10:27:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 345. [2018-02-02 10:27:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-02 10:27:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 388 transitions. [2018-02-02 10:27:52,463 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 388 transitions. Word has length 62 [2018-02-02 10:27:52,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:52,463 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 388 transitions. [2018-02-02 10:27:52,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:27:52,463 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 388 transitions. [2018-02-02 10:27:52,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:27:52,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:52,464 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, 1, 1, 1, 1] [2018-02-02 10:27:52,464 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:52,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1159716169, now seen corresponding path program 2 times [2018-02-02 10:27:52,465 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:52,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:52,748 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:27:52,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:52,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:27:52,748 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:52,748 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:27:52,748 INFO L182 omatonBuilderFactory]: Interpolants [27397#true, 27398#false, 27399#(= (select |#valid| main_~head~0.base) 1), 27400#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 27401#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 27402#(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)), 27403#(and (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 27404#(and (= |main_#t~mem9.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~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 27405#(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))), 27406#(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))), 27407#(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))))), 27408#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 27409#(= 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))), 27410#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)), 27411#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 27412#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 27413#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 27414#(and (<= 0 |main_#t~mem22.offset|) (<= (+ |main_#t~mem22.offset| 12) (select |#length| |main_#t~mem22.base|))), 27415#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 10:27:52,748 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:27:52,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:27:52,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:27:52,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:27:52,749 INFO L87 Difference]: Start difference. First operand 345 states and 388 transitions. Second operand 19 states. [2018-02-02 10:27:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:53,480 INFO L93 Difference]: Finished difference Result 379 states and 418 transitions. [2018-02-02 10:27:53,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:27:53,481 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2018-02-02 10:27:53,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:53,481 INFO L225 Difference]: With dead ends: 379 [2018-02-02 10:27:53,481 INFO L226 Difference]: Without dead ends: 379 [2018-02-02 10:27:53,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:27:53,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-02 10:27:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 361. [2018-02-02 10:27:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-02-02 10:27:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 409 transitions. [2018-02-02 10:27:53,484 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 409 transitions. Word has length 63 [2018-02-02 10:27:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:53,484 INFO L432 AbstractCegarLoop]: Abstraction has 361 states and 409 transitions. [2018-02-02 10:27:53,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:27:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 409 transitions. [2018-02-02 10:27:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:27:53,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:53,485 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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] [2018-02-02 10:27:53,485 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:53,485 INFO L82 PathProgramCache]: Analyzing trace with hash 800408127, now seen corresponding path program 2 times [2018-02-02 10:27:53,485 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:53,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:53,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:53,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:27:53,887 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:53,887 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:27:53,888 INFO L182 omatonBuilderFactory]: Interpolants [28192#true, 28193#false, 28194#(= (select |#valid| main_~head~0.base) 1), 28195#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 28196#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 28197#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (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)), 28198#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 28199#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28200#(and (= 12 (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))), 28201#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (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)), 28202#(and (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.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~malloc5.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_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 28203#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (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_~head~0.base) main_~head~0.offset))), 28204#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) 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))) (not (= main_~x~0.base |main_#t~mem7.base|))), 28205#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (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))), 28206#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28207#(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)) (= 12 (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)))), 28208#(and (= 12 (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))), 28209#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (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))), 28210#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.offset 0)), 28211#(and (= 12 (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))), 28212#(and (<= 0 |main_#t~mem23.offset|) (= 12 (select |#length| |main_#t~mem23.base|))), 28213#(and (<= 0 main_~x~0.offset) (= (select |#length| main_~x~0.base) 12)), 28214#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset))] [2018-02-02 10:27:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:53,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:27:53,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:27:53,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:27:53,888 INFO L87 Difference]: Start difference. First operand 361 states and 409 transitions. Second operand 23 states. [2018-02-02 10:27:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:54,745 INFO L93 Difference]: Finished difference Result 414 states and 464 transitions. [2018-02-02 10:27:54,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:27:54,745 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2018-02-02 10:27:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:54,746 INFO L225 Difference]: With dead ends: 414 [2018-02-02 10:27:54,746 INFO L226 Difference]: Without dead ends: 414 [2018-02-02 10:27:54,746 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=359, Invalid=1533, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:27:54,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-02-02 10:27:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 383. [2018-02-02 10:27:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 10:27:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 441 transitions. [2018-02-02 10:27:54,748 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 441 transitions. Word has length 63 [2018-02-02 10:27:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:54,748 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 441 transitions. [2018-02-02 10:27:54,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:27:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 441 transitions. [2018-02-02 10:27:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:27:54,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:54,749 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, 1, 1] [2018-02-02 10:27:54,749 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash 716344120, now seen corresponding path program 1 times [2018-02-02 10:27:54,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:54,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:55,111 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:27:55,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:55,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:27:55,112 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:55,112 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:27:55,112 INFO L182 omatonBuilderFactory]: Interpolants [29056#(= 0 |main_#t~malloc0.offset|), 29057#(= 0 main_~head~0.offset), 29058#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 29059#(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)), 29060#(and (= 0 |main_#t~malloc5.offset|) (= 0 main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 29061#(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))), 29062#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 29063#(and (= 0 main_~head~0.offset) (= 0 |main_#t~mem9.offset|) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|))), 29064#(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))), 29065#(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))), 29066#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)), 29067#(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$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem14.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem14.base|)), 29068#(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))), 29069#(and (or (not (= |main_#t~mem16.offset| 0)) (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~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~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)))) (= |main_#t~mem16.offset| 0))), 29070#(or (and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 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| main_~x~0.base) main_~x~0.offset))) (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))))), 29071#(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)))), 29072#(or (and (<= (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|) (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) 0)))), 29073#(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)))), 29074#(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)))), 29075#(or (not (= 0 main_~head~0.offset)) (and (<= 0 |main_#t~mem25.offset|) (<= |main_#t~mem25.offset| 0))), 29076#(or (and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset)) (not (= 0 main_~head~0.offset))), 29077#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset)), 29054#true, 29055#false] [2018-02-02 10:27:55,112 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:27:55,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:27:55,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:27:55,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:27:55,113 INFO L87 Difference]: Start difference. First operand 383 states and 441 transitions. Second operand 24 states. [2018-02-02 10:27:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:55,914 INFO L93 Difference]: Finished difference Result 397 states and 449 transitions. [2018-02-02 10:27:55,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:27:55,914 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2018-02-02 10:27:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:55,915 INFO L225 Difference]: With dead ends: 397 [2018-02-02 10:27:55,915 INFO L226 Difference]: Without dead ends: 397 [2018-02-02 10:27:55,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=399, Invalid=1857, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:27:55,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-02-02 10:27:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 386. [2018-02-02 10:27:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-02-02 10:27:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 444 transitions. [2018-02-02 10:27:55,918 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 444 transitions. Word has length 64 [2018-02-02 10:27:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:55,918 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 444 transitions. [2018-02-02 10:27:55,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:27:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 444 transitions. [2018-02-02 10:27:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:27:55,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:55,919 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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:27:55,919 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:55,919 INFO L82 PathProgramCache]: Analyzing trace with hash 393069440, now seen corresponding path program 2 times [2018-02-02 10:27:55,919 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:55,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:56,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:56,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:27:56,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:56,846 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:27:56,846 INFO L182 omatonBuilderFactory]: Interpolants [29909#true, 29910#false, 29911#(= 0 |main_#t~malloc0.offset|), 29912#(= main_~head~0.offset 0), 29913#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 29914#(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)), 29915#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 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)), 29916#(and (= 1 (select |#valid| main_~x~0.base)) (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)), 29917#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 1 main_~state~0) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 29918#(and (= 0 |main_#t~mem9.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 main_~state~0) (= main_~head~0.offset 0)), 29919#(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))), 29920#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 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) (= (select |#valid| main_~x~0.base) 1)), 29921#(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 8))) (= 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)), 29922#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= 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~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc5.base| 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)), 29923#(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))) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (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)), 29924#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 29925#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8))) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= main_~head~0.offset 0)), 29926#(and (= 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 8))) (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)), 29927#(and (not (= main_~x~0.base main_~head~0.base)) (= 1 (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8) main_~state~0)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8))) (= main_~head~0.offset 0)), 29928#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8))) (= main_~head~0.offset 0)), 29929#(and (= 1 (select (select |#memory_int| |main_#t~mem14.base|) (+ main_~head~0.offset 8))) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 29930#(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 8))) (= main_~head~0.offset 0))), 29931#(and (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)))) (= main_~head~0.offset 0)), 29932#(not (= 0 (select (select |#memory_int| |main_#t~mem23.base|) (+ 0 8)))), 29933#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0)), 29934#(or (<= 1 main_~x~0.offset) (not (= 0 |main_#t~mem24|)) (<= (+ main_~x~0.offset 1) 0)), 29935#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0))] [2018-02-02 10:27:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:56,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:27:56,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:27:56,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:27:56,847 INFO L87 Difference]: Start difference. First operand 386 states and 444 transitions. Second operand 27 states. [2018-02-02 10:27:58,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:58,030 INFO L93 Difference]: Finished difference Result 537 states and 618 transitions. [2018-02-02 10:27:58,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:27:58,030 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 65 [2018-02-02 10:27:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:58,031 INFO L225 Difference]: With dead ends: 537 [2018-02-02 10:27:58,031 INFO L226 Difference]: Without dead ends: 536 [2018-02-02 10:27:58,031 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=550, Invalid=2756, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:27:58,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-02-02 10:27:58,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 435. [2018-02-02 10:27:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-02 10:27:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 506 transitions. [2018-02-02 10:27:58,034 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 506 transitions. Word has length 65 [2018-02-02 10:27:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:58,035 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 506 transitions. [2018-02-02 10:27:58,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:27:58,035 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 506 transitions. [2018-02-02 10:27:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:27:58,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:58,035 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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:27:58,035 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:58,035 INFO L82 PathProgramCache]: Analyzing trace with hash 393119092, now seen corresponding path program 1 times [2018-02-02 10:27:58,036 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:58,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:58,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:58,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:27:58,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:58,341 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:27:58,341 INFO L182 omatonBuilderFactory]: Interpolants [30976#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 30977#(and (= 1 (select |#valid| main_~x~0.base)) (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.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 30978#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 30979#(and (= 0 main_~head~0.offset) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30980#(and (= 0 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))), 30981#(and (= 0 main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc5.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~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 30982#(and (= 0 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))), 30983#(and (= 0 main_~head~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))), 30984#(and (= 0 main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30985#(or (<= (+ main_~x~0.offset 1) 0) (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset) main_~head~0.offset))) (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)))), 30986#(or (and (not (= (+ main_~x~0.offset 8) 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)) (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 30987#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 30988#(= 0 |main_#t~mem23.offset|), 30989#(= 0 main_~x~0.offset), 30970#true, 30971#false, 30972#(= 0 |main_#t~malloc0.offset|), 30973#(= 0 main_~head~0.offset), 30974#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 30975#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 10:27:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:58,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:27:58,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:27:58,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:27:58,342 INFO L87 Difference]: Start difference. First operand 435 states and 506 transitions. Second operand 20 states. [2018-02-02 10:27:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:58,861 INFO L93 Difference]: Finished difference Result 445 states and 516 transitions. [2018-02-02 10:27:58,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:27:58,861 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-02-02 10:27:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:58,862 INFO L225 Difference]: With dead ends: 445 [2018-02-02 10:27:58,862 INFO L226 Difference]: Without dead ends: 445 [2018-02-02 10:27:58,862 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=371, Invalid=1035, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:27:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-02 10:27:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 433. [2018-02-02 10:27:58,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-02-02 10:27:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 505 transitions. [2018-02-02 10:27:58,865 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 505 transitions. Word has length 65 [2018-02-02 10:27:58,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:58,865 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 505 transitions. [2018-02-02 10:27:58,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:27:58,865 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 505 transitions. [2018-02-02 10:27:58,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:27:58,866 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:58,866 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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:27:58,866 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:58,866 INFO L82 PathProgramCache]: Analyzing trace with hash -225989480, now seen corresponding path program 2 times [2018-02-02 10:27:58,866 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:58,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 10:27:58,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:58,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:27:58,906 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:58,907 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:27:58,907 INFO L182 omatonBuilderFactory]: Interpolants [31904#true, 31905#false, 31906#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 31907#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 31908#(and (<= 0 (+ |main_#t~mem18.offset| 8)) (<= (+ |main_#t~mem18.offset| 12) (select |#length| |main_#t~mem18.base|)))] [2018-02-02 10:27:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 10:27:58,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:27:58,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:27:58,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:27:58,907 INFO L87 Difference]: Start difference. First operand 433 states and 505 transitions. Second operand 5 states. [2018-02-02 10:27:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:59,012 INFO L93 Difference]: Finished difference Result 441 states and 506 transitions. [2018-02-02 10:27:59,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:27:59,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-02-02 10:27:59,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:59,013 INFO L225 Difference]: With dead ends: 441 [2018-02-02 10:27:59,013 INFO L226 Difference]: Without dead ends: 441 [2018-02-02 10:27:59,013 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:27:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-02-02 10:27:59,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 432. [2018-02-02 10:27:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-02-02 10:27:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 497 transitions. [2018-02-02 10:27:59,015 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 497 transitions. Word has length 65 [2018-02-02 10:27:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:59,015 INFO L432 AbstractCegarLoop]: Abstraction has 432 states and 497 transitions. [2018-02-02 10:27:59,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:27:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 497 transitions. [2018-02-02 10:27:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:27:59,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:59,016 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, 1, 1, 1, 1] [2018-02-02 10:27:59,016 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:59,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1211937337, now seen corresponding path program 1 times [2018-02-02 10:27:59,017 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:59,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:59,788 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:27:59,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:59,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:27:59,789 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:59,789 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:27:59,789 INFO L182 omatonBuilderFactory]: Interpolants [32800#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= |main_#t~mem14.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))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 32801#(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)) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (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)))), 32802#(and (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) (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)))) (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)))), 32803#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) 0) |main_#t~mem23.base| 0) |old(#valid)|) (or (not (= 0 |main_#t~mem23.offset|)) (not (= 0 |main_#t~mem23.base|))) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) |main_#t~mem23.base|))), 32804#(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| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) main_~x~0.base 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))), 32805#(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)|))), 32806#(or (not (= 0 main_~head~0.offset)) (and (= |old(#valid)| (store (store |#valid| main_~head~0.base 0) |main_#t~mem25.base| 0)) (not (= 0 |main_#t~mem25.base|)) (not (= 0 main_~head~0.base)) (not (= |main_#t~mem25.base| main_~head~0.base)))), 32807#(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)))), 32808#(and (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|)), 32786#true, 32787#false, 32788#(= |#valid| |old(#valid)|), 32789#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 32790#(and (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 32791#(and (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 32792#(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)), 32793#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= (store (store |#valid| main_~head~0.base 0) |main_#t~malloc5.base| 0) |old(#valid)|) (= main_~x~0.base main_~head~0.base)), 32794#(and (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 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))), 32795#(and (= (store (store |#valid| main_~head~0.base 0) (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset) 0) |old(#valid)|) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset)))), 32796#(and (= 0 |main_#t~mem9.offset|) (= |main_#t~mem9.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)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|)), 32797#(and (= 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))) (= (store (store |#valid| main_~head~0.base 0) (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) |old(#valid)|) (= 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))), 32798#(and (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) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~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))), 32799#(and (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (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))))] [2018-02-02 10:27:59,789 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:27:59,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:27:59,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:27:59,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:27:59,789 INFO L87 Difference]: Start difference. First operand 432 states and 497 transitions. Second operand 23 states. [2018-02-02 10:28:01,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:01,004 INFO L93 Difference]: Finished difference Result 465 states and 519 transitions. [2018-02-02 10:28:01,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:28:01,005 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-02-02 10:28:01,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:01,006 INFO L225 Difference]: With dead ends: 465 [2018-02-02 10:28:01,006 INFO L226 Difference]: Without dead ends: 462 [2018-02-02 10:28:01,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=188, Invalid=1792, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:28:01,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-02-02 10:28:01,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 432. [2018-02-02 10:28:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-02-02 10:28:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 497 transitions. [2018-02-02 10:28:01,009 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 497 transitions. Word has length 66 [2018-02-02 10:28:01,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:01,009 INFO L432 AbstractCegarLoop]: Abstraction has 432 states and 497 transitions. [2018-02-02 10:28:01,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:28:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 497 transitions. [2018-02-02 10:28:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:28:01,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:01,010 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1] [2018-02-02 10:28:01,010 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:01,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1985914828, now seen corresponding path program 1 times [2018-02-02 10:28:01,010 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:01,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:01,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:01,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:28:01,893 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:01,893 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:28:01,893 INFO L182 omatonBuilderFactory]: Interpolants [33750#true, 33751#false, 33752#(= 0 |main_#t~malloc0.offset|), 33753#(= main_~head~0.offset 0), 33754#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 33755#(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)), 33756#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 33757#(and (= 1 (select |#valid| main_~x~0.base)) (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)), 33758#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 33759#(and (= 0 |main_#t~mem9.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~head~0.offset 0)), 33760#(and (= main_~head~0.offset main_~x~0.offset) (= 1 (select |#valid| main_~head~0.base)) (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))), 33761#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 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) (= (select |#valid| main_~x~0.base) 1)), 33762#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= 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) (= (select |#valid| main_~x~0.base) 1)), 33763#(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)) (= main_~head~0.offset main_~x~0.offset) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~state~0 0)) (not (= main_~x~0.base main_~head~0.base)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~state~0) (= main_~head~0.offset 0)), 33764#(and (not (= main_~head~0.base |main_#t~malloc5.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~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~state~0 0)) (= main_~head~0.offset main_~x~0.offset) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~state~0) (= main_~head~0.offset 0) (not (= |main_#t~malloc5.base| main_~x~0.base))), 33765#(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_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~state~0) (= main_~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 33766#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~state~0 0)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~state~0) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0)), 33767#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) main_~state~0) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= main_~state~0 0)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= main_~head~0.offset 0)), 33768#(and (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) (= (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 8)) main_~state~0)), 33769#(and (not (= main_~state~0 0)) (= (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8) main_~state~0)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) main_~state~0) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 33770#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) 0)) (= main_~head~0.offset 0)), 33771#(and (not (= (select (select |#memory_int| |main_#t~mem14.base|) (+ main_~head~0.offset 8)) 0)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 33772#(and (or (not (= 1 (select |#valid| main_~x~0.base))) (and (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 8)) 0)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= main_~head~0.offset 0)), 33773#(not (= (select (select |#memory_int| |main_#t~mem23.base|) (+ 0 8)) 0)), 33774#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0) (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))), 33775#(or (not (= |main_#t~mem24| 0)) (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0)), 33776#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0))] [2018-02-02 10:28:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:01,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:28:01,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:28:01,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:28:01,894 INFO L87 Difference]: Start difference. First operand 432 states and 497 transitions. Second operand 27 states. [2018-02-02 10:28:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:03,188 INFO L93 Difference]: Finished difference Result 569 states and 653 transitions. [2018-02-02 10:28:03,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:28:03,188 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2018-02-02 10:28:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:03,190 INFO L225 Difference]: With dead ends: 569 [2018-02-02 10:28:03,190 INFO L226 Difference]: Without dead ends: 568 [2018-02-02 10:28:03,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=559, Invalid=2747, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:28:03,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-02-02 10:28:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 425. [2018-02-02 10:28:03,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 10:28:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 489 transitions. [2018-02-02 10:28:03,195 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 489 transitions. Word has length 66 [2018-02-02 10:28:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:03,195 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 489 transitions. [2018-02-02 10:28:03,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:28:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 489 transitions. [2018-02-02 10:28:03,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:28:03,196 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:03,196 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:28:03,196 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:03,196 INFO L82 PathProgramCache]: Analyzing trace with hash -871770321, now seen corresponding path program 2 times [2018-02-02 10:28:03,196 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:03,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:03,603 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 27 DAG size of output 23 [2018-02-02 10:28:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:03,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:03,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:28:03,749 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:03,749 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:28:03,749 INFO L182 omatonBuilderFactory]: Interpolants [34848#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|))), 34849#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 34850#(= 1 (select |#valid| |main_#t~mem16.base|)), 34833#true, 34834#false, 34835#(= (select |#valid| main_~head~0.base) 1), 34836#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 34837#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 34838#(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)), 34839#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 34840#(and (= |main_#t~mem9.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~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|))), 34841#(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))), 34842#(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.offset (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)) (not (= main_~x~0.base main_~head~0.base))), 34843#(and (= main_~head~0.offset (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)))), 34844#(and (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)))), 34845#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.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))) (= 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)))), 34846#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 34847#(= 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))))] [2018-02-02 10:28:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:03,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:28:03,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:28:03,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:28:03,750 INFO L87 Difference]: Start difference. First operand 425 states and 489 transitions. Second operand 18 states. [2018-02-02 10:28:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:04,320 INFO L93 Difference]: Finished difference Result 440 states and 496 transitions. [2018-02-02 10:28:04,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:28:04,320 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-02-02 10:28:04,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:04,321 INFO L225 Difference]: With dead ends: 440 [2018-02-02 10:28:04,321 INFO L226 Difference]: Without dead ends: 440 [2018-02-02 10:28:04,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=1174, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:28:04,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-02-02 10:28:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 425. [2018-02-02 10:28:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 10:28:04,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 488 transitions. [2018-02-02 10:28:04,324 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 488 transitions. Word has length 67 [2018-02-02 10:28:04,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:04,325 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 488 transitions. [2018-02-02 10:28:04,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:28:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 488 transitions. [2018-02-02 10:28:04,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:28:04,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:04,325 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:28:04,325 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:04,325 INFO L82 PathProgramCache]: Analyzing trace with hash -871770320, now seen corresponding path program 2 times [2018-02-02 10:28:04,326 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:04,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:04,660 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:04,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:28:04,660 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:04,660 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:28:04,660 INFO L182 omatonBuilderFactory]: Interpolants [35756#true, 35757#false, 35758#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 35759#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 35760#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 35761#(and (= 0 main_~head~0.offset) (= 12 (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)), 35762#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 35763#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (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)), 35764#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 35765#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= |main_#t~mem9.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~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|))), 35766#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 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))), 35767#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 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.offset (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)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 35768#(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.offset (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))) (= 12 (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)))) (= 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)))), 35769#(and (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 35770#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.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))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 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)))), 35771#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))))), 35772#(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))) (= 12 (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))))), 35773#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 35774#(and (= 12 (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))), 35775#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 10:28:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:04,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:28:04,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:28:04,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:28:04,661 INFO L87 Difference]: Start difference. First operand 425 states and 488 transitions. Second operand 20 states. [2018-02-02 10:28:05,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:05,536 INFO L93 Difference]: Finished difference Result 442 states and 497 transitions. [2018-02-02 10:28:05,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:28:05,537 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2018-02-02 10:28:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:05,538 INFO L225 Difference]: With dead ends: 442 [2018-02-02 10:28:05,538 INFO L226 Difference]: Without dead ends: 442 [2018-02-02 10:28:05,538 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=1211, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:28:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-02 10:28:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 425. [2018-02-02 10:28:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 10:28:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 487 transitions. [2018-02-02 10:28:05,541 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 487 transitions. Word has length 67 [2018-02-02 10:28:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:05,541 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 487 transitions. [2018-02-02 10:28:05,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:28:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 487 transitions. [2018-02-02 10:28:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:28:05,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:05,542 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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:28:05,542 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:05,542 INFO L82 PathProgramCache]: Analyzing trace with hash -169669994, now seen corresponding path program 1 times [2018-02-02 10:28:05,542 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:05,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:06,032 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:06,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:06,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:28:06,033 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:06,033 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:28:06,033 INFO L182 omatonBuilderFactory]: Interpolants [36681#true, 36682#false, 36683#(= (select |#valid| main_~head~0.base) 1), 36684#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 36685#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 36686#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 1 (select |#valid| main_~x~0.base)) (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)), 36687#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 36688#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~head~0.base) 1)), 36689#(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))), 36690#(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)), 36691#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.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~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0)), 36692#(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))) (= main_~x~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 36693#(and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base)), 36694#(and (= 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))) (not (= main_~x~0.base (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)))), 36695#(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~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 36696#(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)))), 36697#(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)))), 36698#(and (= |main_#t~mem14.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))) (= |main_#t~mem14.base| (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)) 0)))), 36699#(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)))), 36700#(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)))), 36701#(and (not (= |main_#t~mem23.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0))) (or (not (= 0 |main_#t~mem23.offset|)) (not (= 0 |main_#t~mem23.base|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0)))), 36702#(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)))), 36703#(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)))), 36704#(and (or (= 1 (select (store |#valid| main_~head~0.base 0) |main_#t~mem25.base|)) (not (= main_~head~0.offset 0))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 36705#(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)))), 36706#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:28:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:06,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:28:06,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:28:06,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:28:06,034 INFO L87 Difference]: Start difference. First operand 425 states and 487 transitions. Second operand 26 states. [2018-02-02 10:28:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:07,253 INFO L93 Difference]: Finished difference Result 465 states and 521 transitions. [2018-02-02 10:28:07,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 10:28:07,253 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 67 [2018-02-02 10:28:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:07,254 INFO L225 Difference]: With dead ends: 465 [2018-02-02 10:28:07,254 INFO L226 Difference]: Without dead ends: 465 [2018-02-02 10:28:07,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=402, Invalid=3020, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 10:28:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-02-02 10:28:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 433. [2018-02-02 10:28:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-02-02 10:28:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 496 transitions. [2018-02-02 10:28:07,257 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 496 transitions. Word has length 67 [2018-02-02 10:28:07,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:07,257 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 496 transitions. [2018-02-02 10:28:07,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:28:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 496 transitions. [2018-02-02 10:28:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:28:07,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:07,258 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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:28:07,258 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:07,258 INFO L82 PathProgramCache]: Analyzing trace with hash -169669993, now seen corresponding path program 1 times [2018-02-02 10:28:07,258 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:07,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:07,702 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:07,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:28:07,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:07,703 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:28:07,703 INFO L182 omatonBuilderFactory]: Interpolants [37671#true, 37672#false, 37673#(= (select |#valid| main_~head~0.base) 1), 37674#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 37675#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 37676#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 1 (select |#valid| main_~x~0.base)) (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)), 37677#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 37678#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~head~0.base) 1)), 37679#(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))), 37680#(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)), 37681#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.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~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= 12 (select |#length| |main_#t~malloc5.base|))), 37682#(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))) (= 12 (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))), 37683#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) 0))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 37684#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 37685#(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)) 0)) (= 12 (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))) (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))), 37686#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 37687#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0)))), 37688#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 37689#(and (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 37690#(and (or (= 0 |main_#t~mem25.offset|) (not (= main_~head~0.offset 0))) (or (= 12 (select |#length| |main_#t~mem25.base|)) (not (= main_~head~0.offset 0)))), 37691#(and (or (= main_~x~0.offset 0) (not (= main_~head~0.offset 0))) (or (not (= main_~head~0.offset 0)) (= (select |#length| main_~x~0.base) 12))), 37692#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:28:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:07,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:28:07,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:28:07,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:28:07,704 INFO L87 Difference]: Start difference. First operand 433 states and 496 transitions. Second operand 22 states. [2018-02-02 10:28:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:08,424 INFO L93 Difference]: Finished difference Result 462 states and 517 transitions. [2018-02-02 10:28:08,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:28:08,424 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-02-02 10:28:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:08,425 INFO L225 Difference]: With dead ends: 462 [2018-02-02 10:28:08,425 INFO L226 Difference]: Without dead ends: 462 [2018-02-02 10:28:08,425 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:28:08,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-02-02 10:28:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 435. [2018-02-02 10:28:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-02 10:28:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 498 transitions. [2018-02-02 10:28:08,428 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 498 transitions. Word has length 67 [2018-02-02 10:28:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:08,429 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 498 transitions. [2018-02-02 10:28:08,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:28:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 498 transitions. [2018-02-02 10:28:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:28:08,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:08,429 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:08,429 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:08,429 INFO L82 PathProgramCache]: Analyzing trace with hash 783363855, now seen corresponding path program 2 times [2018-02-02 10:28:08,430 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:08,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:28:08,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:08,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:28:08,712 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:08,713 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:28:08,713 INFO L182 omatonBuilderFactory]: Interpolants [38624#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem14.offset|) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 38625#(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.offset 0)), 38626#(and (or (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~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.offset |main_#t~mem16.offset|))) (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem16.offset|)) (= main_~head~0.offset |main_#t~mem16.offset|)) (= main_~head~0.offset 0)), 38627#(and (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)) 0))) (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 (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~head~0.offset 8)) |main_#t~mem17|))) (= main_~head~0.offset 0)), 38628#(and (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)) 0))) (not |main_#t~short21|) (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_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~head~0.offset 8))))) (= main_~head~0.offset 0)), 38629#(and (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)) 0))) (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_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~head~0.offset 8))))) (= main_~head~0.offset 0)), 38630#(and (or (= 0 (select (select |#memory_int| (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_~head~0.offset 8))) (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)) 0))) (= main_~head~0.offset 0)), 38631#(or (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (+ 0 8))) (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|) 0))), 38632#(or (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 8))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0))), 38633#(or (= 0 (select (select |#memory_int| |main_#t~mem25.base|) (+ 0 8))) (not (= |main_#t~mem25.offset| 0))), 38634#(or (not (= main_~x~0.offset 0)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))), 38635#(or (not (= main_~x~0.offset 0)) (= 0 |main_#t~mem24|)), 38636#(not (= main_~head~0.offset 0)), 38620#true, 38621#false, 38622#(= 0 |main_#t~malloc0.offset|), 38623#(= main_~head~0.offset 0)] [2018-02-02 10:28:08,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:28:08,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:28:08,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:28:08,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:28:08,713 INFO L87 Difference]: Start difference. First operand 435 states and 498 transitions. Second operand 17 states. [2018-02-02 10:28:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:09,405 INFO L93 Difference]: Finished difference Result 639 states and 735 transitions. [2018-02-02 10:28:09,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:28:09,406 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2018-02-02 10:28:09,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:09,407 INFO L225 Difference]: With dead ends: 639 [2018-02-02 10:28:09,407 INFO L226 Difference]: Without dead ends: 625 [2018-02-02 10:28:09,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=1127, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:28:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-02-02 10:28:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 577. [2018-02-02 10:28:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-02-02 10:28:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 686 transitions. [2018-02-02 10:28:09,413 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 686 transitions. Word has length 68 [2018-02-02 10:28:09,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:09,413 INFO L432 AbstractCegarLoop]: Abstraction has 577 states and 686 transitions. [2018-02-02 10:28:09,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:28:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 686 transitions. [2018-02-02 10:28:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:28:09,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:09,413 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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:28:09,413 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:09,414 INFO L82 PathProgramCache]: Analyzing trace with hash 725995262, now seen corresponding path program 3 times [2018-02-02 10:28:09,414 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:09,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 10:28:09,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:09,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:28:09,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:09,451 INFO L182 omatonBuilderFactory]: Interpolants [39893#true, 39894#false, 39895#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 39896#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 39897#(and (<= 0 (+ |main_#t~mem22.offset| 8)) (<= (+ |main_#t~mem22.offset| 12) (select |#length| |main_#t~mem22.base|))), 39898#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 (+ main_~x~0.offset 8)))] [2018-02-02 10:28:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 10:28:09,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:28:09,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:28:09,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:28:09,451 INFO L87 Difference]: Start difference. First operand 577 states and 686 transitions. Second operand 6 states. [2018-02-02 10:28:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:09,547 INFO L93 Difference]: Finished difference Result 578 states and 678 transitions. [2018-02-02 10:28:09,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:28:09,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-02-02 10:28:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:09,548 INFO L225 Difference]: With dead ends: 578 [2018-02-02 10:28:09,548 INFO L226 Difference]: Without dead ends: 578 [2018-02-02 10:28:09,548 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:28:09,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-02-02 10:28:09,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 577. [2018-02-02 10:28:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-02-02 10:28:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 677 transitions. [2018-02-02 10:28:09,552 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 677 transitions. Word has length 68 [2018-02-02 10:28:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:09,552 INFO L432 AbstractCegarLoop]: Abstraction has 577 states and 677 transitions. [2018-02-02 10:28:09,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:28:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 677 transitions. [2018-02-02 10:28:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:28:09,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:09,553 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1] [2018-02-02 10:28:09,553 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:09,553 INFO L82 PathProgramCache]: Analyzing trace with hash 615978274, now seen corresponding path program 1 times [2018-02-02 10:28:09,554 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:09,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 10:28:10,056 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:28:10,060 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:28:10,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:28:10 BoogieIcfgContainer [2018-02-02 10:28:10,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:28:10,061 INFO L168 Benchmark]: Toolchain (without parser) took 51316.50 ms. Allocated memory was 385.9 MB in the beginning and 1.2 GB in the end (delta: 852.5 MB). Free memory was 339.9 MB in the beginning and 1.1 GB in the end (delta: -717.7 MB). Peak memory consumption was 134.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:28:10,062 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 385.9 MB. Free memory is still 346.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:28:10,062 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.72 ms. Allocated memory is still 385.9 MB. Free memory was 339.9 MB in the beginning and 327.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:28:10,062 INFO L168 Benchmark]: Boogie Preprocessor took 32.68 ms. Allocated memory is still 385.9 MB. Free memory was 327.9 MB in the beginning and 326.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:28:10,062 INFO L168 Benchmark]: RCFGBuilder took 363.29 ms. Allocated memory is still 385.9 MB. Free memory was 326.6 MB in the beginning and 293.4 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:28:10,063 INFO L168 Benchmark]: TraceAbstraction took 50745.06 ms. Allocated memory was 385.9 MB in the beginning and 1.2 GB in the end (delta: 852.5 MB). Free memory was 293.4 MB in the beginning and 1.1 GB in the end (delta: -764.2 MB). Peak memory consumption was 88.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:28:10,064 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.11 ms. Allocated memory is still 385.9 MB. Free memory is still 346.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 172.72 ms. Allocated memory is still 385.9 MB. Free memory was 339.9 MB in the beginning and 327.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.68 ms. Allocated memory is still 385.9 MB. Free memory was 327.9 MB in the beginning and 326.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 363.29 ms. Allocated memory is still 385.9 MB. Free memory was 326.6 MB in the beginning and 293.4 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50745.06 ms. Allocated memory was 385.9 MB in the beginning and 1.2 GB in the end (delta: 852.5 MB). Free memory was 293.4 MB in the beginning and 1.1 GB in the end (delta: -764.2 MB). Peak memory consumption was 88.3 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 989). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 113 locations, 47 error locations. TIMEOUT Result, 50.7s OverallTime, 71 OverallIterations, 3 TraceHistogramMax, 32.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5101 SDtfs, 21600 SDslu, 32431 SDs, 0 SdLazy, 37928 SolverSat, 2856 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1973 GetRequests, 146 SyntacticMatches, 146 SemanticMatches, 1681 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10598 ImplicationChecksByTransitivity, 26.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=577occurred in iteration=69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 147/690 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, 70 MinimizatonAttempts, 2412 StatesRemovedByMinimization, 70 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 3218 NumberOfCodeBlocks, 3218 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 3148 ConstructedInterpolants, 0 QuantifiedInterpolants, 3265660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 70 InterpolantComputations, 26 PerfectInterpolantSequences, 147/690 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/dll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-28-10-070.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-28-10-070.csv Completed graceful shutdown