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/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:00:22,567 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:00:22,568 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:00:22,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:00:22,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:00:22,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:00:22,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:00:22,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:00:22,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:00:22,587 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:00:22,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:00:22,588 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:00:22,588 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:00:22,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:00:22,590 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:00:22,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:00:22,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:00:22,595 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:00:22,596 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:00:22,597 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:00:22,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:00:22,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:00:22,599 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:00:22,600 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:00:22,600 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:00:22,601 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:00:22,602 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:00:22,602 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:00:22,602 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:00:22,602 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:00:22,603 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:00:22,603 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:00:22,614 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:00:22,614 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:00:22,615 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:00:22,615 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:00:22,615 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:00:22,616 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:00:22,616 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:00:22,616 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:00:22,616 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:00:22,616 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:00:22,616 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:00:22,617 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:00:22,617 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:00:22,617 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:00:22,617 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:00:22,617 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:00:22,617 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:00:22,618 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:00:22,618 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:00:22,618 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:00:22,618 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:00:22,618 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:00:22,618 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:00:22,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:00:22,658 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:00:22,661 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:00:22,662 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:00:22,663 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:00:22,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-02-02 10:00:22,790 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:00:22,792 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:00:22,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:00:22,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:00:22,796 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:00:22,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:00:22" (1/1) ... [2018-02-02 10:00:22,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e286d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:22, skipping insertion in model container [2018-02-02 10:00:22,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:00:22" (1/1) ... [2018-02-02 10:00:22,809 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:00:22,835 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:00:22,932 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:00:22,948 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:00:22,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:22 WrapperNode [2018-02-02 10:00:22,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:00:22,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:00:22,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:00:22,954 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:00:22,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:22" (1/1) ... [2018-02-02 10:00:22,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:22" (1/1) ... [2018-02-02 10:00:22,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:22" (1/1) ... [2018-02-02 10:00:22,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:22" (1/1) ... [2018-02-02 10:00:22,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:22" (1/1) ... [2018-02-02 10:00:22,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:22" (1/1) ... [2018-02-02 10:00:22,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:22" (1/1) ... [2018-02-02 10:00:22,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:00:22,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:00:22,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:00:22,983 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:00:22,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:22" (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:00:23,018 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:00:23,018 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:00:23,019 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:00:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:00:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:00:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:00:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:00:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:00:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:00:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:00:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:00:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:00:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:00:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:00:23,378 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:00:23,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:00:23 BoogieIcfgContainer [2018-02-02 10:00:23,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:00:23,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:00:23,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:00:23,383 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:00:23,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:00:22" (1/3) ... [2018-02-02 10:00:23,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b60936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:00:23, skipping insertion in model container [2018-02-02 10:00:23,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:22" (2/3) ... [2018-02-02 10:00:23,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b60936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:00:23, skipping insertion in model container [2018-02-02 10:00:23,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:00:23" (3/3) ... [2018-02-02 10:00:23,386 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_cnstr_true-valid-memsafety_false-termination.i [2018-02-02 10:00:23,391 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:00:23,396 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-02 10:00:23,419 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:00:23,419 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:00:23,419 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:00:23,419 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:00:23,420 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:00:23,420 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:00:23,420 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:00:23,420 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:00:23,421 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:00:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-02-02 10:00:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:00:23,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:23,438 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:23,439 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:23,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1341839433, now seen corresponding path program 1 times [2018-02-02 10:00:23,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:23,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:23,542 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:00:23,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:23,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:00:23,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:23,545 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:00:23,545 INFO L182 omatonBuilderFactory]: Interpolants [133#true, 134#false, 135#(= 1 (select |#valid| |main_#t~malloc0.base|)), 136#(= 1 (select |#valid| main_~root~0.base))] [2018-02-02 10:00:23,546 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:00:23,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:00:23,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:00:23,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:00:23,556 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 4 states. [2018-02-02 10:00:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:23,813 INFO L93 Difference]: Finished difference Result 174 states and 193 transitions. [2018-02-02 10:00:23,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:00:23,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:00:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:23,823 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:00:23,824 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 10:00:23,825 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:00:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 10:00:23,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 125. [2018-02-02 10:00:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 10:00:23,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-02-02 10:00:23,852 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 8 [2018-02-02 10:00:23,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:23,852 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-02-02 10:00:23,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:00:23,852 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-02-02 10:00:23,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:00:23,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:23,853 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:23,853 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:23,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1341839434, now seen corresponding path program 1 times [2018-02-02 10:00:23,853 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:23,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:23,903 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:00:23,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:23,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:00:23,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:23,903 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:00:23,903 INFO L182 omatonBuilderFactory]: Interpolants [438#true, 439#false, 440#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 441#(and (= (select |#length| main_~root~0.base) 8) (= main_~root~0.offset 0))] [2018-02-02 10:00:23,903 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:00:23,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:00:23,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:00:23,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:00:23,905 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 4 states. [2018-02-02 10:00:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:24,008 INFO L93 Difference]: Finished difference Result 165 states and 183 transitions. [2018-02-02 10:00:24,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:00:24,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:00:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:24,011 INFO L225 Difference]: With dead ends: 165 [2018-02-02 10:00:24,011 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 10:00:24,012 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:00:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 10:00:24,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 123. [2018-02-02 10:00:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:00:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2018-02-02 10:00:24,020 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 8 [2018-02-02 10:00:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:24,020 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2018-02-02 10:00:24,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:00:24,021 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2018-02-02 10:00:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:00:24,021 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:24,021 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:24,021 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:24,021 INFO L82 PathProgramCache]: Analyzing trace with hash 557054198, now seen corresponding path program 1 times [2018-02-02 10:00:24,022 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:24,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:24,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:00:24,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:24,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:00:24,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:24,063 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:00:24,063 INFO L182 omatonBuilderFactory]: Interpolants [732#true, 733#false, 734#(= 1 (select |#valid| main_~root~0.base)), 735#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 10:00:24,063 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:00:24,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:00:24,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:00:24,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:00:24,064 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 4 states. [2018-02-02 10:00:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:24,189 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2018-02-02 10:00:24,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:00:24,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 10:00:24,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:24,191 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:00:24,191 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 10:00:24,191 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:00:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 10:00:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 113. [2018-02-02 10:00:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 10:00:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2018-02-02 10:00:24,197 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 14 [2018-02-02 10:00:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:24,198 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2018-02-02 10:00:24,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:00:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2018-02-02 10:00:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:00:24,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:24,199 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:24,199 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:24,199 INFO L82 PathProgramCache]: Analyzing trace with hash 557054199, now seen corresponding path program 1 times [2018-02-02 10:00:24,200 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:24,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:24,261 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:00:24,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:24,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:00:24,262 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:24,262 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:00:24,262 INFO L182 omatonBuilderFactory]: Interpolants [1008#(and (= 0 main_~root~0.offset) (= 8 (select |#length| main_~root~0.base))), 1009#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8)), 1005#true, 1006#false, 1007#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))] [2018-02-02 10:00:24,263 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:00:24,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:00:24,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:00:24,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:00:24,263 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 5 states. [2018-02-02 10:00:24,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:24,499 INFO L93 Difference]: Finished difference Result 233 states and 265 transitions. [2018-02-02 10:00:24,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:00:24,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:00:24,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:24,501 INFO L225 Difference]: With dead ends: 233 [2018-02-02 10:00:24,501 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 10:00:24,501 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:00:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 10:00:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 182. [2018-02-02 10:00:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 10:00:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 240 transitions. [2018-02-02 10:00:24,510 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 240 transitions. Word has length 14 [2018-02-02 10:00:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:24,511 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 240 transitions. [2018-02-02 10:00:24,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:00:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 240 transitions. [2018-02-02 10:00:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:00:24,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:24,511 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:24,512 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:24,512 INFO L82 PathProgramCache]: Analyzing trace with hash -505191267, now seen corresponding path program 1 times [2018-02-02 10:00:24,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:24,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:24,552 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:00:24,552 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:24,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:00:24,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:24,552 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:00:24,553 INFO L182 omatonBuilderFactory]: Interpolants [1431#true, 1432#false, 1433#(not (= 0 |main_#t~malloc0.base|)), 1434#(not (= 0 main_~root~0.base))] [2018-02-02 10:00:24,553 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:00:24,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:00:24,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:00:24,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:00:24,553 INFO L87 Difference]: Start difference. First operand 182 states and 240 transitions. Second operand 4 states. [2018-02-02 10:00:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:24,568 INFO L93 Difference]: Finished difference Result 195 states and 238 transitions. [2018-02-02 10:00:24,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:00:24,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 10:00:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:24,570 INFO L225 Difference]: With dead ends: 195 [2018-02-02 10:00:24,570 INFO L226 Difference]: Without dead ends: 195 [2018-02-02 10:00:24,570 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:00:24,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-02 10:00:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 182. [2018-02-02 10:00:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 10:00:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 238 transitions. [2018-02-02 10:00:24,578 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 238 transitions. Word has length 17 [2018-02-02 10:00:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:24,578 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 238 transitions. [2018-02-02 10:00:24,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:00:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2018-02-02 10:00:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:00:24,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:24,579 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:00:24,579 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:24,579 INFO L82 PathProgramCache]: Analyzing trace with hash -605576120, now seen corresponding path program 1 times [2018-02-02 10:00:24,580 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:24,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:24,602 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:00:24,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:24,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:00:24,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:24,603 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:00:24,603 INFO L182 omatonBuilderFactory]: Interpolants [1814#true, 1815#false, 1816#|main_#t~short30|] [2018-02-02 10:00:24,603 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:00:24,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:00:24,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:00:24,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:00:24,604 INFO L87 Difference]: Start difference. First operand 182 states and 238 transitions. Second operand 3 states. [2018-02-02 10:00:24,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:24,608 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2018-02-02 10:00:24,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:00:24,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-02-02 10:00:24,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:24,609 INFO L225 Difference]: With dead ends: 185 [2018-02-02 10:00:24,609 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 10:00:24,610 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:00:24,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 10:00:24,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-02-02 10:00:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 10:00:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 241 transitions. [2018-02-02 10:00:24,615 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 241 transitions. Word has length 22 [2018-02-02 10:00:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:24,615 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 241 transitions. [2018-02-02 10:00:24,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:00:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2018-02-02 10:00:24,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:00:24,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:24,620 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] [2018-02-02 10:00:24,620 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:24,621 INFO L82 PathProgramCache]: Analyzing trace with hash 927704743, now seen corresponding path program 1 times [2018-02-02 10:00:24,621 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:24,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:24,646 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:00:24,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:24,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:00:24,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:24,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:00:24,647 INFO L182 omatonBuilderFactory]: Interpolants [2187#true, 2188#false, 2189#(not |main_#t~short6|)] [2018-02-02 10:00:24,647 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:00:24,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:00:24,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:00:24,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:00:24,648 INFO L87 Difference]: Start difference. First operand 185 states and 241 transitions. Second operand 3 states. [2018-02-02 10:00:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:24,652 INFO L93 Difference]: Finished difference Result 187 states and 243 transitions. [2018-02-02 10:00:24,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:00:24,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-02-02 10:00:24,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:24,653 INFO L225 Difference]: With dead ends: 187 [2018-02-02 10:00:24,653 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 10:00:24,654 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:00:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 10:00:24,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-02-02 10:00:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-02-02 10:00:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 243 transitions. [2018-02-02 10:00:24,657 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 243 transitions. Word has length 22 [2018-02-02 10:00:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:24,657 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 243 transitions. [2018-02-02 10:00:24,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:00:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 243 transitions. [2018-02-02 10:00:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:00:24,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:24,658 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] [2018-02-02 10:00:24,658 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:24,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2088156413, now seen corresponding path program 1 times [2018-02-02 10:00:24,659 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:24,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:24,684 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:00:24,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:24,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:00:24,685 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:24,685 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:00:24,685 INFO L182 omatonBuilderFactory]: Interpolants [2564#true, 2565#false, 2566#(and (= main_~pred~0.base 0) (= main_~pred~0.offset 0))] [2018-02-02 10:00:24,686 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:00:24,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:00:24,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:00:24,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:00:24,686 INFO L87 Difference]: Start difference. First operand 187 states and 243 transitions. Second operand 3 states. [2018-02-02 10:00:24,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:24,698 INFO L93 Difference]: Finished difference Result 201 states and 251 transitions. [2018-02-02 10:00:24,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:00:24,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-02-02 10:00:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:24,699 INFO L225 Difference]: With dead ends: 201 [2018-02-02 10:00:24,699 INFO L226 Difference]: Without dead ends: 201 [2018-02-02 10:00:24,699 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:00:24,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-02 10:00:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2018-02-02 10:00:24,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-02 10:00:24,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 243 transitions. [2018-02-02 10:00:24,704 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 243 transitions. Word has length 24 [2018-02-02 10:00:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:24,704 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 243 transitions. [2018-02-02 10:00:24,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:00:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 243 transitions. [2018-02-02 10:00:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:00:24,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:24,705 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] [2018-02-02 10:00:24,705 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:24,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1439697764, now seen corresponding path program 1 times [2018-02-02 10:00:24,706 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:24,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:24,804 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:00:24,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:24,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:00:24,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:24,805 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:00:24,805 INFO L182 omatonBuilderFactory]: Interpolants [2960#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset))), 2961#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 2962#(and (= |main_#t~mem4.offset| 0) (= 0 |main_#t~mem4.base|)), 2963#(not |main_#t~short6|), 2958#true, 2959#false] [2018-02-02 10:00:24,806 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:00:24,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:00:24,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:00:24,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:00:24,806 INFO L87 Difference]: Start difference. First operand 190 states and 243 transitions. Second operand 6 states. [2018-02-02 10:00:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:24,953 INFO L93 Difference]: Finished difference Result 290 states and 358 transitions. [2018-02-02 10:00:24,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:00:24,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 10:00:24,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:24,955 INFO L225 Difference]: With dead ends: 290 [2018-02-02 10:00:24,955 INFO L226 Difference]: Without dead ends: 290 [2018-02-02 10:00:24,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:00:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-02-02 10:00:24,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 206. [2018-02-02 10:00:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 10:00:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 264 transitions. [2018-02-02 10:00:24,958 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 264 transitions. Word has length 24 [2018-02-02 10:00:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:24,959 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 264 transitions. [2018-02-02 10:00:24,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:00:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 264 transitions. [2018-02-02 10:00:24,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:00:24,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:24,960 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:24,960 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:24,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1566782653, now seen corresponding path program 1 times [2018-02-02 10:00:24,960 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:24,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:24,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:00:24,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:24,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:00:24,994 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:24,994 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:00:24,994 INFO L182 omatonBuilderFactory]: Interpolants [3466#true, 3467#false, 3468#(= 1 (select |#valid| |main_#t~malloc13.base|)), 3469#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 3470#(= 1 (select |#valid| |main_#t~mem15.base|))] [2018-02-02 10:00:24,994 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:00:24,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:00:24,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:00:24,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:00:24,995 INFO L87 Difference]: Start difference. First operand 206 states and 264 transitions. Second operand 5 states. [2018-02-02 10:00:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:25,183 INFO L93 Difference]: Finished difference Result 329 states and 412 transitions. [2018-02-02 10:00:25,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:00:25,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 10:00:25,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:25,184 INFO L225 Difference]: With dead ends: 329 [2018-02-02 10:00:25,184 INFO L226 Difference]: Without dead ends: 329 [2018-02-02 10:00:25,184 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:00:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-02 10:00:25,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 205. [2018-02-02 10:00:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 10:00:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 262 transitions. [2018-02-02 10:00:25,187 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 262 transitions. Word has length 25 [2018-02-02 10:00:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:25,187 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 262 transitions. [2018-02-02 10:00:25,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:00:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 262 transitions. [2018-02-02 10:00:25,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:00:25,187 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:25,187 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:25,187 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:25,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1566782654, now seen corresponding path program 1 times [2018-02-02 10:00:25,188 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:25,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:25,242 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:00:25,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:25,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:00:25,242 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:25,242 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:00:25,242 INFO L182 omatonBuilderFactory]: Interpolants [4011#true, 4012#false, 4013#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 4014#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 4015#(and (= (select |#length| |main_#t~mem15.base|) 8) (= |main_#t~mem15.offset| 0))] [2018-02-02 10:00:25,243 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:00:25,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:00:25,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:00:25,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:00:25,243 INFO L87 Difference]: Start difference. First operand 205 states and 262 transitions. Second operand 5 states. [2018-02-02 10:00:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:25,414 INFO L93 Difference]: Finished difference Result 364 states and 469 transitions. [2018-02-02 10:00:25,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:00:25,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 10:00:25,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:25,416 INFO L225 Difference]: With dead ends: 364 [2018-02-02 10:00:25,416 INFO L226 Difference]: Without dead ends: 364 [2018-02-02 10:00:25,416 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:00:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-02-02 10:00:25,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 204. [2018-02-02 10:00:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 10:00:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 260 transitions. [2018-02-02 10:00:25,420 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 260 transitions. Word has length 25 [2018-02-02 10:00:25,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:25,420 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 260 transitions. [2018-02-02 10:00:25,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:00:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 260 transitions. [2018-02-02 10:00:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:00:25,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:25,421 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] [2018-02-02 10:00:25,421 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:25,422 INFO L82 PathProgramCache]: Analyzing trace with hash -554334541, now seen corresponding path program 1 times [2018-02-02 10:00:25,422 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:25,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:25,489 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:00:25,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:25,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:00:25,490 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:25,490 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:00:25,490 INFO L182 omatonBuilderFactory]: Interpolants [4592#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset))), 4593#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 4594#(and (= 0 |main_#t~mem28.offset|) (= 0 |main_#t~mem28.base|)), 4595#(not |main_#t~short30|), 4590#true, 4591#false] [2018-02-02 10:00:25,490 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:00:25,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:00:25,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:00:25,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:00:25,491 INFO L87 Difference]: Start difference. First operand 204 states and 260 transitions. Second operand 6 states. [2018-02-02 10:00:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:25,629 INFO L93 Difference]: Finished difference Result 287 states and 352 transitions. [2018-02-02 10:00:25,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:00:25,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 10:00:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:25,630 INFO L225 Difference]: With dead ends: 287 [2018-02-02 10:00:25,630 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 10:00:25,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:00:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 10:00:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 242. [2018-02-02 10:00:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 10:00:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 319 transitions. [2018-02-02 10:00:25,633 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 319 transitions. Word has length 26 [2018-02-02 10:00:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:25,633 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 319 transitions. [2018-02-02 10:00:25,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:00:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 319 transitions. [2018-02-02 10:00:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:00:25,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:25,634 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] [2018-02-02 10:00:25,634 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:25,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1703794537, now seen corresponding path program 1 times [2018-02-02 10:00:25,635 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:25,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:00:25,707 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:00:25,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:25,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:00:25,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:25,709 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:00:25,709 INFO L182 omatonBuilderFactory]: Interpolants [5136#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 5137#(and (= (store |#valid| main_~root~0.base 0) |old(#valid)|) (not (= 0 main_~root~0.base))), 5138#(and (not (= 0 main_~n~0.base)) (= |old(#valid)| (store |#valid| main_~n~0.base 0))), 5133#true, 5134#false, 5135#(= |#valid| |old(#valid)|)] [2018-02-02 10:00:25,709 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:00:25,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:00:25,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:00:25,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:00:25,710 INFO L87 Difference]: Start difference. First operand 242 states and 319 transitions. Second operand 6 states. [2018-02-02 10:00:25,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:25,920 INFO L93 Difference]: Finished difference Result 341 states and 436 transitions. [2018-02-02 10:00:25,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:00:25,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-02 10:00:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:25,921 INFO L225 Difference]: With dead ends: 341 [2018-02-02 10:00:25,921 INFO L226 Difference]: Without dead ends: 339 [2018-02-02 10:00:25,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:00:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-02-02 10:00:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 251. [2018-02-02 10:00:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-02 10:00:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 329 transitions. [2018-02-02 10:00:25,926 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 329 transitions. Word has length 28 [2018-02-02 10:00:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:25,926 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 329 transitions. [2018-02-02 10:00:25,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:00:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 329 transitions. [2018-02-02 10:00:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:00:25,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:25,927 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] [2018-02-02 10:00:25,927 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:25,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1703794284, now seen corresponding path program 1 times [2018-02-02 10:00:25,928 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:25,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:25,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:25,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:00:25,959 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:25,960 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:00:25,960 INFO L182 omatonBuilderFactory]: Interpolants [5741#true, 5742#false, 5743#(and (= main_~root~0.base 0) (= main_~root~0.offset 0))] [2018-02-02 10:00:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:25,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:00:25,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:00:25,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:00:25,961 INFO L87 Difference]: Start difference. First operand 251 states and 329 transitions. Second operand 3 states. [2018-02-02 10:00:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:25,969 INFO L93 Difference]: Finished difference Result 225 states and 278 transitions. [2018-02-02 10:00:25,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:00:25,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-02 10:00:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:25,970 INFO L225 Difference]: With dead ends: 225 [2018-02-02 10:00:25,970 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 10:00:25,970 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:00:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 10:00:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2018-02-02 10:00:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 10:00:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 274 transitions. [2018-02-02 10:00:25,975 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 274 transitions. Word has length 28 [2018-02-02 10:00:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:25,975 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 274 transitions. [2018-02-02 10:00:25,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:00:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 274 transitions. [2018-02-02 10:00:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:00:25,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:25,976 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:25,976 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:25,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1964814354, now seen corresponding path program 1 times [2018-02-02 10:00:25,977 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:25,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:26,020 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:00:26,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:26,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:00:26,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:26,021 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:00:26,021 INFO L182 omatonBuilderFactory]: Interpolants [6192#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) |main_#t~short30|), 6193#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 6194#(and (= |main_#t~mem31.base| 0) (= |main_#t~mem31.offset| 0)), 6189#true, 6190#false, 6191#(and (= |main_#t~mem28.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem28.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)))] [2018-02-02 10:00:26,021 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:00:26,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:00:26,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:00:26,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:00:26,022 INFO L87 Difference]: Start difference. First operand 220 states and 274 transitions. Second operand 6 states. [2018-02-02 10:00:26,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:26,164 INFO L93 Difference]: Finished difference Result 232 states and 287 transitions. [2018-02-02 10:00:26,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:00:26,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-02 10:00:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:26,165 INFO L225 Difference]: With dead ends: 232 [2018-02-02 10:00:26,165 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 10:00:26,166 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:00:26,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 10:00:26,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 225. [2018-02-02 10:00:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 10:00:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 280 transitions. [2018-02-02 10:00:26,169 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 280 transitions. Word has length 28 [2018-02-02 10:00:26,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:26,170 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 280 transitions. [2018-02-02 10:00:26,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:00:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 280 transitions. [2018-02-02 10:00:26,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:00:26,171 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:26,171 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] [2018-02-02 10:00:26,171 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:26,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1959088716, now seen corresponding path program 1 times [2018-02-02 10:00:26,172 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:26,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:26,271 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:00:26,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:26,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:00:26,271 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:26,271 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:00:26,272 INFO L182 omatonBuilderFactory]: Interpolants [6658#true, 6659#false, 6660#(= 0 |main_#t~malloc0.offset|), 6661#(= main_~root~0.offset 0), 6662#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 6663#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 6664#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= |main_#t~mem29.base| 0) (= |main_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 6665#(and (= main_~n~0.offset 0) (not |main_#t~short30|))] [2018-02-02 10:00:26,272 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:00:26,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:00:26,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:00:26,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:00:26,272 INFO L87 Difference]: Start difference. First operand 225 states and 280 transitions. Second operand 8 states. [2018-02-02 10:00:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:26,618 INFO L93 Difference]: Finished difference Result 333 states and 390 transitions. [2018-02-02 10:00:26,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:00:26,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-02 10:00:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:26,619 INFO L225 Difference]: With dead ends: 333 [2018-02-02 10:00:26,619 INFO L226 Difference]: Without dead ends: 322 [2018-02-02 10:00:26,619 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:00:26,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-02-02 10:00:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 273. [2018-02-02 10:00:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-02 10:00:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 352 transitions. [2018-02-02 10:00:26,625 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 352 transitions. Word has length 28 [2018-02-02 10:00:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:26,625 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 352 transitions. [2018-02-02 10:00:26,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:00:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 352 transitions. [2018-02-02 10:00:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:00:26,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:26,626 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] [2018-02-02 10:00:26,626 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:26,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1682499776, now seen corresponding path program 1 times [2018-02-02 10:00:26,627 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:26,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:26,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:26,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:00:26,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:26,733 INFO L182 omatonBuilderFactory]: Interpolants [7284#true, 7285#false, 7286#(= (select |#valid| main_~root~0.base) 1), 7287#(= (select |#valid| main_~n~0.base) 1), 7288#(and (= 1 (select |#valid| |main_#t~malloc13.base|)) (not (= main_~n~0.base |main_#t~malloc13.base|))), 7289#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 7290#(and (not (= main_~n~0.base |main_#t~mem15.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 7291#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 7292#(= 1 (select |#valid| |main_#t~mem17.base|))] [2018-02-02 10:00:26,733 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:00:26,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:00:26,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:00:26,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:00:26,733 INFO L87 Difference]: Start difference. First operand 273 states and 352 transitions. Second operand 9 states. [2018-02-02 10:00:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:27,162 INFO L93 Difference]: Finished difference Result 397 states and 514 transitions. [2018-02-02 10:00:27,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:00:27,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 10:00:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:27,163 INFO L225 Difference]: With dead ends: 397 [2018-02-02 10:00:27,163 INFO L226 Difference]: Without dead ends: 397 [2018-02-02 10:00:27,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:00:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-02-02 10:00:27,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 272. [2018-02-02 10:00:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-02 10:00:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 349 transitions. [2018-02-02 10:00:27,167 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 349 transitions. Word has length 28 [2018-02-02 10:00:27,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:27,168 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 349 transitions. [2018-02-02 10:00:27,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:00:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 349 transitions. [2018-02-02 10:00:27,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:00:27,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:27,168 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] [2018-02-02 10:00:27,168 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:27,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1682499775, now seen corresponding path program 1 times [2018-02-02 10:00:27,169 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:27,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:27,258 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:00:27,258 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:27,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:00:27,258 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:27,258 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:00:27,259 INFO L182 omatonBuilderFactory]: Interpolants [7974#true, 7975#false, 7976#(= (select |#valid| main_~root~0.base) 1), 7977#(= (select |#valid| main_~n~0.base) 1), 7978#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 7979#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 7980#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 7981#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 7982#(and (= (select |#length| |main_#t~mem17.base|) 8) (= |main_#t~mem17.offset| 0))] [2018-02-02 10:00:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:27,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:00:27,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:00:27,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:00:27,259 INFO L87 Difference]: Start difference. First operand 272 states and 349 transitions. Second operand 9 states. [2018-02-02 10:00:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:27,654 INFO L93 Difference]: Finished difference Result 396 states and 511 transitions. [2018-02-02 10:00:27,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:00:27,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 10:00:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:27,656 INFO L225 Difference]: With dead ends: 396 [2018-02-02 10:00:27,656 INFO L226 Difference]: Without dead ends: 396 [2018-02-02 10:00:27,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:00:27,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-02-02 10:00:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 271. [2018-02-02 10:00:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-02 10:00:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 346 transitions. [2018-02-02 10:00:27,661 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 346 transitions. Word has length 28 [2018-02-02 10:00:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:27,661 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 346 transitions. [2018-02-02 10:00:27,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:00:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 346 transitions. [2018-02-02 10:00:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:00:27,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:27,662 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] [2018-02-02 10:00:27,662 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:27,662 INFO L82 PathProgramCache]: Analyzing trace with hash -546988646, now seen corresponding path program 1 times [2018-02-02 10:00:27,663 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:27,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:27,689 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:00:27,689 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:27,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:00:27,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:27,690 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:00:27,690 INFO L182 omatonBuilderFactory]: Interpolants [8662#true, 8663#false, 8664#(= 1 (select |#valid| |main_#t~malloc22.base|)), 8665#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 8666#(= 1 (select |#valid| |main_#t~mem24.base|))] [2018-02-02 10:00:27,690 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:00:27,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:00:27,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:00:27,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:00:27,691 INFO L87 Difference]: Start difference. First operand 271 states and 346 transitions. Second operand 5 states. [2018-02-02 10:00:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:27,827 INFO L93 Difference]: Finished difference Result 396 states and 495 transitions. [2018-02-02 10:00:27,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:00:27,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 10:00:27,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:27,828 INFO L225 Difference]: With dead ends: 396 [2018-02-02 10:00:27,828 INFO L226 Difference]: Without dead ends: 396 [2018-02-02 10:00:27,829 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:00:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-02-02 10:00:27,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 270. [2018-02-02 10:00:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-02 10:00:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 344 transitions. [2018-02-02 10:00:27,833 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 344 transitions. Word has length 29 [2018-02-02 10:00:27,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:27,834 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 344 transitions. [2018-02-02 10:00:27,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:00:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 344 transitions. [2018-02-02 10:00:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:00:27,834 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:27,834 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] [2018-02-02 10:00:27,834 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:27,834 INFO L82 PathProgramCache]: Analyzing trace with hash -546988645, now seen corresponding path program 1 times [2018-02-02 10:00:27,835 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:27,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:27,878 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:00:27,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:27,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:00:27,878 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:27,879 INFO L182 omatonBuilderFactory]: Interpolants [9339#true, 9340#false, 9341#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= 0 |main_#t~malloc22.offset|)), 9342#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 9343#(and (= (select |#length| |main_#t~mem24.base|) 8) (= |main_#t~mem24.offset| 0))] [2018-02-02 10:00:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:27,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:00:27,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:00:27,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:00:27,879 INFO L87 Difference]: Start difference. First operand 270 states and 344 transitions. Second operand 5 states. [2018-02-02 10:00:28,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:28,049 INFO L93 Difference]: Finished difference Result 404 states and 502 transitions. [2018-02-02 10:00:28,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:00:28,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 10:00:28,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:28,051 INFO L225 Difference]: With dead ends: 404 [2018-02-02 10:00:28,051 INFO L226 Difference]: Without dead ends: 404 [2018-02-02 10:00:28,051 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:00:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-02-02 10:00:28,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 269. [2018-02-02 10:00:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-02 10:00:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 342 transitions. [2018-02-02 10:00:28,055 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 342 transitions. Word has length 29 [2018-02-02 10:00:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:28,056 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 342 transitions. [2018-02-02 10:00:28,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:00:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 342 transitions. [2018-02-02 10:00:28,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:00:28,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:28,056 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] [2018-02-02 10:00:28,056 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:28,057 INFO L82 PathProgramCache]: Analyzing trace with hash -232740570, now seen corresponding path program 1 times [2018-02-02 10:00:28,057 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:28,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:28,153 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:00:28,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:28,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:00:28,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:28,154 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:00:28,154 INFO L182 omatonBuilderFactory]: Interpolants [10023#true, 10024#false, 10025#(= (select |#valid| main_~root~0.base) 1), 10026#(= (select |#valid| main_~n~0.base) 1), 10027#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 |main_#t~malloc22.offset|)), 10028#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 10029#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base |main_#t~mem24.base|))), 10030#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 10031#(and (= (select |#length| |main_#t~mem26.base|) 8) (= |main_#t~mem26.offset| 0))] [2018-02-02 10:00:28,154 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:00:28,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:00:28,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:00:28,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:00:28,155 INFO L87 Difference]: Start difference. First operand 269 states and 342 transitions. Second operand 9 states. [2018-02-02 10:00:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:28,456 INFO L93 Difference]: Finished difference Result 355 states and 459 transitions. [2018-02-02 10:00:28,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:00:28,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 10:00:28,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:28,457 INFO L225 Difference]: With dead ends: 355 [2018-02-02 10:00:28,457 INFO L226 Difference]: Without dead ends: 355 [2018-02-02 10:00:28,458 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:00:28,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-02 10:00:28,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 268. [2018-02-02 10:00:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-02 10:00:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 341 transitions. [2018-02-02 10:00:28,463 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 341 transitions. Word has length 32 [2018-02-02 10:00:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:28,463 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 341 transitions. [2018-02-02 10:00:28,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:00:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 341 transitions. [2018-02-02 10:00:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:00:28,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:28,464 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] [2018-02-02 10:00:28,464 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:28,464 INFO L82 PathProgramCache]: Analyzing trace with hash -232740571, now seen corresponding path program 1 times [2018-02-02 10:00:28,465 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:28,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:28,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:28,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:00:28,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:28,552 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:00:28,552 INFO L182 omatonBuilderFactory]: Interpolants [10672#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 10673#(and (not (= main_~n~0.base |main_#t~mem24.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 10674#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 10675#(= 1 (select |#valid| |main_#t~mem26.base|)), 10667#true, 10668#false, 10669#(= (select |#valid| main_~root~0.base) 1), 10670#(= (select |#valid| main_~n~0.base) 1), 10671#(and (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 1 (select |#valid| |main_#t~malloc22.base|)))] [2018-02-02 10:00:28,552 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:00:28,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:00:28,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:00:28,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:00:28,553 INFO L87 Difference]: Start difference. First operand 268 states and 341 transitions. Second operand 9 states. [2018-02-02 10:00:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:28,904 INFO L93 Difference]: Finished difference Result 354 states and 458 transitions. [2018-02-02 10:00:28,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:00:28,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 10:00:28,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:28,905 INFO L225 Difference]: With dead ends: 354 [2018-02-02 10:00:28,906 INFO L226 Difference]: Without dead ends: 354 [2018-02-02 10:00:28,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:00:28,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-02-02 10:00:28,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 267. [2018-02-02 10:00:28,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-02 10:00:28,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 340 transitions. [2018-02-02 10:00:28,910 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 340 transitions. Word has length 32 [2018-02-02 10:00:28,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:28,911 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 340 transitions. [2018-02-02 10:00:28,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:00:28,911 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 340 transitions. [2018-02-02 10:00:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:00:28,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:28,912 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:28,912 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:28,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1058981609, now seen corresponding path program 1 times [2018-02-02 10:00:28,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:28,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:29,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:29,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:00:29,256 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:29,256 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:00:29,256 INFO L182 omatonBuilderFactory]: Interpolants [11309#true, 11310#false, 11311#(= 0 (select |#valid| 0)), 11312#(and (= 0 (select |#valid| 0)) (= (select |#valid| main_~root~0.base) 1)), 11313#(and (= main_~root~0.base main_~n~0.base) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~root~0.base)) (= main_~n~0.offset main_~root~0.offset)), 11314#(and (= main_~root~0.base main_~n~0.base) (= 0 (select |#valid| 0)) (= |main_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| main_~root~0.base)) (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_#t~mem4.base|) (= main_~n~0.offset main_~root~0.offset)), 11315#(and (or |main_#t~short6| (and (= main_~root~0.base main_~n~0.base) (= 0 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset))) (= (select |#valid| main_~n~0.base) 1)), 11316#(and (= main_~root~0.base main_~n~0.base) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~root~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 11317#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| 0))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 11318#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| 0))) (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 11319#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| 0))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem24.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 11320#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) (or (= 1 (select |#valid| 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)))), 11321#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 11322#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 11323#(and (= 0 |main_#t~mem4.base|) (or (= |main_#t~mem4.offset| 0) (= 1 (select |#valid| 0))) (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_#t~mem4.base|)), 11324#(or (not |main_#t~short6|) (and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 11325#(and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 11326#(and (= 0 |main_#t~mem8.base|) (= 1 (select |#valid| 0))), 11327#(= (select |#valid| main_~n~0.base) 1)] [2018-02-02 10:00:29,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:29,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:00:29,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:00:29,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:00:29,257 INFO L87 Difference]: Start difference. First operand 267 states and 340 transitions. Second operand 19 states. [2018-02-02 10:00:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:30,114 INFO L93 Difference]: Finished difference Result 624 states and 804 transitions. [2018-02-02 10:00:30,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:00:30,115 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-02 10:00:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:30,116 INFO L225 Difference]: With dead ends: 624 [2018-02-02 10:00:30,116 INFO L226 Difference]: Without dead ends: 624 [2018-02-02 10:00:30,117 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:00:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-02-02 10:00:30,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 305. [2018-02-02 10:00:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-02-02 10:00:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 388 transitions. [2018-02-02 10:00:30,124 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 388 transitions. Word has length 48 [2018-02-02 10:00:30,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:30,124 INFO L432 AbstractCegarLoop]: Abstraction has 305 states and 388 transitions. [2018-02-02 10:00:30,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:00:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 388 transitions. [2018-02-02 10:00:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:00:30,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:30,125 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:30,125 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:30,126 INFO L82 PathProgramCache]: Analyzing trace with hash 744039657, now seen corresponding path program 1 times [2018-02-02 10:00:30,126 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:30,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:30,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:30,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:00:30,265 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:30,266 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:00:30,266 INFO L182 omatonBuilderFactory]: Interpolants [12297#true, 12298#false, 12299#(= (select |#valid| main_~root~0.base) 1), 12300#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 12301#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| |main_#t~malloc13.base|)) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|))), 12302#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base)), 12303#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem15.base|))), 12304#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base)), 12305#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= main_~n~0.base main_~root~0.base)), 12306#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 12307#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 12308#(= 1 (select |#valid| |main_#t~mem8.base|)), 12309#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 10:00:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:30,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:00:30,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:00:30,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:00:30,267 INFO L87 Difference]: Start difference. First operand 305 states and 388 transitions. Second operand 13 states. [2018-02-02 10:00:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:30,761 INFO L93 Difference]: Finished difference Result 703 states and 888 transitions. [2018-02-02 10:00:30,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:00:30,761 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 10:00:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:30,763 INFO L225 Difference]: With dead ends: 703 [2018-02-02 10:00:30,763 INFO L226 Difference]: Without dead ends: 703 [2018-02-02 10:00:30,763 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:00:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-02-02 10:00:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 353. [2018-02-02 10:00:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-02-02 10:00:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 460 transitions. [2018-02-02 10:00:30,767 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 460 transitions. Word has length 48 [2018-02-02 10:00:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:30,768 INFO L432 AbstractCegarLoop]: Abstraction has 353 states and 460 transitions. [2018-02-02 10:00:30,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:00:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 460 transitions. [2018-02-02 10:00:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:00:30,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:30,768 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:30,768 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:30,768 INFO L82 PathProgramCache]: Analyzing trace with hash 744039658, now seen corresponding path program 1 times [2018-02-02 10:00:30,769 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:30,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:30,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:30,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:00:30,898 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:30,898 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:00:30,898 INFO L182 omatonBuilderFactory]: Interpolants [13390#true, 13391#false, 13392#(= (select |#valid| main_~root~0.base) 1), 13393#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 13394#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 13395#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 13396#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 13397#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~root~0.offset)) (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset)))), 13398#(and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 13399#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))), 13400#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 13401#(and (= 0 |main_#t~mem8.offset|) (= 8 (select |#length| |main_#t~mem8.base|))), 13402#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8))] [2018-02-02 10:00:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:30,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:00:30,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:00:30,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:00:30,899 INFO L87 Difference]: Start difference. First operand 353 states and 460 transitions. Second operand 13 states. [2018-02-02 10:00:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:31,571 INFO L93 Difference]: Finished difference Result 779 states and 981 transitions. [2018-02-02 10:00:31,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:00:31,571 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 10:00:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:31,573 INFO L225 Difference]: With dead ends: 779 [2018-02-02 10:00:31,573 INFO L226 Difference]: Without dead ends: 779 [2018-02-02 10:00:31,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:00:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-02-02 10:00:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 385. [2018-02-02 10:00:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-02 10:00:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 500 transitions. [2018-02-02 10:00:31,577 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 500 transitions. Word has length 48 [2018-02-02 10:00:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:31,577 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 500 transitions. [2018-02-02 10:00:31,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:00:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 500 transitions. [2018-02-02 10:00:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:00:31,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:31,578 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:31,578 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:31,578 INFO L82 PathProgramCache]: Analyzing trace with hash 749765295, now seen corresponding path program 1 times [2018-02-02 10:00:31,579 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:31,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:31,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:31,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:00:31,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:31,735 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:00:31,736 INFO L182 omatonBuilderFactory]: Interpolants [14592#(= main_~root~0.offset 0), 14593#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 14594#(and (= |main_#t~mem19.offset| (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 14595#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)) (not |main_#t~short21|)), 14596#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 14597#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 14598#(and (= main_~n~0.offset 0) (= |main_#t~mem5.base| 0) (= |main_#t~mem5.offset| 0)), 14599#(and (= main_~n~0.offset 0) (not |main_#t~short6|)), 14589#true, 14590#false, 14591#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 10:00:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:31,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:00:31,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:00:31,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:00:31,736 INFO L87 Difference]: Start difference. First operand 385 states and 500 transitions. Second operand 11 states. [2018-02-02 10:00:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:32,221 INFO L93 Difference]: Finished difference Result 516 states and 644 transitions. [2018-02-02 10:00:32,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:00:32,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-02 10:00:32,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:32,263 INFO L225 Difference]: With dead ends: 516 [2018-02-02 10:00:32,263 INFO L226 Difference]: Without dead ends: 516 [2018-02-02 10:00:32,264 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:00:32,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-02-02 10:00:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 394. [2018-02-02 10:00:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-02-02 10:00:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 501 transitions. [2018-02-02 10:00:32,269 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 501 transitions. Word has length 48 [2018-02-02 10:00:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:32,270 INFO L432 AbstractCegarLoop]: Abstraction has 394 states and 501 transitions. [2018-02-02 10:00:32,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:00:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 501 transitions. [2018-02-02 10:00:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:00:32,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:32,270 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] [2018-02-02 10:00:32,271 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:32,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1350339336, now seen corresponding path program 1 times [2018-02-02 10:00:32,271 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:32,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:32,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:32,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:00:32,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:32,552 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:00:32,553 INFO L182 omatonBuilderFactory]: Interpolants [15536#true, 15537#false, 15538#(= (select |#valid| main_~root~0.base) 1), 15539#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 15540#(and (= main_~n~0.base main_~root~0.base) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= (select |#valid| main_~n~0.base) 1) (= |main_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 15541#(and (= (select |#valid| main_~n~0.base) 1) (or |main_#t~short6| (and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)))), 15542#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 15543#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 15544#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 15545#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 15546#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))), 15547#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 15548#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 15549#(and (= |main_#t~mem31.base| 0) (= |main_#t~mem31.offset| 0))] [2018-02-02 10:00:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:32,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:00:32,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:00:32,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:00:32,553 INFO L87 Difference]: Start difference. First operand 394 states and 501 transitions. Second operand 14 states. [2018-02-02 10:00:33,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:33,106 INFO L93 Difference]: Finished difference Result 731 states and 938 transitions. [2018-02-02 10:00:33,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:00:33,106 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-02 10:00:33,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:33,108 INFO L225 Difference]: With dead ends: 731 [2018-02-02 10:00:33,108 INFO L226 Difference]: Without dead ends: 731 [2018-02-02 10:00:33,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:00:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-02-02 10:00:33,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 471. [2018-02-02 10:00:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-02-02 10:00:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 621 transitions. [2018-02-02 10:00:33,116 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 621 transitions. Word has length 50 [2018-02-02 10:00:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:33,116 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 621 transitions. [2018-02-02 10:00:33,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:00:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 621 transitions. [2018-02-02 10:00:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:00:33,117 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:33,117 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] [2018-02-02 10:00:33,117 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:33,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1344613698, now seen corresponding path program 1 times [2018-02-02 10:00:33,118 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:33,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:00:33,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:33,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:00:33,177 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:33,177 INFO L182 omatonBuilderFactory]: Interpolants [16772#true, 16773#false, 16774#(and (= |main_#t~mem28.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem28.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 16775#(or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not |main_#t~short30|)), 16776#(or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 16777#(or (not (= 0 |main_#t~mem31.base|)) (not (= 0 |main_#t~mem31.offset|)))] [2018-02-02 10:00:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:00:33,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:00:33,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:00:33,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:00:33,178 INFO L87 Difference]: Start difference. First operand 471 states and 621 transitions. Second operand 6 states. [2018-02-02 10:00:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:33,259 INFO L93 Difference]: Finished difference Result 446 states and 568 transitions. [2018-02-02 10:00:33,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:00:33,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-02-02 10:00:33,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:33,261 INFO L225 Difference]: With dead ends: 446 [2018-02-02 10:00:33,261 INFO L226 Difference]: Without dead ends: 440 [2018-02-02 10:00:33,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:00:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-02-02 10:00:33,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 439. [2018-02-02 10:00:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-02-02 10:00:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 562 transitions. [2018-02-02 10:00:33,265 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 562 transitions. Word has length 50 [2018-02-02 10:00:33,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:33,265 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 562 transitions. [2018-02-02 10:00:33,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:00:33,265 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 562 transitions. [2018-02-02 10:00:33,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:00:33,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:33,266 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] [2018-02-02 10:00:33,266 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:33,266 INFO L82 PathProgramCache]: Analyzing trace with hash 933122808, now seen corresponding path program 1 times [2018-02-02 10:00:33,267 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:33,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:33,377 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:00:33,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:33,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:00:33,377 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:33,377 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:00:33,378 INFO L182 omatonBuilderFactory]: Interpolants [17669#true, 17670#false, 17671#(= (select |#valid| main_~root~0.base) 1), 17672#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 17673#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| |main_#t~malloc13.base|)) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|))), 17674#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base)), 17675#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem15.base|))), 17676#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base)), 17677#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= main_~n~0.base main_~root~0.base)), 17678#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 17679#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 17680#(= 1 (select |#valid| |main_#t~mem32.base|)), 17681#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 10:00:33,378 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:00:33,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:00:33,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:00:33,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:00:33,378 INFO L87 Difference]: Start difference. First operand 439 states and 562 transitions. Second operand 13 states. [2018-02-02 10:00:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:33,933 INFO L93 Difference]: Finished difference Result 930 states and 1185 transitions. [2018-02-02 10:00:33,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:00:33,933 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-02-02 10:00:33,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:33,935 INFO L225 Difference]: With dead ends: 930 [2018-02-02 10:00:33,935 INFO L226 Difference]: Without dead ends: 930 [2018-02-02 10:00:33,935 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:00:33,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2018-02-02 10:00:33,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 480. [2018-02-02 10:00:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-02-02 10:00:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 613 transitions. [2018-02-02 10:00:33,939 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 613 transitions. Word has length 50 [2018-02-02 10:00:33,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:33,940 INFO L432 AbstractCegarLoop]: Abstraction has 480 states and 613 transitions. [2018-02-02 10:00:33,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:00:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 613 transitions. [2018-02-02 10:00:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:00:33,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:33,940 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] [2018-02-02 10:00:33,940 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:33,940 INFO L82 PathProgramCache]: Analyzing trace with hash 933122809, now seen corresponding path program 1 times [2018-02-02 10:00:33,941 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:33,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:34,118 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:00:34,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:34,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:00:34,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:34,119 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:00:34,119 INFO L182 omatonBuilderFactory]: Interpolants [19114#true, 19115#false, 19116#(= (select |#valid| main_~root~0.base) 1), 19117#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 19118#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 19119#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 19120#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 19121#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~root~0.offset)) (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset)))), 19122#(and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 19123#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))), 19124#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 19125#(and (= 0 |main_#t~mem32.offset|) (= 8 (select |#length| |main_#t~mem32.base|))), 19126#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8))] [2018-02-02 10:00:34,119 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:00:34,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:00:34,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:00:34,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:00:34,120 INFO L87 Difference]: Start difference. First operand 480 states and 613 transitions. Second operand 13 states. [2018-02-02 10:00:34,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:34,821 INFO L93 Difference]: Finished difference Result 990 states and 1256 transitions. [2018-02-02 10:00:34,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:00:34,821 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-02-02 10:00:34,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:34,823 INFO L225 Difference]: With dead ends: 990 [2018-02-02 10:00:34,823 INFO L226 Difference]: Without dead ends: 990 [2018-02-02 10:00:34,823 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:00:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-02-02 10:00:34,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 505. [2018-02-02 10:00:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-02-02 10:00:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 656 transitions. [2018-02-02 10:00:34,829 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 656 transitions. Word has length 50 [2018-02-02 10:00:34,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:34,829 INFO L432 AbstractCegarLoop]: Abstraction has 505 states and 656 transitions. [2018-02-02 10:00:34,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:00:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 656 transitions. [2018-02-02 10:00:34,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:00:34,829 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:34,830 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, 1] [2018-02-02 10:00:34,830 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:34,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1247365230, now seen corresponding path program 1 times [2018-02-02 10:00:34,830 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:34,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:35,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:35,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:00:35,061 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:35,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:00:35,062 INFO L182 omatonBuilderFactory]: Interpolants [20642#true, 20643#false, 20644#(= 0 |main_#t~malloc0.offset|), 20645#(= main_~root~0.offset 0), 20646#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 20647#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset 0)), 20648#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (not (= |main_#t~malloc22.base| 0)) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~root~0.offset 0)), 20649#(and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 20650#(and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0)), 20651#(and (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)) 0)) (= main_~root~0.offset 0)), 20652#(and (not (= (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)) 0)) (= main_~root~0.offset 0)), 20653#(and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.offset 0)), 20654#(and (= main_~n~0.offset 0) (not (= |main_#t~mem29.base| 0))), 20655#(and (= main_~n~0.offset 0) |main_#t~short30|)] [2018-02-02 10:00:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:35,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:00:35,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:00:35,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:00:35,062 INFO L87 Difference]: Start difference. First operand 505 states and 656 transitions. Second operand 14 states. [2018-02-02 10:00:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:35,613 INFO L93 Difference]: Finished difference Result 1037 states and 1339 transitions. [2018-02-02 10:00:35,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:00:35,614 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-02-02 10:00:35,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:35,615 INFO L225 Difference]: With dead ends: 1037 [2018-02-02 10:00:35,616 INFO L226 Difference]: Without dead ends: 1037 [2018-02-02 10:00:35,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:00:35,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-02-02 10:00:35,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 627. [2018-02-02 10:00:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-02-02 10:00:35,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 819 transitions. [2018-02-02 10:00:35,622 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 819 transitions. Word has length 52 [2018-02-02 10:00:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:35,622 INFO L432 AbstractCegarLoop]: Abstraction has 627 states and 819 transitions. [2018-02-02 10:00:35,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:00:35,623 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 819 transitions. [2018-02-02 10:00:35,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:00:35,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:35,623 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, 1] [2018-02-02 10:00:35,624 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:35,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1879449273, now seen corresponding path program 1 times [2018-02-02 10:00:35,625 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:35,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:35,819 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:00:35,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:35,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:00:35,819 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:35,820 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:00:35,820 INFO L182 omatonBuilderFactory]: Interpolants [22348#true, 22349#false, 22350#(= 0 |main_#t~malloc0.offset|), 22351#(= main_~root~0.offset 0), 22352#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 22353#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 22354#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 1 (select |#valid| |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 22355#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 22356#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 22357#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= main_~root~0.offset 0)), 22358#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= main_~root~0.offset 0)), 22359#(and (= main_~n~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 22360#(= 1 (select |#valid| |main_#t~mem33.base|)), 22361#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 10:00:35,820 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:00:35,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:00:35,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:00:35,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:00:35,820 INFO L87 Difference]: Start difference. First operand 627 states and 819 transitions. Second operand 14 states. [2018-02-02 10:00:36,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:36,352 INFO L93 Difference]: Finished difference Result 1040 states and 1343 transitions. [2018-02-02 10:00:36,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:00:36,352 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-02-02 10:00:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:36,354 INFO L225 Difference]: With dead ends: 1040 [2018-02-02 10:00:36,354 INFO L226 Difference]: Without dead ends: 1040 [2018-02-02 10:00:36,354 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:00:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2018-02-02 10:00:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 639. [2018-02-02 10:00:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-02-02 10:00:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 833 transitions. [2018-02-02 10:00:36,361 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 833 transitions. Word has length 52 [2018-02-02 10:00:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:36,361 INFO L432 AbstractCegarLoop]: Abstraction has 639 states and 833 transitions. [2018-02-02 10:00:36,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:00:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 833 transitions. [2018-02-02 10:00:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:00:36,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:36,362 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, 1] [2018-02-02 10:00:36,362 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1879449274, now seen corresponding path program 1 times [2018-02-02 10:00:36,362 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:36,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:36,768 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:00:36,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:36,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:00:36,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:36,769 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:00:36,769 INFO L182 omatonBuilderFactory]: Interpolants [24071#true, 24072#false, 24073#(= 0 |main_#t~malloc0.offset|), 24074#(= main_~root~0.offset 0), 24075#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 24076#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 24077#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset 0)), 24078#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (not (= main_~n~0.base |main_#t~malloc22.base|)) (not (= |main_#t~malloc22.base| 0)) (= main_~root~0.offset 0) (= 0 |main_#t~malloc22.offset|)), 24079#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 24080#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0)), 24081#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)) 0)) (= main_~root~0.offset 0)), 24082#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 24083#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.offset 0)), 24084#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.offset 0) (= |main_#t~mem29.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 24085#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0)), 24086#(and (= 0 |main_#t~mem33.offset|) (= 8 (select |#length| |main_#t~mem33.base|))), 24087#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8))] [2018-02-02 10:00:36,769 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:00:36,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:00:36,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:00:36,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:00:36,770 INFO L87 Difference]: Start difference. First operand 639 states and 833 transitions. Second operand 17 states. [2018-02-02 10:00:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:37,707 INFO L93 Difference]: Finished difference Result 1115 states and 1417 transitions. [2018-02-02 10:00:37,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:00:37,707 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-02-02 10:00:37,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:37,709 INFO L225 Difference]: With dead ends: 1115 [2018-02-02 10:00:37,709 INFO L226 Difference]: Without dead ends: 1115 [2018-02-02 10:00:37,709 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=925, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:00:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2018-02-02 10:00:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 652. [2018-02-02 10:00:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-02-02 10:00:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 854 transitions. [2018-02-02 10:00:37,714 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 854 transitions. Word has length 52 [2018-02-02 10:00:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:37,714 INFO L432 AbstractCegarLoop]: Abstraction has 652 states and 854 transitions. [2018-02-02 10:00:37,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:00:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 854 transitions. [2018-02-02 10:00:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:00:37,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:37,715 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, 1] [2018-02-02 10:00:37,715 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:37,715 INFO L82 PathProgramCache]: Analyzing trace with hash 926197358, now seen corresponding path program 1 times [2018-02-02 10:00:37,715 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:37,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:37,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:37,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:00:37,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:37,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:00:37,831 INFO L182 omatonBuilderFactory]: Interpolants [25891#true, 25892#false, 25893#(= (select |#valid| main_~root~0.base) 1), 25894#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 25895#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (not (= 0 |main_#t~malloc13.base|))), 25896#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset)))), 25897#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem15.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset)))), 25898#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset)))), 25899#(not (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 25900#(not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 25901#(not (= 0 |main_#t~mem28.base|)), 25902#|main_#t~short30|] [2018-02-02 10:00:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:37,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:00:37,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:00:37,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:00:37,831 INFO L87 Difference]: Start difference. First operand 652 states and 854 transitions. Second operand 12 states. [2018-02-02 10:00:38,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:38,328 INFO L93 Difference]: Finished difference Result 1090 states and 1401 transitions. [2018-02-02 10:00:38,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:00:38,329 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-02-02 10:00:38,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:38,331 INFO L225 Difference]: With dead ends: 1090 [2018-02-02 10:00:38,331 INFO L226 Difference]: Without dead ends: 1075 [2018-02-02 10:00:38,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:00:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2018-02-02 10:00:38,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 661. [2018-02-02 10:00:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-02-02 10:00:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 864 transitions. [2018-02-02 10:00:38,336 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 864 transitions. Word has length 52 [2018-02-02 10:00:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:38,336 INFO L432 AbstractCegarLoop]: Abstraction has 661 states and 864 transitions. [2018-02-02 10:00:38,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:00:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 864 transitions. [2018-02-02 10:00:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:00:38,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:38,337 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:38,337 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:38,337 INFO L82 PathProgramCache]: Analyzing trace with hash -14850443, now seen corresponding path program 1 times [2018-02-02 10:00:38,338 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:38,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:38,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:38,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:00:38,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:38,518 INFO L182 omatonBuilderFactory]: Interpolants [27680#(= (select |#valid| main_~root~0.base) 1), 27681#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 27682#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|))), 27683#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= main_~n~0.offset main_~root~0.offset)), 27684#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (not (= main_~n~0.base |main_#t~mem15.base|)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 27685#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 27686#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 27687#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~n~0.offset main_~root~0.offset)), 27688#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 27689#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~mem24.base|)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 27690#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))), 27691#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 27692#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 27693#(= 1 (select |#valid| |main_#t~mem8.base|)), 27694#(= (select |#valid| main_~n~0.base) 1), 27678#true, 27679#false] [2018-02-02 10:00:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:38,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:00:38,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:00:38,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:00:38,518 INFO L87 Difference]: Start difference. First operand 661 states and 864 transitions. Second operand 17 states. [2018-02-02 10:00:39,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:39,487 INFO L93 Difference]: Finished difference Result 1436 states and 1857 transitions. [2018-02-02 10:00:39,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:00:39,487 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-02 10:00:39,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:39,489 INFO L225 Difference]: With dead ends: 1436 [2018-02-02 10:00:39,489 INFO L226 Difference]: Without dead ends: 1436 [2018-02-02 10:00:39,490 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=566, Invalid=1504, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:00:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2018-02-02 10:00:39,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 732. [2018-02-02 10:00:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-02-02 10:00:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 964 transitions. [2018-02-02 10:00:39,497 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 964 transitions. Word has length 56 [2018-02-02 10:00:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:39,497 INFO L432 AbstractCegarLoop]: Abstraction has 732 states and 964 transitions. [2018-02-02 10:00:39,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:00:39,497 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 964 transitions. [2018-02-02 10:00:39,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:00:39,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:39,498 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:39,498 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:39,498 INFO L82 PathProgramCache]: Analyzing trace with hash -14850442, now seen corresponding path program 1 times [2018-02-02 10:00:39,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:39,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:39,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:39,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:00:39,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:39,924 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:00:39,924 INFO L182 omatonBuilderFactory]: Interpolants [29921#true, 29922#false, 29923#(= (select |#valid| main_~root~0.base) 1), 29924#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 29925#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 29926#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 29927#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= 8 (select |#length| |main_#t~mem15.base|)) (= main_~n~0.offset main_~root~0.offset)), 29928#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 29929#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 29930#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 29931#(and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 29932#(and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~n~0.offset main_~root~0.offset)), 29933#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))), 29934#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))), 29935#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 29936#(and (= 0 |main_#t~mem8.offset|) (= 8 (select |#length| |main_#t~mem8.base|))), 29937#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8))] [2018-02-02 10:00:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:39,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:00:39,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:00:39,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:00:39,925 INFO L87 Difference]: Start difference. First operand 732 states and 964 transitions. Second operand 17 states. [2018-02-02 10:00:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:41,403 INFO L93 Difference]: Finished difference Result 1490 states and 1923 transitions. [2018-02-02 10:00:41,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:00:41,403 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-02 10:00:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:41,406 INFO L225 Difference]: With dead ends: 1490 [2018-02-02 10:00:41,406 INFO L226 Difference]: Without dead ends: 1490 [2018-02-02 10:00:41,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=497, Invalid=1665, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:00:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2018-02-02 10:00:41,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 748. [2018-02-02 10:00:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-02-02 10:00:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 986 transitions. [2018-02-02 10:00:41,414 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 986 transitions. Word has length 56 [2018-02-02 10:00:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:41,414 INFO L432 AbstractCegarLoop]: Abstraction has 748 states and 986 transitions. [2018-02-02 10:00:41,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:00:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 986 transitions. [2018-02-02 10:00:41,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:00:41,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:41,415 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:41,415 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:41,415 INFO L82 PathProgramCache]: Analyzing trace with hash -9124805, now seen corresponding path program 1 times [2018-02-02 10:00:41,415 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:41,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:41,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:41,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:00:41,648 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:41,648 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:00:41,648 INFO L182 omatonBuilderFactory]: Interpolants [32236#true, 32237#false, 32238#(= 0 |main_#t~malloc0.offset|), 32239#(= main_~root~0.offset 0), 32240#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 32241#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 32242#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 1 (select |#valid| |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 32243#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 32244#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 32245#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= main_~root~0.offset 0)), 32246#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= main_~root~0.offset 0)), 32247#(and (= main_~n~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 32248#(= 1 (select |#valid| |main_#t~mem9.base|)), 32249#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 10:00:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:41,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:00:41,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:00:41,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:00:41,649 INFO L87 Difference]: Start difference. First operand 748 states and 986 transitions. Second operand 14 states. [2018-02-02 10:00:42,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:42,247 INFO L93 Difference]: Finished difference Result 1136 states and 1463 transitions. [2018-02-02 10:00:42,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:00:42,247 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-02-02 10:00:42,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:42,249 INFO L225 Difference]: With dead ends: 1136 [2018-02-02 10:00:42,249 INFO L226 Difference]: Without dead ends: 1136 [2018-02-02 10:00:42,249 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=601, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:00:42,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2018-02-02 10:00:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 755. [2018-02-02 10:00:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-02-02 10:00:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 995 transitions. [2018-02-02 10:00:42,257 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 995 transitions. Word has length 56 [2018-02-02 10:00:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:42,258 INFO L432 AbstractCegarLoop]: Abstraction has 755 states and 995 transitions. [2018-02-02 10:00:42,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:00:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 995 transitions. [2018-02-02 10:00:42,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:00:42,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:42,259 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:42,259 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:42,259 INFO L82 PathProgramCache]: Analyzing trace with hash -9124804, now seen corresponding path program 1 times [2018-02-02 10:00:42,259 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:42,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:42,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:42,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:00:42,444 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:42,444 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:00:42,445 INFO L182 omatonBuilderFactory]: Interpolants [34176#(= main_~root~0.offset 0), 34177#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 34178#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 34179#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (= 0 |main_#t~malloc22.offset|)), 34180#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 34181#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0)), 34182#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 34183#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 34184#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0)), 34185#(and (= 0 |main_#t~mem9.offset|) (= 8 (select |#length| |main_#t~mem9.base|))), 34186#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8)), 34173#true, 34174#false, 34175#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 10:00:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:42,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:00:42,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:00:42,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:00:42,445 INFO L87 Difference]: Start difference. First operand 755 states and 995 transitions. Second operand 14 states. [2018-02-02 10:00:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:43,122 INFO L93 Difference]: Finished difference Result 1206 states and 1551 transitions. [2018-02-02 10:00:43,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:00:43,122 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-02-02 10:00:43,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:43,124 INFO L225 Difference]: With dead ends: 1206 [2018-02-02 10:00:43,124 INFO L226 Difference]: Without dead ends: 1206 [2018-02-02 10:00:43,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:00:43,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-02-02 10:00:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 769. [2018-02-02 10:00:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-02-02 10:00:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1014 transitions. [2018-02-02 10:00:43,130 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1014 transitions. Word has length 56 [2018-02-02 10:00:43,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:43,130 INFO L432 AbstractCegarLoop]: Abstraction has 769 states and 1014 transitions. [2018-02-02 10:00:43,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:00:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1014 transitions. [2018-02-02 10:00:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:00:43,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:43,131 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] [2018-02-02 10:00:43,131 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:43,131 INFO L82 PathProgramCache]: Analyzing trace with hash 383443115, now seen corresponding path program 1 times [2018-02-02 10:00:43,132 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:43,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:43,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:43,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:00:43,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:43,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:00:43,170 INFO L182 omatonBuilderFactory]: Interpolants [36194#true, 36195#false, 36196#(= main_~n~0.base main_~root~0.base), 36197#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1)), 36198#(= 1 (select |#valid| main_~root~0.base)), 36199#(= 1 (select |#valid| main_~n~0.base)), 36200#(= 1 (select |#valid| main_~pred~0.base))] [2018-02-02 10:00:43,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:43,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:00:43,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:00:43,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:00:43,170 INFO L87 Difference]: Start difference. First operand 769 states and 1014 transitions. Second operand 7 states. [2018-02-02 10:00:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:43,299 INFO L93 Difference]: Finished difference Result 810 states and 1043 transitions. [2018-02-02 10:00:43,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:00:43,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-02-02 10:00:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:43,301 INFO L225 Difference]: With dead ends: 810 [2018-02-02 10:00:43,301 INFO L226 Difference]: Without dead ends: 810 [2018-02-02 10:00:43,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:00:43,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-02-02 10:00:43,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 766. [2018-02-02 10:00:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2018-02-02 10:00:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 996 transitions. [2018-02-02 10:00:43,307 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 996 transitions. Word has length 57 [2018-02-02 10:00:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:43,307 INFO L432 AbstractCegarLoop]: Abstraction has 766 states and 996 transitions. [2018-02-02 10:00:43,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:00:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 996 transitions. [2018-02-02 10:00:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:00:43,307 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:43,307 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] [2018-02-02 10:00:43,307 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:43,308 INFO L82 PathProgramCache]: Analyzing trace with hash 383443116, now seen corresponding path program 1 times [2018-02-02 10:00:43,308 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:43,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:00:43,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:43,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:00:43,399 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:43,399 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:00:43,399 INFO L182 omatonBuilderFactory]: Interpolants [37792#(and (= (select |#length| main_~n~0.base) (select |#length| main_~pred~0.base)) (= main_~n~0.offset 0) (<= (+ main_~n~0.offset 4) (select |#length| main_~n~0.base)) (= main_~pred~0.offset 0)), 37793#(and (<= 4 (select |#length| main_~pred~0.base)) (= main_~pred~0.offset 0)), 37786#true, 37787#false, 37788#(= 0 |main_#t~malloc0.offset|), 37789#(= 0 main_~root~0.offset), 37790#(= main_~n~0.offset 0), 37791#(and (= main_~n~0.offset 0) (<= (+ main_~n~0.offset 4) (select |#length| main_~n~0.base)))] [2018-02-02 10:00:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:00:43,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:00:43,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:00:43,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:00:43,400 INFO L87 Difference]: Start difference. First operand 766 states and 996 transitions. Second operand 8 states. [2018-02-02 10:00:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:43,545 INFO L93 Difference]: Finished difference Result 874 states and 1122 transitions. [2018-02-02 10:00:43,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:00:43,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-02-02 10:00:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:43,547 INFO L225 Difference]: With dead ends: 874 [2018-02-02 10:00:43,547 INFO L226 Difference]: Without dead ends: 874 [2018-02-02 10:00:43,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:00:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-02-02 10:00:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 817. [2018-02-02 10:00:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-02-02 10:00:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1062 transitions. [2018-02-02 10:00:43,553 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1062 transitions. Word has length 57 [2018-02-02 10:00:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:43,553 INFO L432 AbstractCegarLoop]: Abstraction has 817 states and 1062 transitions. [2018-02-02 10:00:43,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:00:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1062 transitions. [2018-02-02 10:00:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:00:43,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:43,553 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:43,553 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:43,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1784177028, now seen corresponding path program 1 times [2018-02-02 10:00:43,554 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:43,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:43,744 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:00:43,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:43,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:00:43,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:43,744 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:00:43,744 INFO L182 omatonBuilderFactory]: Interpolants [39497#true, 39498#false, 39499#(= (select |#valid| main_~root~0.base) 1), 39500#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 39501#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|))), 39502#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= main_~n~0.offset main_~root~0.offset)), 39503#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (not (= main_~n~0.base |main_#t~mem15.base|)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 39504#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 39505#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 39506#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~n~0.offset main_~root~0.offset)), 39507#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 39508#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~mem24.base|)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 39509#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))), 39510#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 39511#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 39512#(= 1 (select |#valid| |main_#t~mem32.base|)), 39513#(= (select |#valid| main_~n~0.base) 1)] [2018-02-02 10:00:43,745 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:00:43,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:00:43,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:00:43,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:00:43,745 INFO L87 Difference]: Start difference. First operand 817 states and 1062 transitions. Second operand 17 states. [2018-02-02 10:00:44,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:44,639 INFO L93 Difference]: Finished difference Result 1537 states and 1972 transitions. [2018-02-02 10:00:44,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:00:44,640 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-02-02 10:00:44,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:44,644 INFO L225 Difference]: With dead ends: 1537 [2018-02-02 10:00:44,644 INFO L226 Difference]: Without dead ends: 1537 [2018-02-02 10:00:44,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=488, Invalid=1234, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:00:44,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-02-02 10:00:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 831. [2018-02-02 10:00:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-02-02 10:00:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1078 transitions. [2018-02-02 10:00:44,655 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1078 transitions. Word has length 58 [2018-02-02 10:00:44,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:44,655 INFO L432 AbstractCegarLoop]: Abstraction has 831 states and 1078 transitions. [2018-02-02 10:00:44,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:00:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1078 transitions. [2018-02-02 10:00:44,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:00:44,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:44,656 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:44,656 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:44,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1784177029, now seen corresponding path program 1 times [2018-02-02 10:00:44,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:44,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:44,961 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:00:44,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:44,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:00:44,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:44,962 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:00:44,962 INFO L182 omatonBuilderFactory]: Interpolants [41932#true, 41933#false, 41934#(= (select |#valid| main_~root~0.base) 1), 41935#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 41936#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 41937#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 41938#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= 8 (select |#length| |main_#t~mem15.base|)) (= main_~n~0.offset main_~root~0.offset)), 41939#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 41940#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 41941#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 41942#(and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 41943#(and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~n~0.offset main_~root~0.offset)), 41944#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))), 41945#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))), 41946#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 41947#(and (= 0 |main_#t~mem32.offset|) (= 8 (select |#length| |main_#t~mem32.base|))), 41948#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8))] [2018-02-02 10:00:44,962 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:00:44,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:00:44,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:00:44,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:00:44,963 INFO L87 Difference]: Start difference. First operand 831 states and 1078 transitions. Second operand 17 states. [2018-02-02 10:00:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:46,271 INFO L93 Difference]: Finished difference Result 1579 states and 2017 transitions. [2018-02-02 10:00:46,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:00:46,271 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-02-02 10:00:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:46,274 INFO L225 Difference]: With dead ends: 1579 [2018-02-02 10:00:46,274 INFO L226 Difference]: Without dead ends: 1579 [2018-02-02 10:00:46,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=429, Invalid=1377, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:00:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2018-02-02 10:00:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 824. [2018-02-02 10:00:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2018-02-02 10:00:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1070 transitions. [2018-02-02 10:00:46,282 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1070 transitions. Word has length 58 [2018-02-02 10:00:46,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:46,283 INFO L432 AbstractCegarLoop]: Abstraction has 824 states and 1070 transitions. [2018-02-02 10:00:46,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:00:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1070 transitions. [2018-02-02 10:00:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:00:46,283 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:46,283 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] [2018-02-02 10:00:46,283 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:46,283 INFO L82 PathProgramCache]: Analyzing trace with hash -878348371, now seen corresponding path program 1 times [2018-02-02 10:00:46,284 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:46,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:00:46,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:46,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:00:46,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:46,314 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:00:46,314 INFO L182 omatonBuilderFactory]: Interpolants [44404#true, 44405#false, 44406#(and (= main_~n~0.base main_~pred~0.base) (= main_~n~0.offset main_~pred~0.offset)), 44407#(and (= |main_#t~mem32.base| (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)) (= |main_#t~mem32.offset| (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset))), 44408#(and (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset))), 44409#(and (= |main_#t~mem34.base| main_~n~0.base) (= |main_#t~mem34.offset| main_~n~0.offset))] [2018-02-02 10:00:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:00:46,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:00:46,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:00:46,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:00:46,314 INFO L87 Difference]: Start difference. First operand 824 states and 1070 transitions. Second operand 6 states. [2018-02-02 10:00:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:46,416 INFO L93 Difference]: Finished difference Result 895 states and 1165 transitions. [2018-02-02 10:00:46,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:00:46,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-02-02 10:00:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:46,418 INFO L225 Difference]: With dead ends: 895 [2018-02-02 10:00:46,418 INFO L226 Difference]: Without dead ends: 895 [2018-02-02 10:00:46,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:00:46,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2018-02-02 10:00:46,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 873. [2018-02-02 10:00:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-02-02 10:00:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1146 transitions. [2018-02-02 10:00:46,424 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1146 transitions. Word has length 59 [2018-02-02 10:00:46,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:46,425 INFO L432 AbstractCegarLoop]: Abstraction has 873 states and 1146 transitions. [2018-02-02 10:00:46,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:00:46,425 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1146 transitions. [2018-02-02 10:00:46,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:00:46,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:46,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:46,425 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:46,425 INFO L82 PathProgramCache]: Analyzing trace with hash -464102821, now seen corresponding path program 2 times [2018-02-02 10:00:46,426 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:46,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:46,762 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:46,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:46,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:00:46,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:46,763 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:00:46,763 INFO L182 omatonBuilderFactory]: Interpolants [46182#true, 46183#false, 46184#(= (select |#valid| main_~root~0.base) 1), 46185#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 46186#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 46187#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 46188#(and (= main_~n~0.base main_~root~0.base) (= 0 |main_#t~mem15.offset|) (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem15.base|)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 46189#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 46190#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (or (and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)) (and (= main_~n~0.base main_~root~0.base) (= |main_#t~mem17.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset)) (= (+ |main_#t~mem17.offset| 4) 0)))), 46191#(or (and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset) 4) 0)), 46192#(or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset) 4) 0)), 46193#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset) 4) 0)), 46194#(or (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) |main_#t~mem32.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem32.base|) |main_#t~mem32.offset|))) (<= (+ |main_#t~mem32.offset| 4) 0)), 46195#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (<= (+ main_~n~0.offset 4) 0)), 46196#(and (= 0 |main_#t~mem28.offset|) (= 0 |main_#t~mem28.base|)), 46197#(not |main_#t~short30|)] [2018-02-02 10:00:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:46,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:00:46,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:00:46,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:00:46,764 INFO L87 Difference]: Start difference. First operand 873 states and 1146 transitions. Second operand 16 states. [2018-02-02 10:00:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:47,653 INFO L93 Difference]: Finished difference Result 1350 states and 1761 transitions. [2018-02-02 10:00:47,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:00:47,653 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-02-02 10:00:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:47,655 INFO L225 Difference]: With dead ends: 1350 [2018-02-02 10:00:47,655 INFO L226 Difference]: Without dead ends: 1350 [2018-02-02 10:00:47,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=866, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:00:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2018-02-02 10:00:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 878. [2018-02-02 10:00:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2018-02-02 10:00:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1150 transitions. [2018-02-02 10:00:47,665 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1150 transitions. Word has length 59 [2018-02-02 10:00:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:47,665 INFO L432 AbstractCegarLoop]: Abstraction has 878 states and 1150 transitions. [2018-02-02 10:00:47,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:00:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1150 transitions. [2018-02-02 10:00:47,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:00:47,666 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:47,666 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:00:47,666 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:47,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2133873932, now seen corresponding path program 1 times [2018-02-02 10:00:47,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:47,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:00:47,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:47,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:00:47,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:47,757 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:00:47,757 INFO L182 omatonBuilderFactory]: Interpolants [48464#(= main_~n~0.offset 0), 48465#(and (= main_~n~0.offset 0) (<= (+ main_~n~0.offset 8) (select |#length| main_~n~0.base))), 48466#(and (= (select |#length| main_~n~0.base) (select |#length| main_~pred~0.base)) (= main_~n~0.offset 0) (<= (+ main_~n~0.offset 8) (select |#length| main_~n~0.base)) (= main_~pred~0.offset 0)), 48467#(and (<= 8 (select |#length| main_~pred~0.base)) (= main_~pred~0.offset 0)), 48460#true, 48461#false, 48462#(= 0 |main_#t~malloc0.offset|), 48463#(= 0 main_~root~0.offset)] [2018-02-02 10:00:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:00:47,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:00:47,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:00:47,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:00:47,757 INFO L87 Difference]: Start difference. First operand 878 states and 1150 transitions. Second operand 8 states. [2018-02-02 10:00:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:47,893 INFO L93 Difference]: Finished difference Result 962 states and 1232 transitions. [2018-02-02 10:00:47,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:00:47,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-02-02 10:00:47,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:47,894 INFO L225 Difference]: With dead ends: 962 [2018-02-02 10:00:47,895 INFO L226 Difference]: Without dead ends: 962 [2018-02-02 10:00:47,895 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:00:47,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-02-02 10:00:47,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 880. [2018-02-02 10:00:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-02-02 10:00:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1150 transitions. [2018-02-02 10:00:47,900 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1150 transitions. Word has length 61 [2018-02-02 10:00:47,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:47,901 INFO L432 AbstractCegarLoop]: Abstraction has 880 states and 1150 transitions. [2018-02-02 10:00:47,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:00:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1150 transitions. [2018-02-02 10:00:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:00:47,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:47,901 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:47,902 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:47,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1746847814, now seen corresponding path program 1 times [2018-02-02 10:00:47,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:47,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:48,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:48,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:00:48,231 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:48,232 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:00:48,232 INFO L182 omatonBuilderFactory]: Interpolants [50336#(and (= 0 |main_#t~mem33.offset|) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem33.base|) |main_#t~mem33.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem33.base|) |main_#t~mem33.offset|))), 50337#(and (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 50338#(and (= main_~n~0.offset 0) (= |main_#t~mem31.base| 0) (= |main_#t~mem31.offset| 0)), 50322#true, 50323#false, 50324#(= 0 |main_#t~malloc0.offset|), 50325#(= main_~root~0.offset 0), 50326#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 50327#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0)), 50328#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (= 0 |main_#t~malloc22.offset|)), 50329#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 50330#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem24.offset| 0) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0)), 50331#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 50332#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0) 0)) (= |main_#t~mem26.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))), 50333#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 0))), 50334#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0))), 50335#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= |main_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))))] [2018-02-02 10:00:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:48,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:00:48,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:00:48,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:00:48,233 INFO L87 Difference]: Start difference. First operand 880 states and 1150 transitions. Second operand 17 states. [2018-02-02 10:00:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:49,102 INFO L93 Difference]: Finished difference Result 1428 states and 1872 transitions. [2018-02-02 10:00:49,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:00:49,103 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-02-02 10:00:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:49,104 INFO L225 Difference]: With dead ends: 1428 [2018-02-02 10:00:49,104 INFO L226 Difference]: Without dead ends: 1422 [2018-02-02 10:00:49,105 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=977, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:00:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2018-02-02 10:00:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 876. [2018-02-02 10:00:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-02-02 10:00:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1144 transitions. [2018-02-02 10:00:49,111 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1144 transitions. Word has length 61 [2018-02-02 10:00:49,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:49,111 INFO L432 AbstractCegarLoop]: Abstraction has 876 states and 1144 transitions. [2018-02-02 10:00:49,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:00:49,111 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1144 transitions. [2018-02-02 10:00:49,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:00:49,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:49,111 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] [2018-02-02 10:00:49,112 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:49,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1777835759, now seen corresponding path program 1 times [2018-02-02 10:00:49,112 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:49,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:00:49,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:49,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:00:49,135 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:49,135 INFO L182 omatonBuilderFactory]: Interpolants [52681#true, 52682#false, 52683#(not (= 0 |main_#t~malloc0.base|)), 52684#(not (= 0 main_~root~0.base)), 52685#(not (= 0 main_~n~0.base)), 52686#(not (= 0 main_~pred~0.base))] [2018-02-02 10:00:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:00:49,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:00:49,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:00:49,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:00:49,136 INFO L87 Difference]: Start difference. First operand 876 states and 1144 transitions. Second operand 6 states. [2018-02-02 10:00:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:49,237 INFO L93 Difference]: Finished difference Result 924 states and 1184 transitions. [2018-02-02 10:00:49,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:00:49,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-02-02 10:00:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:49,238 INFO L225 Difference]: With dead ends: 924 [2018-02-02 10:00:49,238 INFO L226 Difference]: Without dead ends: 924 [2018-02-02 10:00:49,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:00:49,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2018-02-02 10:00:49,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 876. [2018-02-02 10:00:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-02-02 10:00:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1136 transitions. [2018-02-02 10:00:49,243 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1136 transitions. Word has length 61 [2018-02-02 10:00:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:49,243 INFO L432 AbstractCegarLoop]: Abstraction has 876 states and 1136 transitions. [2018-02-02 10:00:49,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:00:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1136 transitions. [2018-02-02 10:00:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:00:49,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:49,243 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:49,244 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:49,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1145751716, now seen corresponding path program 1 times [2018-02-02 10:00:49,244 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:49,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:49,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:49,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:00:49,495 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:49,496 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:00:49,496 INFO L182 omatonBuilderFactory]: Interpolants [54497#true, 54498#false, 54499#(= 0 |main_#t~malloc0.offset|), 54500#(= main_~root~0.offset 0), 54501#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 54502#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 54503#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 54504#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 54505#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem15.base|)) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 54506#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~root~0.offset)) (= main_~n~0.base main_~root~0.base) (= 0 |main_#t~mem17.offset|) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 54507#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset)) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset)) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 54508#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= main_~root~0.offset 0)), 54509#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 54510#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem32.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) (+ 0 4))) (= 0 |main_#t~mem32.offset|)), 54511#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= (+ main_~n~0.offset 1) 0)), 54512#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 54513#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_#t~mem29.base| 0) (= |main_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 54514#(not |main_#t~short30|)] [2018-02-02 10:00:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:49,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:00:49,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:00:49,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:00:49,497 INFO L87 Difference]: Start difference. First operand 876 states and 1136 transitions. Second operand 18 states. [2018-02-02 10:00:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:50,298 INFO L93 Difference]: Finished difference Result 1264 states and 1624 transitions. [2018-02-02 10:00:50,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:00:50,298 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2018-02-02 10:00:50,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:50,300 INFO L225 Difference]: With dead ends: 1264 [2018-02-02 10:00:50,300 INFO L226 Difference]: Without dead ends: 1264 [2018-02-02 10:00:50,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=1182, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:00:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2018-02-02 10:00:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 876. [2018-02-02 10:00:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-02-02 10:00:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1135 transitions. [2018-02-02 10:00:50,311 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1135 transitions. Word has length 61 [2018-02-02 10:00:50,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:50,311 INFO L432 AbstractCegarLoop]: Abstraction has 876 states and 1135 transitions. [2018-02-02 10:00:50,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:00:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1135 transitions. [2018-02-02 10:00:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:00:50,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:50,312 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:50,312 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:50,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1208076037, now seen corresponding path program 2 times [2018-02-02 10:00:50,312 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:50,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:50,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:50,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:00:50,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:50,719 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:00:50,719 INFO L182 omatonBuilderFactory]: Interpolants [56704#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 56705#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0)), 56706#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 56707#(and (or (= |main_#t~mem26.base| main_~root~0.base) (= |main_#t~mem26.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= |main_#t~mem26.offset| 0) (= main_~root~0.offset 0)), 56708#(and (or (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (+ main_~root~0.offset 4))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 56709#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 56710#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (or (= |main_#t~mem29.base| 0) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (+ 0 4))))) (= |main_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 56711#(and (= main_~n~0.offset 0) (or (not |main_#t~short30|) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (+ 0 4)))))), 56712#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (+ 0 4)))), 56713#(and (= 0 |main_#t~mem33.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem33.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem33.base|) (+ 0 4)))), 56714#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 56715#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= |main_#t~mem29.base| 0) (= |main_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 56716#(and (= main_~n~0.offset 0) (not |main_#t~short30|)), 56697#true, 56698#false, 56699#(= 0 |main_#t~malloc0.offset|), 56700#(= main_~root~0.offset 0), 56701#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 56702#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 56703#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (= 0 |main_#t~malloc22.offset|))] [2018-02-02 10:00:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:50,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:00:50,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:00:50,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:00:50,720 INFO L87 Difference]: Start difference. First operand 876 states and 1135 transitions. Second operand 20 states. [2018-02-02 10:00:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:51,869 INFO L93 Difference]: Finished difference Result 1591 states and 2054 transitions. [2018-02-02 10:00:51,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:00:51,869 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-02-02 10:00:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:51,871 INFO L225 Difference]: With dead ends: 1591 [2018-02-02 10:00:51,871 INFO L226 Difference]: Without dead ends: 1591 [2018-02-02 10:00:51,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=411, Invalid=1569, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:00:51,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-02-02 10:00:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1140. [2018-02-02 10:00:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1140 states. [2018-02-02 10:00:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1502 transitions. [2018-02-02 10:00:51,878 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1502 transitions. Word has length 63 [2018-02-02 10:00:51,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:51,878 INFO L432 AbstractCegarLoop]: Abstraction has 1140 states and 1502 transitions. [2018-02-02 10:00:51,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:00:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1502 transitions. [2018-02-02 10:00:51,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:00:51,878 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:51,879 INFO L351 BasicCegarLoop]: trace histogram [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, 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:00:51,879 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:51,879 INFO L82 PathProgramCache]: Analyzing trace with hash -488666766, now seen corresponding path program 1 times [2018-02-02 10:00:51,879 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:51,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:52,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:52,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:00:52,127 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:52,128 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:00:52,128 INFO L182 omatonBuilderFactory]: Interpolants [59498#true, 59499#false, 59500#(= (select |#valid| main_~root~0.base) 1), 59501#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 59502#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 59503#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 59504#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 59505#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (not (= main_~n~0.base |main_#t~mem17.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~root~0.offset)) (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| main_~n~0.base))), 59506#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| main_~n~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 59507#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 1 (select |#valid| main_~root~0.base)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 59508#(and (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| main_~root~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 59509#(and (= |main_#t~mem28.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| main_~root~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem28.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 59510#(and (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| main_~root~0.base)) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not |main_#t~short30|))), 59511#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| main_~root~0.base))), 59512#(and (not (= 0 |main_#t~mem32.base|)) (not (= main_~root~0.base |main_#t~mem32.base|)) (= 1 (select |#valid| main_~root~0.base))), 59513#(and (= 1 (select (store |#valid| main_~n~0.base 0) main_~root~0.base)) (not (= 0 main_~n~0.base))), 59514#(= (select |#valid| main_~n~0.base) 1)] [2018-02-02 10:00:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:52,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:00:52,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:00:52,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:00:52,129 INFO L87 Difference]: Start difference. First operand 1140 states and 1502 transitions. Second operand 17 states. [2018-02-02 10:00:53,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:53,052 INFO L93 Difference]: Finished difference Result 1755 states and 2304 transitions. [2018-02-02 10:00:53,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:00:53,052 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2018-02-02 10:00:53,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:53,055 INFO L225 Difference]: With dead ends: 1755 [2018-02-02 10:00:53,055 INFO L226 Difference]: Without dead ends: 1755 [2018-02-02 10:00:53,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=238, Invalid=754, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:00:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2018-02-02 10:00:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1153. [2018-02-02 10:00:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-02-02 10:00:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1515 transitions. [2018-02-02 10:00:53,068 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1515 transitions. Word has length 64 [2018-02-02 10:00:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:53,068 INFO L432 AbstractCegarLoop]: Abstraction has 1153 states and 1515 transitions. [2018-02-02 10:00:53,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:00:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1515 transitions. [2018-02-02 10:00:53,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:00:53,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:53,069 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] [2018-02-02 10:00:53,069 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:53,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1766641805, now seen corresponding path program 1 times [2018-02-02 10:00:53,070 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:53,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:00:53,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:53,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:00:53,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:53,223 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:00:53,223 INFO L182 omatonBuilderFactory]: Interpolants [62453#true, 62454#false, 62455#(and (= |main_#t~mem29.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 62456#(or (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))) (not |main_#t~short30|)), 62457#(or (and (= main_~pred~0.offset main_~n~0.offset) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.base main_~pred~0.base)) (and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.base main_~pred~0.base) (= main_~n~0.offset main_~pred~0.offset))), 62458#(or (and (not (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.base main_~pred~0.base) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~pred~0.offset) |main_#t~mem31.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= |main_#t~mem31.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~pred~0.base) (= main_~n~0.offset main_~pred~0.offset))), 62459#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~pred~0.base) (= main_~n~0.offset main_~pred~0.offset)) (and (not (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~pred~0.offset) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.base main_~pred~0.base))), 62460#(or (not (= (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset) |main_#t~mem33.offset|)) (not (= |main_#t~mem33.base| (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)))), 62461#(or (not (= (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)))), 62462#(or (not (= main_~n~0.base |main_#t~mem34.base|)) (and (not (= (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset) main_~n~0.offset)) (= |main_#t~mem34.offset| (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset))))] [2018-02-02 10:00:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:00:53,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:00:53,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:00:53,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:00:53,224 INFO L87 Difference]: Start difference. First operand 1153 states and 1515 transitions. Second operand 10 states. [2018-02-02 10:00:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:53,555 INFO L93 Difference]: Finished difference Result 1184 states and 1536 transitions. [2018-02-02 10:00:53,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:00:53,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-02-02 10:00:53,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:53,557 INFO L225 Difference]: With dead ends: 1184 [2018-02-02 10:00:53,557 INFO L226 Difference]: Without dead ends: 1184 [2018-02-02 10:00:53,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:00:53,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-02-02 10:00:53,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1151. [2018-02-02 10:00:53,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-02-02 10:00:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1504 transitions. [2018-02-02 10:00:53,568 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1504 transitions. Word has length 66 [2018-02-02 10:00:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:53,568 INFO L432 AbstractCegarLoop]: Abstraction has 1151 states and 1504 transitions. [2018-02-02 10:00:53,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:00:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1504 transitions. [2018-02-02 10:00:53,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:00:53,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:53,569 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] [2018-02-02 10:00:53,569 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:53,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1480944941, now seen corresponding path program 1 times [2018-02-02 10:00:53,570 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:53,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:53,945 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:53,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:00:53,945 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:53,946 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:00:53,946 INFO L182 omatonBuilderFactory]: Interpolants [64813#true, 64814#false, 64815#(= 0 |main_#t~malloc0.offset|), 64816#(= main_~root~0.offset 0), 64817#(and (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 64818#(and (= main_~root~0.base main_~n~0.base) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 64819#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 64820#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 64821#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 64822#(and (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0) (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))))), 64823#(and (= 1 (select |#valid| main_~root~0.base)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= main_~root~0.offset 0)), 64824#(and (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~root~0.base))), 64825#(and (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~root~0.base)) (= main_~pred~0.base main_~root~0.base)), 64826#(and (= 1 (select |#valid| main_~root~0.base)) (= main_~pred~0.base main_~root~0.base) (not (= main_~root~0.base |main_#t~mem33.base|))), 64827#(and (= 1 (select (store |#valid| main_~n~0.base 0) main_~root~0.base)) (= main_~pred~0.base main_~root~0.base)), 64828#(= 1 (select (store |#valid| main_~n~0.base 0) main_~root~0.base)), 64829#(= 1 (select |#valid| main_~root~0.base)), 64830#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 10:00:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:53,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:00:53,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:00:53,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:00:53,947 INFO L87 Difference]: Start difference. First operand 1151 states and 1504 transitions. Second operand 18 states. [2018-02-02 10:00:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:54,806 INFO L93 Difference]: Finished difference Result 1768 states and 2303 transitions. [2018-02-02 10:00:54,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:00:54,806 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-02-02 10:00:54,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:54,808 INFO L225 Difference]: With dead ends: 1768 [2018-02-02 10:00:54,808 INFO L226 Difference]: Without dead ends: 1768 [2018-02-02 10:00:54,809 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=1287, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:00:54,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-02-02 10:00:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1168. [2018-02-02 10:00:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2018-02-02 10:00:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1521 transitions. [2018-02-02 10:00:54,820 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1521 transitions. Word has length 66 [2018-02-02 10:00:54,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:54,820 INFO L432 AbstractCegarLoop]: Abstraction has 1168 states and 1521 transitions. [2018-02-02 10:00:54,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:00:54,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1521 transitions. [2018-02-02 10:00:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:00:54,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:54,821 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1] [2018-02-02 10:00:54,821 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:54,821 INFO L82 PathProgramCache]: Analyzing trace with hash -502667741, now seen corresponding path program 2 times [2018-02-02 10:00:54,821 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:54,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:55,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:55,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:00:55,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:55,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:00:55,379 INFO L182 omatonBuilderFactory]: Interpolants [67815#true, 67817#(= 0 |main_#t~malloc0.offset|), 67816#false, 67819#(and (= 0 main_~root~0.offset) (= (select |#valid| main_~root~0.base) 1)), 67818#(= 0 main_~root~0.offset), 67821#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 67820#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 67823#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset) (= |main_#t~mem15.offset| 0)), 67822#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 67825#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0) 0)) (not (= main_~n~0.base |main_#t~mem17.base|)) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0) 0))), 67824#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0))), 67827#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0))), 67826#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) main_~n~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset)) 0)) (not (= (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset) |main_#t~malloc22.base|)) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset)) 0)) (= 0 |main_#t~malloc22.offset|)), 67829#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))), 67828#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem24.base| (store (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset| 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem24.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem24.base|) |main_#t~mem24.offset| 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~n~0.offset main_~root~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 67831#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0))), 67830#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) 0))), 67833#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)))), 67832#(and (= |main_#t~mem4.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset) |main_#t~mem4.offset|) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0))), 67835#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 67834#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem8.base|) |main_#t~mem8.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem8.base|) |main_#t~mem8.offset|))), 67837#(not |main_#t~short6|), 67836#(and (= |main_#t~mem4.offset| 0) (= 0 |main_#t~mem4.base|))] [2018-02-02 10:00:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:55,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:00:55,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:00:55,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:00:55,380 INFO L87 Difference]: Start difference. First operand 1168 states and 1521 transitions. Second operand 23 states. [2018-02-02 10:00:57,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:57,252 INFO L93 Difference]: Finished difference Result 2041 states and 2626 transitions. [2018-02-02 10:00:57,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:00:57,252 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-02-02 10:00:57,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:57,254 INFO L225 Difference]: With dead ends: 2041 [2018-02-02 10:00:57,254 INFO L226 Difference]: Without dead ends: 2041 [2018-02-02 10:00:57,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=641, Invalid=2551, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 10:00:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2018-02-02 10:00:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 1305. [2018-02-02 10:00:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2018-02-02 10:00:57,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1707 transitions. [2018-02-02 10:00:57,266 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1707 transitions. Word has length 66 [2018-02-02 10:00:57,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:57,267 INFO L432 AbstractCegarLoop]: Abstraction has 1305 states and 1707 transitions. [2018-02-02 10:00:57,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:00:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1707 transitions. [2018-02-02 10:00:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:00:57,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:57,268 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:57,268 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:57,268 INFO L82 PathProgramCache]: Analyzing trace with hash -546093975, now seen corresponding path program 1 times [2018-02-02 10:00:57,268 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:57,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:57,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:57,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:00:57,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:57,807 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:00:57,807 INFO L182 omatonBuilderFactory]: Interpolants [71265#(and (= 8 (select |#length| |main_#t~mem9.base|)) (or (not (= |main_#t~mem9.offset| 0)) (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem9.base|) |main_#t~mem9.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem9.base|) |main_#t~mem9.offset|))))), 71264#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (or (not (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))))))), 71267#(and (= (select |#length| main_~n~0.base) 8) (<= 0 main_~n~0.offset) (or (not (= main_~n~0.offset 0)) (and (= |main_#t~mem4.offset| 0) (= 0 |main_#t~mem4.base|)))), 71266#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.offset 0))) (= (select |#length| main_~n~0.base) 8)), 71269#(and (not (= main_~n~0.offset 0)) (= (select |#length| main_~n~0.base) 8) (<= 0 main_~n~0.offset)), 71268#(and (or (not |main_#t~short6|) (not (= main_~n~0.offset 0))) (= (select |#length| main_~n~0.base) 8) (<= 0 main_~n~0.offset)), 71253#false, 71252#true, 71255#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset)), 71254#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset)), 71257#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 71256#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= 0 |main_#t~malloc22.offset|)), 71259#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 71258#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem24.offset| 0) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base |main_#t~mem24.base|))), 71261#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 0))), 71260#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0) 0)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0) 0)) (= |main_#t~mem26.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))), 71263#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 71262#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)))] [2018-02-02 10:00:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:57,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:00:57,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:00:57,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:00:57,808 INFO L87 Difference]: Start difference. First operand 1305 states and 1707 transitions. Second operand 18 states. [2018-02-02 10:00:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:58,826 INFO L93 Difference]: Finished difference Result 1691 states and 2167 transitions. [2018-02-02 10:00:58,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:00:58,826 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-02-02 10:00:58,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:58,828 INFO L225 Difference]: With dead ends: 1691 [2018-02-02 10:00:58,828 INFO L226 Difference]: Without dead ends: 1688 [2018-02-02 10:00:58,828 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=236, Invalid=1024, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:00:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2018-02-02 10:00:58,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1273. [2018-02-02 10:00:58,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1273 states. [2018-02-02 10:00:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1655 transitions. [2018-02-02 10:00:58,841 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1655 transitions. Word has length 66 [2018-02-02 10:00:58,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:58,841 INFO L432 AbstractCegarLoop]: Abstraction has 1273 states and 1655 transitions. [2018-02-02 10:00:58,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:00:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1655 transitions. [2018-02-02 10:00:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:00:58,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:58,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:58,842 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:58,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1086985905, now seen corresponding path program 2 times [2018-02-02 10:00:58,843 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:58,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:59,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:59,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:00:59,319 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:59,319 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:00:59,319 INFO L182 omatonBuilderFactory]: Interpolants [74275#false, 74274#true, 74277#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 74276#(= (select |#valid| main_~root~0.base) 1), 74279#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 74278#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 74281#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 74280#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem15.base|)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset) (= |main_#t~mem15.offset| 0)), 74283#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 74282#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= (select |#valid| main_~n~0.base) 1) (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= main_~n~0.offset main_~root~0.offset)), 74285#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 74284#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset)) (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) main_~n~0.offset))) (not (= (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset) |main_#t~malloc22.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset)) (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 74287#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)))), 74286#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem24.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem24.base|) |main_#t~mem24.offset| 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~mem24.base|)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem24.base| (store (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset| 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 74289#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)))), 74288#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)))), 74291#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 74290#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) |main_#t~mem32.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem32.base|) |main_#t~mem32.offset|))), 74292#(and (= |main_#t~mem31.base| 0) (= |main_#t~mem31.offset| 0))] [2018-02-02 10:00:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:59,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:00:59,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:00:59,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:00:59,320 INFO L87 Difference]: Start difference. First operand 1273 states and 1655 transitions. Second operand 19 states. [2018-02-02 10:01:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:00,480 INFO L93 Difference]: Finished difference Result 1971 states and 2527 transitions. [2018-02-02 10:01:00,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:01:00,481 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-02-02 10:01:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:00,482 INFO L225 Difference]: With dead ends: 1971 [2018-02-02 10:01:00,482 INFO L226 Difference]: Without dead ends: 1968 [2018-02-02 10:01:00,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=271, Invalid=1061, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:01:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2018-02-02 10:01:00,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1307. [2018-02-02 10:01:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2018-02-02 10:01:00,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1696 transitions. [2018-02-02 10:01:00,491 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1696 transitions. Word has length 67 [2018-02-02 10:01:00,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:00,491 INFO L432 AbstractCegarLoop]: Abstraction has 1307 states and 1696 transitions. [2018-02-02 10:01:00,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:01:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1696 transitions. [2018-02-02 10:01:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:01:00,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:00,492 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 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:01:00,492 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:00,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1559026000, now seen corresponding path program 1 times [2018-02-02 10:01:00,492 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:00,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:01,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:01,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:01:01,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:01,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:01:01,081 INFO L182 omatonBuilderFactory]: Interpolants [77607#true, 77609#(= 0 |main_#t~malloc0.offset|), 77608#false, 77611#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 77610#(= main_~root~0.offset 0), 77613#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 77612#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 77615#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 77614#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 77617#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (+ main_~root~0.offset 4))) (= main_~n~0.offset main_~root~0.offset)), 77616#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= |main_#t~mem17.offset| 0) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 77619#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 77618#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset)) (+ main_~root~0.offset 4))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) main_~n~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset)) (+ main_~root~0.offset 4))) (not (= (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset) |main_#t~malloc22.base|)) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 77621#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) (+ main_~root~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))), 77620#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem24.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem24.base|) |main_#t~mem24.offset| 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (+ main_~root~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem24.base| (store (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset| 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (+ main_~root~0.offset 4))) (= main_~n~0.offset main_~root~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 77623#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 77622#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= main_~root~0.offset 0)), 77625#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= (+ main_~n~0.offset 1) 0)), 77624#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem32.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) (+ 0 4))) (= 0 |main_#t~mem32.offset|)), 77627#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_#t~mem29.base| 0) (= |main_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 77626#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 77628#(not |main_#t~short30|)] [2018-02-02 10:01:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:01,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:01:01,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:01:01,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:01:01,082 INFO L87 Difference]: Start difference. First operand 1307 states and 1696 transitions. Second operand 22 states. [2018-02-02 10:01:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:02,500 INFO L93 Difference]: Finished difference Result 1924 states and 2468 transitions. [2018-02-02 10:01:02,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:01:02,500 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-02-02 10:01:02,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:02,501 INFO L225 Difference]: With dead ends: 1924 [2018-02-02 10:01:02,501 INFO L226 Difference]: Without dead ends: 1924 [2018-02-02 10:01:02,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=468, Invalid=1982, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:01:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2018-02-02 10:01:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1310. [2018-02-02 10:01:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2018-02-02 10:01:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1699 transitions. [2018-02-02 10:01:02,512 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1699 transitions. Word has length 69 [2018-02-02 10:01:02,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:02,512 INFO L432 AbstractCegarLoop]: Abstraction has 1310 states and 1699 transitions. [2018-02-02 10:01:02,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:01:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1699 transitions. [2018-02-02 10:01:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:01:02,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:02,512 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:02,512 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:02,513 INFO L82 PathProgramCache]: Analyzing trace with hash 581565238, now seen corresponding path program 1 times [2018-02-02 10:01:02,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:02,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:02,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:02,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:01:02,873 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:02,873 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:01:02,873 INFO L182 omatonBuilderFactory]: Interpolants [80929#(and (= 0 main_~root~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 1 (select |#valid| main_~root~0.base))), 80928#(and (= 0 main_~root~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 1 (select |#valid| main_~root~0.base))), 80931#(and (not (= |main_#t~malloc13.base| main_~n~0.base)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset |main_#t~malloc13.base|) (+ main_~root~0.offset 4)))) (= main_~n~0.base main_~root~0.base)), 80930#(and (not (= main_~n~0.offset (+ main_~root~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= 1 (select |#valid| main_~n~0.base))), 80933#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (not (= main_~n~0.base |main_#t~mem15.base|)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 80932#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) main_~n~0.base))), 80935#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))), 80934#(or (and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))) (not (= 1 (select |#valid| |main_#t~mem17.base|)))), 80937#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 80936#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))), 80939#(= (select |#valid| main_~n~0.base) 1), 80938#(= 1 (select |#valid| |main_#t~mem9.base|)), 80919#true, 80921#(= 0 |main_#t~malloc0.offset|), 80920#false, 80923#(and (= 0 main_~root~0.offset) (= (select |#valid| main_~root~0.base) 1)), 80922#(= 0 main_~root~0.offset), 80925#(and (= main_~n~0.base main_~root~0.base) (= 0 main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 1 (select |#valid| |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset)), 80924#(and (= main_~n~0.base main_~root~0.base) (= 0 main_~root~0.offset) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset)), 80927#(and (= main_~n~0.base main_~root~0.base) (= 0 main_~root~0.offset) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 80926#(and (= main_~n~0.base main_~root~0.base) (= 0 main_~root~0.offset) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))] [2018-02-02 10:01:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:02,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:01:02,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:01:02,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:01:02,874 INFO L87 Difference]: Start difference. First operand 1310 states and 1699 transitions. Second operand 21 states. [2018-02-02 10:01:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:04,578 INFO L93 Difference]: Finished difference Result 2013 states and 2589 transitions. [2018-02-02 10:01:04,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:01:04,578 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2018-02-02 10:01:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:04,580 INFO L225 Difference]: With dead ends: 2013 [2018-02-02 10:01:04,580 INFO L226 Difference]: Without dead ends: 2013 [2018-02-02 10:01:04,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=860, Invalid=2110, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 10:01:04,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2018-02-02 10:01:04,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1313. [2018-02-02 10:01:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2018-02-02 10:01:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1703 transitions. [2018-02-02 10:01:04,588 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1703 transitions. Word has length 72 [2018-02-02 10:01:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:04,588 INFO L432 AbstractCegarLoop]: Abstraction has 1313 states and 1703 transitions. [2018-02-02 10:01:04,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:01:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1703 transitions. [2018-02-02 10:01:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:01:04,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:04,588 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:04,588 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash 581565239, now seen corresponding path program 1 times [2018-02-02 10:01:04,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:04,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:05,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:05,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:01:05,363 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:05,364 INFO L182 omatonBuilderFactory]: Interpolants [84353#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 84352#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))))), 84355#(or (not |main_#t~short6|) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))))), 84354#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_#t~mem5.offset| 0) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= |main_#t~mem5.base| 0))), 84357#(and (= 0 |main_#t~mem9.offset|) (= 8 (select |#length| |main_#t~mem9.base|))), 84356#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 84358#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8)), 84335#false, 84334#true, 84337#(= main_~root~0.offset 0), 84336#(= 0 |main_#t~malloc0.offset|), 84339#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4)) 0)), 84338#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 84341#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (or (= 0 (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) (+ main_~root~0.offset 4))) (= main_~root~0.offset main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= (select |#valid| |main_#t~malloc22.base|) 1) (= (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) (+ main_~root~0.offset 4)) |main_#t~malloc22.offset|) (= main_~root~0.offset 0) (= 0 |main_#t~malloc22.offset|)), 84340#(and (or (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (or (= main_~root~0.offset main_~n~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4)) 0)) (= main_~root~0.offset 0)), 84343#(and (or (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0)), 84342#(and (or (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 84345#(and (or (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 1))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 84344#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (or (and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))) 1)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 84347#(and (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (or (and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset |main_#t~malloc13.base|) (+ main_~root~0.offset 4))))) (and (= main_~n~0.base main_~root~0.base) (= 0 (select (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset |main_#t~malloc13.base|) (+ main_~root~0.offset 4))))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset |main_#t~malloc13.offset|) (+ main_~root~0.offset 4))) (not (= main_~n~0.base |main_#t~malloc13.base|))), 84346#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (= (select |#valid| main_~n~0.base) 1) (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (or (and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))) 1) (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))))), 84349#(and (or (and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))) (and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem15.base|))), 84348#(and (or (and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))) (and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (not (= (+ main_~root~0.offset 4) main_~n~0.offset))), 84351#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (not (= (+ main_~root~0.offset 4) main_~n~0.offset))), 84350#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (not (= (+ main_~root~0.offset 4) main_~n~0.offset)))] [2018-02-02 10:01:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:05,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:01:05,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:01:05,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:01:05,364 INFO L87 Difference]: Start difference. First operand 1313 states and 1703 transitions. Second operand 25 states. [2018-02-02 10:01:10,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:10,176 INFO L93 Difference]: Finished difference Result 3391 states and 4403 transitions. [2018-02-02 10:01:10,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-02 10:01:10,176 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2018-02-02 10:01:10,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:10,178 INFO L225 Difference]: With dead ends: 3391 [2018-02-02 10:01:10,178 INFO L226 Difference]: Without dead ends: 3391 [2018-02-02 10:01:10,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2682 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1938, Invalid=6618, Unknown=0, NotChecked=0, Total=8556 [2018-02-02 10:01:10,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2018-02-02 10:01:10,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 1904. [2018-02-02 10:01:10,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-02-02 10:01:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2497 transitions. [2018-02-02 10:01:10,193 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2497 transitions. Word has length 72 [2018-02-02 10:01:10,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:10,193 INFO L432 AbstractCegarLoop]: Abstraction has 1904 states and 2497 transitions. [2018-02-02 10:01:10,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:01:10,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2497 transitions. [2018-02-02 10:01:10,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:01:10,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:10,193 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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:01:10,194 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:10,194 INFO L82 PathProgramCache]: Analyzing trace with hash -337169666, now seen corresponding path program 1 times [2018-02-02 10:01:10,194 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:10,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:10,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:10,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:01:10,456 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:10,456 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:01:10,456 INFO L182 omatonBuilderFactory]: Interpolants [89793#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 89792#(= (select |#valid| main_~root~0.base) 1), 89795#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 89794#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|))), 89797#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| main_~n~0.base)) (= main_~n~0.offset main_~root~0.offset)), 89796#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (not (= main_~n~0.base |main_#t~mem15.base|)) (= main_~n~0.offset main_~root~0.offset)), 89799#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| main_~n~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) main_~n~0.base)) (= main_~n~0.offset main_~root~0.offset)), 89798#(and (= main_~n~0.base main_~root~0.base) (not (= |main_#t~malloc22.base| main_~n~0.base)) (not (= main_~n~0.base (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 89801#(and (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))) (= 1 (select |#valid| main_~root~0.base))), 89800#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 1 (select |#valid| main_~n~0.base)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~n~0.offset main_~root~0.offset)), 89803#(and (= main_~n~0.base main_~root~0.base) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| main_~root~0.base))), 89802#(and (= 1 (select |#valid| main_~root~0.base)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 89805#(and (or (= 1 (select (store |#valid| main_~n~0.base 0) main_~root~0.base)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)))) (= main_~pred~0.base main_~root~0.base)), 89804#(and (= 1 (select |#valid| main_~root~0.base)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset))) (= main_~pred~0.base main_~root~0.base)), 89807#(and (= 1 (select (store |#valid| main_~n~0.base 0) main_~root~0.base)) (= main_~pred~0.base main_~root~0.base)), 89806#(and (or (= 1 (select (store |#valid| main_~n~0.base 0) main_~root~0.base)) (not (= main_~n~0.base |main_#t~mem34.base|))) (= 1 (select |#valid| main_~pred~0.base)) (= main_~pred~0.base main_~root~0.base)), 89809#(= 1 (select |#valid| main_~n~0.base)), 89808#(= 1 (select (store |#valid| main_~n~0.base 0) main_~root~0.base)), 89791#false, 89790#true] [2018-02-02 10:01:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:10,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:01:10,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:01:10,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:01:10,457 INFO L87 Difference]: Start difference. First operand 1904 states and 2497 transitions. Second operand 20 states. [2018-02-02 10:01:11,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:11,297 INFO L93 Difference]: Finished difference Result 3023 states and 3923 transitions. [2018-02-02 10:01:11,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 10:01:11,297 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-02-02 10:01:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:11,299 INFO L225 Difference]: With dead ends: 3023 [2018-02-02 10:01:11,299 INFO L226 Difference]: Without dead ends: 3023 [2018-02-02 10:01:11,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=433, Invalid=1637, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:01:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2018-02-02 10:01:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 1888. [2018-02-02 10:01:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1888 states. [2018-02-02 10:01:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2481 transitions. [2018-02-02 10:01:11,312 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2481 transitions. Word has length 72 [2018-02-02 10:01:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:11,312 INFO L432 AbstractCegarLoop]: Abstraction has 1888 states and 2481 transitions. [2018-02-02 10:01:11,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:01:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2481 transitions. [2018-02-02 10:01:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:01:11,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:11,313 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:11,313 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:11,313 INFO L82 PathProgramCache]: Analyzing trace with hash 991022369, now seen corresponding path program 2 times [2018-02-02 10:01:11,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:11,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:01:11,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:11,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:01:11,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:11,367 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:01:11,367 INFO L182 omatonBuilderFactory]: Interpolants [94773#true, 94775#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset main_~root~0.offset)), 94774#false, 94777#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 94776#(and (= main_~pred~0.offset main_~root~0.offset) (= main_~pred~0.base main_~root~0.base)), 94779#(and (= |main_#t~mem28.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem28.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 94778#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 94780#(not |main_#t~short30|)] [2018-02-02 10:01:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:01:11,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:01:11,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:01:11,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:01:11,368 INFO L87 Difference]: Start difference. First operand 1888 states and 2481 transitions. Second operand 8 states. [2018-02-02 10:01:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:11,688 INFO L93 Difference]: Finished difference Result 2204 states and 2858 transitions. [2018-02-02 10:01:11,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:01:11,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-02-02 10:01:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:11,690 INFO L225 Difference]: With dead ends: 2204 [2018-02-02 10:01:11,690 INFO L226 Difference]: Without dead ends: 2204 [2018-02-02 10:01:11,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:01:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2018-02-02 10:01:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1836. [2018-02-02 10:01:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1836 states. [2018-02-02 10:01:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2401 transitions. [2018-02-02 10:01:11,700 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2401 transitions. Word has length 73 [2018-02-02 10:01:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:11,701 INFO L432 AbstractCegarLoop]: Abstraction has 1836 states and 2401 transitions. [2018-02-02 10:01:11,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:01:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2401 transitions. [2018-02-02 10:01:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 10:01:11,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:11,701 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:01:11,701 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash 733100631, now seen corresponding path program 1 times [2018-02-02 10:01:11,702 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:11,711 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:01:11,910 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:01:11,916 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:01:11,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:01:11 BoogieIcfgContainer [2018-02-02 10:01:11,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:01:11,917 INFO L168 Benchmark]: Toolchain (without parser) took 49126.10 ms. Allocated memory was 402.1 MB in the beginning and 1.1 GB in the end (delta: 733.5 MB). Free memory was 359.0 MB in the beginning and 822.8 MB in the end (delta: -463.8 MB). Peak memory consumption was 269.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:01:11,918 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:01:11,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.68 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 348.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:01:11,918 INFO L168 Benchmark]: Boogie Preprocessor took 28.56 ms. Allocated memory is still 402.1 MB. Free memory was 348.4 MB in the beginning and 345.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:01:11,919 INFO L168 Benchmark]: RCFGBuilder took 396.30 ms. Allocated memory is still 402.1 MB. Free memory was 345.8 MB in the beginning and 310.2 MB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:01:11,919 INFO L168 Benchmark]: TraceAbstraction took 48536.45 ms. Allocated memory was 402.1 MB in the beginning and 1.1 GB in the end (delta: 733.5 MB). Free memory was 310.2 MB in the beginning and 822.8 MB in the end (delta: -512.6 MB). Peak memory consumption was 220.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:01:11,920 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.13 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.68 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 348.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.56 ms. Allocated memory is still 402.1 MB. Free memory was 348.4 MB in the beginning and 345.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 396.30 ms. Allocated memory is still 402.1 MB. Free memory was 345.8 MB in the beginning and 310.2 MB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 48536.45 ms. Allocated memory was 402.1 MB in the beginning and 1.1 GB in the end (delta: 733.5 MB). Free memory was 310.2 MB in the beginning and 822.8 MB in the end (delta: -512.6 MB). Peak memory consumption was 220.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 55 error locations. TIMEOUT Result, 48.5s OverallTime, 61 OverallIterations, 4 TraceHistogramMax, 36.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6618 SDtfs, 32234 SDslu, 34571 SDs, 0 SdLazy, 37899 SolverSat, 3163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1482 GetRequests, 139 SyntacticMatches, 37 SemanticMatches, 1306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10810 ImplicationChecksByTransitivity, 23.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1904occurred in iteration=58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 175/520 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 60 MinimizatonAttempts, 18701 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 2751 NumberOfCodeBlocks, 2751 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 2691 ConstructedInterpolants, 0 QuantifiedInterpolants, 2073663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 60 InterpolantComputations, 23 PerfectInterpolantSequences, 175/520 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/tree_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-01-11-927.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-01-11-927.csv Completed graceful shutdown