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/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:26:21,623 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:26:21,624 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:26:21,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:26:21,634 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:26:21,635 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:26:21,635 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:26:21,636 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:26:21,637 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:26:21,638 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:26:21,638 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:26:21,638 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:26:21,639 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:26:21,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:26:21,640 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:26:21,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:26:21,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:26:21,646 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:26:21,647 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:26:21,648 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:26:21,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:26:21,650 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:26:21,650 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:26:21,651 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:26:21,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:26:21,652 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:26:21,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:26:21,653 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:26:21,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:26:21,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:26:21,654 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:26:21,655 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:26:21,664 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:26:21,664 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:26:21,665 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:26:21,665 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:26:21,665 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:26:21,666 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:26:21,666 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:26:21,666 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:26:21,666 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:26:21,666 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:26:21,666 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:26:21,666 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:26:21,666 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:26:21,667 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:26:21,667 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:26:21,667 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:26:21,667 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:26:21,667 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:26:21,667 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:26:21,667 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:26:21,668 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:26:21,668 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:26:21,668 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:26:21,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:26:21,708 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:26:21,711 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:26:21,713 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:26:21,713 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:26:21,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:26:21,855 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:26:21,856 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:26:21,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:26:21,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:26:21,863 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:26:21,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:26:21" (1/1) ... [2018-02-02 10:26:21,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd3f7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:26:21, skipping insertion in model container [2018-02-02 10:26:21,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:26:21" (1/1) ... [2018-02-02 10:26:21,881 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:26:21,911 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:26:22,004 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:26:22,017 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:26:22,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:26:22 WrapperNode [2018-02-02 10:26:22,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:26:22,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:26:22,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:26:22,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:26:22,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:26:22" (1/1) ... [2018-02-02 10:26:22,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:26:22" (1/1) ... [2018-02-02 10:26:22,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:26:22" (1/1) ... [2018-02-02 10:26:22,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:26:22" (1/1) ... [2018-02-02 10:26:22,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:26:22" (1/1) ... [2018-02-02 10:26:22,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:26:22" (1/1) ... [2018-02-02 10:26:22,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:26:22" (1/1) ... [2018-02-02 10:26:22,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:26:22,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:26:22,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:26:22,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:26:22,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:26: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:26:22,088 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:26:22,088 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:26:22,088 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-02 10:26:22,088 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:26:22,089 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:26:22,089 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:26:22,089 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:26:22,089 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:26:22,089 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:26:22,089 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:26:22,089 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:26:22,089 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:26:22,089 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:26:22,089 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:26:22,089 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:26:22,089 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-02 10:26:22,089 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:26:22,089 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:26:22,090 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:26:22,329 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:26:22,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:26:22 BoogieIcfgContainer [2018-02-02 10:26:22,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:26:22,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:26:22,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:26:22,333 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:26:22,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:26:21" (1/3) ... [2018-02-02 10:26:22,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7308b7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:26:22, skipping insertion in model container [2018-02-02 10:26:22,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:26:22" (2/3) ... [2018-02-02 10:26:22,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7308b7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:26:22, skipping insertion in model container [2018-02-02 10:26:22,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:26:22" (3/3) ... [2018-02-02 10:26:22,336 INFO L107 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:26:22,343 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:26:22,348 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-02-02 10:26:22,376 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:26:22,377 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:26:22,377 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:26:22,377 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:26:22,377 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:26:22,378 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:26:22,378 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:26:22,378 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:26:22,379 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:26:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-02-02 10:26:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 10:26:22,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:22,398 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:22,398 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:22,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1444354772, now seen corresponding path program 1 times [2018-02-02 10:26:22,437 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:22,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:22,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:26:22,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:26:22,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:26:22,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:22,501 INFO L182 omatonBuilderFactory]: Interpolants [84#true, 85#false] [2018-02-02 10:26:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:22,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 10:26:22,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 10:26:22,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:26:22,518 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 2 states. [2018-02-02 10:26:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:22,535 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-02-02 10:26:22,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 10:26:22,616 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-02-02 10:26:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:22,622 INFO L225 Difference]: With dead ends: 81 [2018-02-02 10:26:22,622 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 10:26:22,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:26:22,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 10:26:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-02 10:26:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 10:26:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-02-02 10:26:22,650 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2018-02-02 10:26:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:22,650 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-02-02 10:26:22,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 10:26:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-02-02 10:26:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:26:22,651 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:22,651 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:22,651 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:22,651 INFO L82 PathProgramCache]: Analyzing trace with hash 749299640, now seen corresponding path program 1 times [2018-02-02 10:26:22,652 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:22,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:22,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:26:22,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:26:22,702 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:22,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:22,703 INFO L182 omatonBuilderFactory]: Interpolants [240#true, 241#false, 242#(= 1 (select |#valid| |main_#t~malloc0.base|)), 243#(= 1 (select |#valid| main_~a~0.base)), 244#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:26:22,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:22,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:26:22,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:26:22,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:26:22,704 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 5 states. [2018-02-02 10:26:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:22,867 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-02-02 10:26:22,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:26:22,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:26:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:22,868 INFO L225 Difference]: With dead ends: 91 [2018-02-02 10:26:22,868 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 10:26:22,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:26:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 10:26:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2018-02-02 10:26:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:26:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2018-02-02 10:26:22,876 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 14 [2018-02-02 10:26:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:22,876 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2018-02-02 10:26:22,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:26:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2018-02-02 10:26:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:26:22,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:22,877 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:22,877 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:22,877 INFO L82 PathProgramCache]: Analyzing trace with hash 749299641, now seen corresponding path program 1 times [2018-02-02 10:26:22,878 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:22,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:22,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:26:22,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:26:22,950 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:22,950 INFO L182 omatonBuilderFactory]: Interpolants [417#true, 418#false, 419#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 420#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset)), 421#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:26:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:22,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:26:22,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:26:22,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:26:22,951 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 5 states. [2018-02-02 10:26:23,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:23,088 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-02-02 10:26:23,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:26:23,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:26:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:23,090 INFO L225 Difference]: With dead ends: 102 [2018-02-02 10:26:23,090 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 10:26:23,090 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:26:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 10:26:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2018-02-02 10:26:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 10:26:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-02-02 10:26:23,095 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 14 [2018-02-02 10:26:23,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:23,095 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-02-02 10:26:23,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:26:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-02-02 10:26:23,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:26:23,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:23,095 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:26:23,096 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:23,096 INFO L82 PathProgramCache]: Analyzing trace with hash 129960215, now seen corresponding path program 1 times [2018-02-02 10:26:23,096 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:23,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:23,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:26:23,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:26:23,213 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:23,214 INFO L182 omatonBuilderFactory]: Interpolants [624#(= |#valid| |old(#valid)|), 625#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 626#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (not (= 0 main_~a~0.base))), 627#(and (not (= 0 main_~p~0.base)) (= (store |#valid| main_~p~0.base (select (store |#valid| main_~p~0.base 0) main_~p~0.base)) |old(#valid)|)), 622#true, 623#false] [2018-02-02 10:26:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:23,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:26:23,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:26:23,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:26:23,217 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 6 states. [2018-02-02 10:26:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:23,407 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-02-02 10:26:23,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:26:23,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 10:26:23,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:23,408 INFO L225 Difference]: With dead ends: 133 [2018-02-02 10:26:23,408 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 10:26:23,409 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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:26:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 10:26:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2018-02-02 10:26:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 10:26:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 136 transitions. [2018-02-02 10:26:23,416 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 136 transitions. Word has length 25 [2018-02-02 10:26:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:23,417 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 136 transitions. [2018-02-02 10:26:23,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:26:23,417 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2018-02-02 10:26:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:26:23,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:23,418 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:26:23,418 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:23,418 INFO L82 PathProgramCache]: Analyzing trace with hash 130009866, now seen corresponding path program 1 times [2018-02-02 10:26:23,419 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:23,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:23,474 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:26:23,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:26:23,475 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:23,475 INFO L182 omatonBuilderFactory]: Interpolants [885#true, 886#false, 887#(= 0 |main_#t~malloc0.offset|), 888#(= 0 main_~a~0.offset), 889#(= 0 main_~p~0.offset), 890#(= 0 main_~tmp~0.offset)] [2018-02-02 10:26:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:23,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:26:23,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:26:23,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:26:23,476 INFO L87 Difference]: Start difference. First operand 118 states and 136 transitions. Second operand 6 states. [2018-02-02 10:26:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:23,600 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2018-02-02 10:26:23,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:26:23,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 10:26:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:23,602 INFO L225 Difference]: With dead ends: 129 [2018-02-02 10:26:23,603 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:26:23,603 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:26:23,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:26:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2018-02-02 10:26:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 10:26:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2018-02-02 10:26:23,609 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 25 [2018-02-02 10:26:23,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:23,610 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2018-02-02 10:26:23,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:26:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2018-02-02 10:26:23,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:26:23,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:23,611 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:26:23,611 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:23,611 INFO L82 PathProgramCache]: Analyzing trace with hash 130009867, now seen corresponding path program 1 times [2018-02-02 10:26:23,612 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:23,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:23,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:26:23,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:26:23,654 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:23,654 INFO L182 omatonBuilderFactory]: Interpolants [1152#(= 1 (select |#valid| main_~p~0.base)), 1153#(= 1 (select |#valid| main_~tmp~0.base)), 1148#true, 1149#false, 1150#(= main_~p~0.base main_~a~0.base), 1151#(= 1 (select |#valid| main_~a~0.base))] [2018-02-02 10:26:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:23,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:26:23,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:26:23,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:26:23,655 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand 6 states. [2018-02-02 10:26:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:23,808 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2018-02-02 10:26:23,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:26:23,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 10:26:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:23,809 INFO L225 Difference]: With dead ends: 127 [2018-02-02 10:26:23,809 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 10:26:23,809 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:26:23,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 10:26:23,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-02-02 10:26:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:26:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2018-02-02 10:26:23,814 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 25 [2018-02-02 10:26:23,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:23,815 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2018-02-02 10:26:23,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:26:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2018-02-02 10:26:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:26:23,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:23,816 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] [2018-02-02 10:26:23,816 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:23,816 INFO L82 PathProgramCache]: Analyzing trace with hash 825919103, now seen corresponding path program 1 times [2018-02-02 10:26:23,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:23,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:23,836 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:26:23,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:26:23,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:26:23,836 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:23,837 INFO L182 omatonBuilderFactory]: Interpolants [1410#true, 1411#false, 1412#(= main_~flag~0 1)] [2018-02-02 10:26:23,837 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:26:23,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:26:23,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:26:23,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:26:23,837 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand 3 states. [2018-02-02 10:26:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:23,847 INFO L93 Difference]: Finished difference Result 175 states and 197 transitions. [2018-02-02 10:26:23,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:26:23,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-02-02 10:26:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:23,848 INFO L225 Difference]: With dead ends: 175 [2018-02-02 10:26:23,848 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 10:26:23,849 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:26:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 10:26:23,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 135. [2018-02-02 10:26:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 10:26:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 161 transitions. [2018-02-02 10:26:23,854 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 161 transitions. Word has length 25 [2018-02-02 10:26:23,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:23,855 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 161 transitions. [2018-02-02 10:26:23,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:26:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 161 transitions. [2018-02-02 10:26:23,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:26:23,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:23,856 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] [2018-02-02 10:26:23,856 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:23,856 INFO L82 PathProgramCache]: Analyzing trace with hash 245290165, now seen corresponding path program 1 times [2018-02-02 10:26:23,857 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26: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:26:23,897 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:26:23,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:26:23,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:26:23,897 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:23,898 INFO L182 omatonBuilderFactory]: Interpolants [1728#(= |main_#t~mem8| 3), 1723#true, 1724#false, 1725#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 1726#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 1727#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))] [2018-02-02 10:26:23,898 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:26:23,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:26:23,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:26:23,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:26:23,898 INFO L87 Difference]: Start difference. First operand 135 states and 161 transitions. Second operand 6 states. [2018-02-02 10:26:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:24,029 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2018-02-02 10:26:24,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:26:24,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 10:26:24,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:24,030 INFO L225 Difference]: With dead ends: 139 [2018-02-02 10:26:24,030 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 10:26:24,030 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:26:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 10:26:24,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 115. [2018-02-02 10:26:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 10:26:24,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-02-02 10:26:24,033 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 25 [2018-02-02 10:26:24,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:24,033 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-02-02 10:26:24,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:26:24,033 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-02-02 10:26:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:26:24,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:24,033 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:24,033 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:24,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1978391014, now seen corresponding path program 1 times [2018-02-02 10:26:24,034 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:24,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:24,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:26:24,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:26:24,070 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:24,070 INFO L182 omatonBuilderFactory]: Interpolants [1987#true, 1988#false, 1989#(= 1 (select |#valid| |main_#t~malloc4.base|)), 1990#(= 1 (select |#valid| main_~t~0.base)), 1991#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 1992#(= 1 (select |#valid| |main_#t~mem6.base|)), 1993#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:26:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:24,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:26:24,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:26:24,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:26:24,071 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 7 states. [2018-02-02 10:26:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:24,168 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2018-02-02 10:26:24,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:26:24,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 10:26:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:24,169 INFO L225 Difference]: With dead ends: 115 [2018-02-02 10:26:24,169 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 10:26:24,170 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:26:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 10:26:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-02-02 10:26:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:26:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2018-02-02 10:26:24,173 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 26 [2018-02-02 10:26:24,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:24,173 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2018-02-02 10:26:24,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:26:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-02-02 10:26:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:26:24,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:24,174 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:24,174 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:24,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1978391015, now seen corresponding path program 1 times [2018-02-02 10:26:24,175 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:24,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:24,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:26:24,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:26:24,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:24,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:26:24,259 INFO L182 omatonBuilderFactory]: Interpolants [2232#true, 2233#false, 2234#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 2235#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 2236#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 2237#(and (= 0 |main_#t~mem6.offset|) (= 8 (select |#length| |main_#t~mem6.base|))), 2238#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:26:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:24,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:26:24,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:26:24,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:26:24,260 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 7 states. [2018-02-02 10:26:24,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:24,407 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-02-02 10:26:24,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:26:24,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 10:26:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:24,408 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:26:24,408 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:26:24,409 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:26:24,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:26:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 99. [2018-02-02 10:26:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:26:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-02-02 10:26:24,411 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 26 [2018-02-02 10:26:24,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:24,412 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-02-02 10:26:24,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:26:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-02-02 10:26:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:26:24,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:24,412 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] [2018-02-02 10:26:24,412 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:24,412 INFO L82 PathProgramCache]: Analyzing trace with hash 385432044, now seen corresponding path program 1 times [2018-02-02 10:26:24,413 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:24,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:24,455 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:26:24,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:26:24,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:26:24,456 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:24,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:26:24,456 INFO L182 omatonBuilderFactory]: Interpolants [2480#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) |main_#t~mem8|), 2481#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 2482#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 2483#(= 3 |main_#t~mem12|), 2477#true, 2478#false, 2479#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))] [2018-02-02 10:26:24,456 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:26:24,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:26:24,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:26:24,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:26:24,457 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 7 states. [2018-02-02 10:26:24,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:24,543 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-02-02 10:26:24,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:26:24,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 10:26:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:24,544 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:26:24,544 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 10:26:24,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:26:24,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 10:26:24,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 94. [2018-02-02 10:26:24,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 10:26:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-02-02 10:26:24,546 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 27 [2018-02-02 10:26:24,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:24,546 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-02-02 10:26:24,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:26:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-02-02 10:26:24,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:26:24,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:24,547 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:24,547 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:24,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1053625897, now seen corresponding path program 1 times [2018-02-02 10:26:24,547 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:24,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:24,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:24,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:26:24,760 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:24,760 INFO L182 omatonBuilderFactory]: Interpolants [2707#true, 2708#false, 2709#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 2710#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 2711#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 2712#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 2713#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 2714#(and (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base |main_#t~mem6.base|))), 2715#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)), 2716#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 2717#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~a~0.offset)) (= main_~p~0.base main_~a~0.base)), 2718#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 2719#(= 1 |main_#t~mem12|)] [2018-02-02 10:26:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:24,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:26:24,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:26:24,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:26:24,761 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 13 states. [2018-02-02 10:26:24,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:24,994 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2018-02-02 10:26:24,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:26:24,995 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-02 10:26:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:24,995 INFO L225 Difference]: With dead ends: 180 [2018-02-02 10:26:24,996 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 10:26:24,996 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:26:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 10:26:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 135. [2018-02-02 10:26:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 10:26:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2018-02-02 10:26:25,002 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 37 [2018-02-02 10:26:25,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:25,003 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2018-02-02 10:26:25,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:26:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2018-02-02 10:26:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:26:25,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:25,004 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] [2018-02-02 10:26:25,004 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:25,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1168955847, now seen corresponding path program 1 times [2018-02-02 10:26:25,005 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:25,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:25,240 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:26:25,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:25,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:26:25,241 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26: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:26:25,242 INFO L182 omatonBuilderFactory]: Interpolants [3049#true, 3050#false, 3051#(= 0 |main_#t~malloc0.offset|), 3052#(= 0 main_~a~0.offset), 3053#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3054#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 3055#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| |main_#t~malloc4.base|)) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base)), 3056#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= 1 (select |#valid| main_~t~0.base))), 3057#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3058#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem6.base|))), 3059#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 3060#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 3061#(or (= 0 main_~flag~0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 3062#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 3063#(= 1 (select |#valid| |main_#t~mem11.base|)), 3064#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:26:25,242 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:26:25,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:26:25,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:26:25,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:26:25,243 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand 16 states. [2018-02-02 10:26:25,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:25,984 INFO L93 Difference]: Finished difference Result 181 states and 200 transitions. [2018-02-02 10:26:25,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:26:25,984 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-02-02 10:26:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:25,985 INFO L225 Difference]: With dead ends: 181 [2018-02-02 10:26:25,985 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 10:26:25,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=343, Invalid=1063, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:26:25,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 10:26:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 138. [2018-02-02 10:26:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 10:26:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 162 transitions. [2018-02-02 10:26:25,989 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 162 transitions. Word has length 37 [2018-02-02 10:26:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:25,990 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 162 transitions. [2018-02-02 10:26:25,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:26:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 162 transitions. [2018-02-02 10:26:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:26:25,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:25,991 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] [2018-02-02 10:26:25,991 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:25,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1168955848, now seen corresponding path program 1 times [2018-02-02 10:26:25,992 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:26,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:26,203 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:26:26,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:26,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:26:26,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:26,204 INFO L182 omatonBuilderFactory]: Interpolants [3428#true, 3429#false, 3430#(= 0 |main_#t~malloc0.offset|), 3431#(= 0 main_~a~0.offset), 3432#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3433#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 3434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 3435#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 3436#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 3437#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 3438#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 3439#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 3440#(and (or (= 0 main_~flag~0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))) (= main_~p~0.offset 0)), 3441#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 3442#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| |main_#t~mem11.base|))), 3443#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:26:26,205 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:26:26,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:26:26,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:26:26,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:26:26,205 INFO L87 Difference]: Start difference. First operand 138 states and 162 transitions. Second operand 16 states. [2018-02-02 10:26:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:26,679 INFO L93 Difference]: Finished difference Result 204 states and 227 transitions. [2018-02-02 10:26:26,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:26:26,680 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-02-02 10:26:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:26,680 INFO L225 Difference]: With dead ends: 204 [2018-02-02 10:26:26,680 INFO L226 Difference]: Without dead ends: 204 [2018-02-02 10:26:26,681 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:26:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-02 10:26:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 146. [2018-02-02 10:26:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:26:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2018-02-02 10:26:26,684 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 37 [2018-02-02 10:26:26,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:26,684 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2018-02-02 10:26:26,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:26:26,684 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2018-02-02 10:26:26,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:26:26,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:26,685 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] [2018-02-02 10:26:26,685 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:26,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1241064672, now seen corresponding path program 1 times [2018-02-02 10:26:26,686 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:26,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:26,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:26,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:26:26,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:26,883 INFO L182 omatonBuilderFactory]: Interpolants [3840#(= |main_#t~mem8| 3), 3824#true, 3825#false, 3826#(= 0 |main_#t~malloc0.offset|), 3827#(= 0 main_~a~0.offset), 3828#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3829#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 3830#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base)), 3831#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 3832#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3833#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 3834#(and (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 3835#(and (= 0 main_~a~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))))), 3836#(or (= 0 main_~flag~0) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 3837#(= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 3838#(= 3 (select (select |#memory_int| |main_#t~mem11.base|) |main_#t~mem11.offset|)), 3839#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))] [2018-02-02 10:26:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:26,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:26:26,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:26:26,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:26:26,884 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand 17 states. [2018-02-02 10:26:27,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:27,360 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-02-02 10:26:27,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:26:27,360 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-02-02 10:26:27,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:27,361 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:26:27,361 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 10:26:27,362 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1132, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:26:27,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 10:26:27,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 123. [2018-02-02 10:26:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:26:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2018-02-02 10:26:27,364 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 45 [2018-02-02 10:26:27,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:27,365 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2018-02-02 10:26:27,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:26:27,365 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2018-02-02 10:26:27,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:26:27,365 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:27,365 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] [2018-02-02 10:26:27,366 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:27,366 INFO L82 PathProgramCache]: Analyzing trace with hash -91634675, now seen corresponding path program 1 times [2018-02-02 10:26:27,369 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:27,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:27,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:27,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:26:27,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:27,663 INFO L182 omatonBuilderFactory]: Interpolants [4169#true, 4170#false, 4171#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 4172#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 4173#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 4174#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 4175#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base)), 4176#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (not (= main_~a~0.base main_~t~0.base))), 4177#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 4178#(and (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base |main_#t~mem6.base|))), 4179#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 4180#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 4181#(or (= 0 main_~flag~0) (and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base))), 4182#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 4183#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= 0 main_~p~0.base))), 4184#(and (not (= 0 main_~tmp~0.base)) (= 1 (select (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 4185#(and (not (= 0 main_~tmp~0.base)) (= 1 (select (store |#valid| main_~tmp~0.base 0) |main_#t~mem13.base|))), 4186#(and (not (= 0 main_~tmp~0.base)) (= 1 (select (store |#valid| main_~tmp~0.base 0) main_~p~0.base))), 4187#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:26:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:27,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:26:27,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:26:27,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:26:27,664 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 19 states. [2018-02-02 10:26:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:28,420 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2018-02-02 10:26:28,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:26:28,420 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-02-02 10:26:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:28,420 INFO L225 Difference]: With dead ends: 167 [2018-02-02 10:26:28,421 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 10:26:28,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=365, Invalid=1527, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:26:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 10:26:28,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 128. [2018-02-02 10:26:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 10:26:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2018-02-02 10:26:28,423 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 47 [2018-02-02 10:26:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:28,423 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2018-02-02 10:26:28,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:26:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2018-02-02 10:26:28,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:26:28,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:28,424 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] [2018-02-02 10:26:28,424 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:28,424 INFO L82 PathProgramCache]: Analyzing trace with hash -91634674, now seen corresponding path program 1 times [2018-02-02 10:26:28,424 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:28,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:28,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:28,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:26:28,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:28,680 INFO L182 omatonBuilderFactory]: Interpolants [4544#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 4545#(or (= 0 main_~flag~0) (and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))))), 4546#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 4547#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 4548#(and (= 8 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|)), 4549#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 4533#true, 4534#false, 4535#(= 0 |main_#t~malloc0.offset|), 4536#(= 0 main_~a~0.offset), 4537#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4538#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 4539#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 4540#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 4541#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 4542#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 4543#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))] [2018-02-02 10:26:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:28,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:26:28,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:26:28,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:26:28,681 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand 17 states. [2018-02-02 10:26:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:29,271 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2018-02-02 10:26:29,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:26:29,271 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 10:26:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:29,272 INFO L225 Difference]: With dead ends: 185 [2018-02-02 10:26:29,272 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 10:26:29,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:26:29,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 10:26:29,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 130. [2018-02-02 10:26:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 10:26:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2018-02-02 10:26:29,275 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 47 [2018-02-02 10:26:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:29,275 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2018-02-02 10:26:29,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:26:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2018-02-02 10:26:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:26:29,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:29,276 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:29,276 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:29,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1523447749, now seen corresponding path program 2 times [2018-02-02 10:26:29,277 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:29,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:29,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:26:29,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:26:29,298 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:29,298 INFO L182 omatonBuilderFactory]: Interpolants [4901#true, 4902#false, 4903#(= main_~flag~0 0)] [2018-02-02 10:26:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:29,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:26:29,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:26:29,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:26:29,299 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 3 states. [2018-02-02 10:26:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:29,308 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2018-02-02 10:26:29,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:26:29,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-02-02 10:26:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:29,309 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:26:29,309 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:26:29,309 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:26:29,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:26:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 130. [2018-02-02 10:26:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 10:26:29,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2018-02-02 10:26:29,312 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 49 [2018-02-02 10:26:29,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:29,312 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2018-02-02 10:26:29,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:26:29,312 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2018-02-02 10:26:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:26:29,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:29,313 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:26:29,313 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:29,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1904695477, now seen corresponding path program 1 times [2018-02-02 10:26:29,314 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:29,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:29,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:29,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:26:29,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:29,526 INFO L182 omatonBuilderFactory]: Interpolants [5192#true, 5193#false, 5194#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 5195#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 5196#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 5197#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 5198#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 5199#(and (= (select |#valid| main_~a~0.base) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base |main_#t~mem6.base|))), 5200#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset))), 5201#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 5202#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~t~0.base))), 5203#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 5204#(and (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base |main_#t~mem6.base|))), 5205#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)), 5206#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 5207#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~a~0.offset)) (= main_~p~0.base main_~a~0.base)), 5208#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 5209#(= 1 |main_#t~mem12|)] [2018-02-02 10:26:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:29,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:26:29,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:26:29,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:26:29,527 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 18 states. [2018-02-02 10:26:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:29,910 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-02-02 10:26:29,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:26:29,910 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-02-02 10:26:29,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:29,911 INFO L225 Difference]: With dead ends: 131 [2018-02-02 10:26:29,911 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 10:26:29,911 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:26:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 10:26:29,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-02-02 10:26:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:26:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-02-02 10:26:29,913 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 49 [2018-02-02 10:26:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:29,914 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-02-02 10:26:29,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:26:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-02-02 10:26:29,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:26:29,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:29,914 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:26:29,914 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:29,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2020025427, now seen corresponding path program 1 times [2018-02-02 10:26:29,915 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:29,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:30,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:30,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:26:30,167 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:30,167 INFO L182 omatonBuilderFactory]: Interpolants [5504#(and (= 0 main_~a~0.offset) (not (= |main_#t~malloc4.base| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 5505#(and (not (= main_~t~0.base main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))), 5506#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 5507#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 5508#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 5509#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 5510#(and (= main_~p~0.offset 0) (or (= 0 main_~flag~0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))))), 5511#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 5512#(= 1 (select |#valid| |main_#t~mem11.base|)), 5513#(= 1 (select |#valid| main_~p~0.base)), 5493#true, 5494#false, 5495#(= 0 |main_#t~malloc0.offset|), 5496#(= 0 main_~a~0.offset), 5497#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5498#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 5499#(and (not (= |main_#t~malloc4.base| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5500#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base main_~p~0.base))), 5501#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 5502#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 5503#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))] [2018-02-02 10:26:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:30,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:26:30,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:26:30,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:26:30,168 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 21 states. [2018-02-02 10:26:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:30,771 INFO L93 Difference]: Finished difference Result 195 states and 211 transitions. [2018-02-02 10:26:30,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:26:30,771 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-02-02 10:26:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:30,771 INFO L225 Difference]: With dead ends: 195 [2018-02-02 10:26:30,772 INFO L226 Difference]: Without dead ends: 195 [2018-02-02 10:26:30,772 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=1441, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:26:30,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-02 10:26:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 150. [2018-02-02 10:26:30,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:26:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 161 transitions. [2018-02-02 10:26:30,774 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 161 transitions. Word has length 49 [2018-02-02 10:26:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:30,774 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 161 transitions. [2018-02-02 10:26:30,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:26:30,774 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 161 transitions. [2018-02-02 10:26:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:26:30,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:30,775 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:26:30,775 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2020025428, now seen corresponding path program 1 times [2018-02-02 10:26:30,775 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:30,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:31,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:31,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:26:31,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:31,175 INFO L182 omatonBuilderFactory]: Interpolants [5920#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 5921#(or (= 0 main_~flag~0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 5922#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 5923#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| |main_#t~mem11.base|))), 5924#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 5903#true, 5904#false, 5905#(= 0 |main_#t~malloc0.offset|), 5906#(= 0 main_~a~0.offset), 5907#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5908#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 5909#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 5910#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 5911#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 5912#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| |main_#t~mem6.base|)) (not (= main_~a~0.base |main_#t~mem6.base|))), 5913#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 5914#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 5915#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= |main_#t~malloc4.base| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 5916#(and (not (= main_~t~0.base main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 5917#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 5918#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 5919#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))] [2018-02-02 10:26:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:31,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:26:31,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:26:31,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:26:31,176 INFO L87 Difference]: Start difference. First operand 150 states and 161 transitions. Second operand 22 states. [2018-02-02 10:26:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:32,055 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2018-02-02 10:26:32,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:26:32,055 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-02-02 10:26:32,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:32,056 INFO L225 Difference]: With dead ends: 218 [2018-02-02 10:26:32,056 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 10:26:32,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=421, Invalid=1741, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:26:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 10:26:32,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 155. [2018-02-02 10:26:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 10:26:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2018-02-02 10:26:32,059 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 49 [2018-02-02 10:26:32,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:32,059 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2018-02-02 10:26:32,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:26:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2018-02-02 10:26:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:26:32,060 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:32,060 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] [2018-02-02 10:26:32,060 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:32,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1491447004, now seen corresponding path program 1 times [2018-02-02 10:26:32,061 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:32,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:32,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:32,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:26:32,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:32,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:26:32,709 INFO L182 omatonBuilderFactory]: Interpolants [6368#(and (= (store (store |#valid| main_~p~0.base 0) main_~tmp~0.base (select (store |#valid| main_~tmp~0.base 0) main_~tmp~0.base)) |old(#valid)|) (not (= 0 main_~tmp~0.base)) (not (= (select |#valid| 0) 1)) (not (= main_~tmp~0.base main_~p~0.base))), 6369#(and (or (not (= main_~p~0.base 0)) (not (= (select |#valid| main_~p~0.base) 1))) (= (store |#valid| main_~p~0.base (select (store |#valid| main_~p~0.base 0) main_~p~0.base)) |old(#valid)|)), 6370#(and (not (= main_~p~0.base 0)) (= (select |#valid| main_~p~0.base) 1) (= (store |#valid| main_~p~0.base (select (store |#valid| main_~p~0.base 0) main_~p~0.base)) |old(#valid)|)), 6371#(= |#valid| |old(#valid)|), 6348#true, 6349#false, 6350#(= 0 (select |#valid| 0)), 6351#(and (= |#valid| |old(#valid)|) (= 0 (select |#valid| 0))), 6352#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|) (= 0 (select |#valid| 0))), 6353#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (= 0 (select |#valid| 0)) (not (= 0 main_~a~0.base))), 6354#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select |#valid| 0)) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 6355#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 6356#(and (= 0 main_~a~0.offset) (= (store (store |#valid| |main_#t~malloc4.base| 0) main_~a~0.base 0) |old(#valid)|) (= main_~p~0.offset 0) (= 0 (select |#valid| 0)) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base)), 6357#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select |#valid| 0)) (not (= 0 main_~a~0.base)) (= (store (store |#valid| main_~t~0.base 0) main_~a~0.base 0) |old(#valid)|) (= main_~p~0.base main_~a~0.base) (not (= main_~a~0.base main_~t~0.base))), 6358#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select |#valid| 0)) (not (= 0 main_~a~0.base)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0) main_~a~0.base 0) |old(#valid)|) (= main_~p~0.base main_~a~0.base)), 6359#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select |#valid| 0)) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base |main_#t~mem6.base|)) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) main_~a~0.base 0))), 6360#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select |#valid| 0)) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base)) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) main_~a~0.base 0))), 6361#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select |#valid| 0)) (not (= 0 main_~a~0.base)) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) main_~a~0.base 0))), 6362#(and (not (= 0 main_~a~0.base)) (or (= 0 main_~flag~0) (and (= 0 main_~a~0.offset) (= main_~flag~0 1) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select |#valid| 0)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) main_~a~0.base 0) |old(#valid)|) (= main_~p~0.base main_~a~0.base)))), 6363#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) main_~a~0.base 0) |old(#valid)|) (not (= (select |#valid| 0) 1)) (= main_~p~0.base main_~a~0.base)), 6364#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= (select |#valid| 0) 1)) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) main_~a~0.base 0))), 6365#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0) main_~p~0.base 0) |old(#valid)|) (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (not (= (select |#valid| 0) 1))), 6366#(and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0) main_~tmp~0.base (select (store |#valid| main_~tmp~0.base 0) main_~tmp~0.base)) |old(#valid)|) (= main_~p~0.offset 0) (not (= 0 main_~tmp~0.base)) (not (= (select |#valid| 0) 1))), 6367#(and (not (= main_~tmp~0.base |main_#t~mem13.base|)) (not (= 0 main_~tmp~0.base)) (not (= (select |#valid| 0) 1)) (= (store (store |#valid| |main_#t~mem13.base| 0) main_~tmp~0.base (select (store |#valid| main_~tmp~0.base 0) main_~tmp~0.base)) |old(#valid)|))] [2018-02-02 10:26:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:32,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:26:32,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:26:32,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:26:32,710 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand 24 states. [2018-02-02 10:26:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:33,617 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2018-02-02 10:26:33,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:26:33,617 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-02-02 10:26:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:33,618 INFO L225 Difference]: With dead ends: 160 [2018-02-02 10:26:33,618 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 10:26:33,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=220, Invalid=1340, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:26:33,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 10:26:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2018-02-02 10:26:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 10:26:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2018-02-02 10:26:33,621 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 51 [2018-02-02 10:26:33,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:33,621 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2018-02-02 10:26:33,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:26:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2018-02-02 10:26:33,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:26:33,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:33,622 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:33,622 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:33,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1491496655, now seen corresponding path program 1 times [2018-02-02 10:26:33,623 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:33,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:33,829 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:26:33,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:33,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:26:33,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:33,830 INFO L182 omatonBuilderFactory]: Interpolants [6720#(= 0 |main_#t~malloc0.offset|), 6721#(= 0 main_~a~0.offset), 6722#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 6723#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 6724#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 6725#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 6726#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 6727#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 6728#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 6729#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 6730#(or (= 0 main_~flag~0) (and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base))), 6731#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base)), 6732#(= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))), 6733#(= 0 |main_#t~mem13.offset|), 6734#(= 0 main_~p~0.offset), 6735#(= 0 main_~tmp~0.offset), 6718#true, 6719#false] [2018-02-02 10:26:33,830 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:26:33,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:26:33,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:26:33,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:26:33,831 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 18 states. [2018-02-02 10:26:34,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:34,354 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-02-02 10:26:34,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:26:34,355 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-02-02 10:26:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:34,356 INFO L225 Difference]: With dead ends: 175 [2018-02-02 10:26:34,356 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 10:26:34,356 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=334, Invalid=1148, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:26:34,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 10:26:34,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2018-02-02 10:26:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:26:34,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-02-02 10:26:34,359 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 51 [2018-02-02 10:26:34,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:34,360 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-02-02 10:26:34,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:26:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-02-02 10:26:34,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:26:34,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:34,361 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] [2018-02-02 10:26:34,361 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:34,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1190789007, now seen corresponding path program 2 times [2018-02-02 10:26:34,361 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:34,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:26:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:34,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:34,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:26:34,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:34,637 INFO L182 omatonBuilderFactory]: Interpolants [7104#false, 7105#(= 0 |main_#t~malloc0.offset|), 7106#(= 0 main_~a~0.offset), 7107#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 7108#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 7109#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 7110#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 7111#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 7112#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 7113#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7114#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 7115#(and (= 0 main_~a~0.offset) (or (and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)) (= 0 main_~flag~0))), 7116#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 7117#(and (= 0 |main_#t~mem11.offset|) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem11.base|) (= 0 main_~a~0.offset)), 7118#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 7119#(and (= 0 main_~a~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 0) |main_#t~mem8|)), 7120#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 0)) (= 0 main_~a~0.offset)), 7121#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)) (= main_~p~0.offset 0)), 7122#(= 3 (select (select |#memory_int| |main_#t~mem13.base|) 0)), 7123#(= 3 (select (select |#memory_int| main_~p~0.base) 0)), 7124#(or (not (= 0 main_~p~0.offset)) (= 3 |main_#t~mem12|)), 7125#(not (= 0 main_~tmp~0.offset)), 7103#true] [2018-02-02 10:26:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:34,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:26:34,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:26:34,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:26:34,638 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 23 states. [2018-02-02 10:26:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:35,538 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2018-02-02 10:26:35,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:26:35,538 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-02-02 10:26:35,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:35,539 INFO L225 Difference]: With dead ends: 160 [2018-02-02 10:26:35,539 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 10:26:35,539 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=395, Invalid=2055, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:26:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 10:26:35,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2018-02-02 10:26:35,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 10:26:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2018-02-02 10:26:35,542 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 53 [2018-02-02 10:26:35,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:35,542 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2018-02-02 10:26:35,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:26:35,542 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2018-02-02 10:26:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:26:35,543 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:35,543 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:35,543 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:35,543 INFO L82 PathProgramCache]: Analyzing trace with hash 3548012, now seen corresponding path program 1 times [2018-02-02 10:26:35,544 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:35,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:36,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:36,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:26:36,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:36,155 INFO L182 omatonBuilderFactory]: Interpolants [7488#(and (or (= 0 main_~flag~0) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))) (= main_~p~0.offset 0)), 7489#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 7490#(and (= 0 |main_#t~mem11.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4))))), 7491#(or (<= (+ main_~p~0.offset 1) 0) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0))), 7492#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 7493#(= 1 (select |#valid| |main_#t~mem11.base|)), 7494#(= 1 (select |#valid| main_~p~0.base)), 7470#true, 7471#false, 7472#(= 0 |main_#t~malloc0.offset|), 7473#(= 0 main_~a~0.offset), 7474#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 7475#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 7476#(and (not (= |main_#t~malloc4.base| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 7477#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base main_~p~0.base))), 7478#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 7479#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 |main_#t~mem6.offset|)), 7480#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7481#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7482#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| |main_#t~malloc4.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7483#(and (not (= main_~t~0.base main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~t~0.base))), 7484#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 7485#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|))), 7486#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7487#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))))] [2018-02-02 10:26:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:36,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:26:36,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:26:36,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:26:36,156 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand 25 states. [2018-02-02 10:26:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:37,075 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2018-02-02 10:26:37,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:26:37,075 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-02-02 10:26:37,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:37,075 INFO L225 Difference]: With dead ends: 179 [2018-02-02 10:26:37,076 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 10:26:37,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=407, Invalid=2245, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:26:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 10:26:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 133. [2018-02-02 10:26:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 10:26:37,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2018-02-02 10:26:37,079 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 57 [2018-02-02 10:26:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:37,079 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-02-02 10:26:37,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:26:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2018-02-02 10:26:37,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:26:37,080 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:37,080 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:37,080 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:37,080 INFO L82 PathProgramCache]: Analyzing trace with hash 3548013, now seen corresponding path program 1 times [2018-02-02 10:26:37,081 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:37,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:37,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:37,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:26:37,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:37,641 INFO L182 omatonBuilderFactory]: Interpolants [7872#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7873#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 7874#(and (= 8 (select |#length| main_~t~0.base)) (not (= main_~t~0.base main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4)))), 7875#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 7876#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|))), 7877#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7878#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 7879#(and (= main_~p~0.offset 0) (or (= 0 main_~flag~0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))))), 7880#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 7881#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ 0 4)))), 7882#(or (<= (+ main_~p~0.offset 1) 0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 7883#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 7884#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| |main_#t~mem11.base|))), 7885#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 7861#true, 7862#false, 7863#(= 0 |main_#t~malloc0.offset|), 7864#(= 0 main_~a~0.offset), 7865#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 7866#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 7867#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 7868#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 7869#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 7870#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 |main_#t~mem6.offset|) (not (= main_~a~0.base |main_#t~mem6.base|))), 7871#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))] [2018-02-02 10:26:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:37,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:26:37,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:26:37,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:26:37,652 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 25 states. [2018-02-02 10:26:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:38,793 INFO L93 Difference]: Finished difference Result 200 states and 216 transitions. [2018-02-02 10:26:38,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:26:38,793 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-02-02 10:26:38,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:38,793 INFO L225 Difference]: With dead ends: 200 [2018-02-02 10:26:38,794 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 10:26:38,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=344, Invalid=2106, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:26:38,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 10:26:38,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 134. [2018-02-02 10:26:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 10:26:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-02-02 10:26:38,796 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 57 [2018-02-02 10:26:38,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:38,796 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-02-02 10:26:38,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:26:38,796 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-02-02 10:26:38,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:26:38,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:38,796 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:38,796 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:38,797 INFO L82 PathProgramCache]: Analyzing trace with hash 360796057, now seen corresponding path program 1 times [2018-02-02 10:26:38,797 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:38,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:39,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:39,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:26:39,184 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:39,185 INFO L182 omatonBuilderFactory]: Interpolants [8288#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 8289#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (not (= 0 main_~p~0.base))), 8290#(and (= main_~p~0.offset 0) (not (= 0 main_~tmp~0.base)) (= 1 (select (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 8291#(and (not (= 0 main_~tmp~0.base)) (= 1 (select (store |#valid| main_~tmp~0.base 0) |main_#t~mem13.base|))), 8292#(and (not (= 0 main_~tmp~0.base)) (= 1 (select (store |#valid| main_~tmp~0.base 0) main_~p~0.base))), 8293#(= 1 (select |#valid| main_~p~0.base)), 8270#true, 8271#false, 8272#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 8273#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 8274#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 8275#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 8276#(and (not (= |main_#t~malloc4.base| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 8277#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base main_~p~0.base))), 8278#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 8279#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (not (= 0 main_~a~0.base))), 8280#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (not (= 0 main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 8281#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (not (= |main_#t~malloc4.base| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 8282#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= 0 main_~a~0.base))), 8283#(and (not (= main_~a~0.base main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 8284#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 8285#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 8286#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 8287#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base))))] [2018-02-02 10:26:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:39,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:26:39,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:26:39,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:26:39,185 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 24 states. [2018-02-02 10:26:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:40,359 INFO L93 Difference]: Finished difference Result 190 states and 205 transitions. [2018-02-02 10:26:40,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:26:40,360 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-02-02 10:26:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:40,361 INFO L225 Difference]: With dead ends: 190 [2018-02-02 10:26:40,361 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 10:26:40,362 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=482, Invalid=2380, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:26:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 10:26:40,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2018-02-02 10:26:40,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:26:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2018-02-02 10:26:40,365 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 59 [2018-02-02 10:26:40,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:40,365 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2018-02-02 10:26:40,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:26:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2018-02-02 10:26:40,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:26:40,366 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:40,366 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:40,366 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:40,366 INFO L82 PathProgramCache]: Analyzing trace with hash 360796058, now seen corresponding path program 1 times [2018-02-02 10:26:40,367 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:40,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:40,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:40,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:26:40,747 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:40,747 INFO L182 omatonBuilderFactory]: Interpolants [8707#true, 8708#false, 8709#(= 0 |main_#t~malloc0.offset|), 8710#(= 0 main_~a~0.offset), 8711#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 8712#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 8713#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 8714#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 8715#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 8716#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| |main_#t~mem6.base|)) (not (= main_~a~0.base |main_#t~mem6.base|))), 8717#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 8718#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 8719#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= |main_#t~malloc4.base| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 8720#(and (not (= main_~t~0.base main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 8721#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 8722#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 8723#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 8724#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 8725#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))))), 8726#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 8727#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 8728#(and (= 8 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|)), 8729#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:26:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:40,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:26:40,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:26:40,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:26:40,748 INFO L87 Difference]: Start difference. First operand 163 states and 184 transitions. Second operand 23 states. [2018-02-02 10:26:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:41,601 INFO L93 Difference]: Finished difference Result 208 states and 222 transitions. [2018-02-02 10:26:41,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:26:41,601 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2018-02-02 10:26:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:41,602 INFO L225 Difference]: With dead ends: 208 [2018-02-02 10:26:41,602 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 10:26:41,603 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=389, Invalid=1681, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:26:41,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 10:26:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 166. [2018-02-02 10:26:41,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:26:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 187 transitions. [2018-02-02 10:26:41,605 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 187 transitions. Word has length 59 [2018-02-02 10:26:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:41,605 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 187 transitions. [2018-02-02 10:26:41,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:26:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 187 transitions. [2018-02-02 10:26:41,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:26:41,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:41,606 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:41,606 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:41,606 INFO L82 PathProgramCache]: Analyzing trace with hash -413881243, now seen corresponding path program 2 times [2018-02-02 10:26:41,606 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:41,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:42,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:42,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:26:42,182 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:42,182 INFO L182 omatonBuilderFactory]: Interpolants [9152#(= 0 |main_#t~malloc0.offset|), 9153#(= 0 main_~a~0.offset), 9154#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 9155#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 9156#(and (not (= |main_#t~malloc4.base| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 9157#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base main_~p~0.base))), 9158#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 9159#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 9160#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 9161#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (= main_~flag~0 (select |#valid| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))))), 9162#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (not (= |main_#t~malloc4.base| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))))), 9163#(and (or (= 0 main_~flag~0) (and (not (= main_~t~0.base main_~a~0.base)) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))))) (= 0 main_~a~0.offset)), 9164#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))))), 9165#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (not (= |main_#t~mem6.base| main_~a~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))))), 9166#(and (= 0 main_~a~0.offset) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))) (= 0 main_~flag~0))), 9167#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 9168#(and (or (not (= main_~a~0.base |main_#t~malloc4.base|)) (= |main_#t~malloc4.offset| main_~a~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 9169#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (or (= main_~t~0.offset main_~a~0.offset) (not (= main_~a~0.base main_~t~0.base)))), 9170#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.offset))), 9171#(and (= 0 main_~a~0.offset) (or (= |main_#t~mem6.offset| main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem6.base|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 9172#(and (= 0 main_~a~0.offset) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))) (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)))), 9173#(and (= 0 main_~a~0.offset) (or (= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))))), 9174#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (= main_~p~0.offset 0)), 9175#(and (= main_~p~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= |main_#t~mem8| 3))), 9176#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 9177#(= 1 (select |#valid| |main_#t~mem11.base|)), 9178#(= 1 (select |#valid| main_~p~0.base)), 9150#true, 9151#false] [2018-02-02 10:26:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:42,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:26:42,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:26:42,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:26:42,183 INFO L87 Difference]: Start difference. First operand 166 states and 187 transitions. Second operand 29 states. [2018-02-02 10:26:44,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:44,364 INFO L93 Difference]: Finished difference Result 269 states and 292 transitions. [2018-02-02 10:26:44,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-02 10:26:44,365 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2018-02-02 10:26:44,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:44,365 INFO L225 Difference]: With dead ends: 269 [2018-02-02 10:26:44,365 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 10:26:44,366 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1151, Invalid=4855, Unknown=0, NotChecked=0, Total=6006 [2018-02-02 10:26:44,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 10:26:44,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 190. [2018-02-02 10:26:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-02 10:26:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 213 transitions. [2018-02-02 10:26:44,368 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 213 transitions. Word has length 61 [2018-02-02 10:26:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:44,369 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 213 transitions. [2018-02-02 10:26:44,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:26:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 213 transitions. [2018-02-02 10:26:44,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:26:44,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:44,369 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:44,369 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:44,369 INFO L82 PathProgramCache]: Analyzing trace with hash -413881242, now seen corresponding path program 2 times [2018-02-02 10:26:44,370 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:44,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:45,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:45,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:26:45,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:45,106 INFO L182 omatonBuilderFactory]: Interpolants [9736#true, 9737#false, 9738#(= 0 |main_#t~malloc0.offset|), 9739#(= 0 main_~a~0.offset), 9740#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 9741#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 9742#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 9743#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 9744#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 9745#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| |main_#t~mem6.base|)) (not (= main_~a~0.base |main_#t~mem6.base|))), 9746#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 9747#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 9748#(or (and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~flag~0 (select |#valid| main_~a~0.base)) (= main_~flag~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))) (= 0 main_~flag~0)), 9749#(or (= 0 main_~flag~0) (and (= 0 main_~a~0.offset) (= main_~flag~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= |main_#t~malloc4.base| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base)))), 9750#(or (= 0 main_~flag~0) (and (not (= main_~t~0.base main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~flag~0 1) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base)))), 9751#(or (= 0 main_~flag~0) (and (= main_~flag~0 (select |#valid| main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base)))), 9752#(or (and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~flag~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))) (= 0 main_~flag~0)), 9753#(or (= 0 main_~flag~0) (and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= main_~flag~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))))), 9754#(and (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 9755#(and (or (not (= main_~a~0.base |main_#t~malloc4.base|)) (= |main_#t~malloc4.offset| main_~a~0.offset)) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 9756#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (or (= main_~t~0.offset main_~a~0.offset) (not (= main_~a~0.base main_~t~0.base))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))))), 9757#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.offset))), 9758#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (or (= |main_#t~mem6.offset| main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem6.base|))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 9759#(or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))), 9760#(or (= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))))), 9761#(or (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 9762#(or (= |main_#t~mem8| 3) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 9763#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 9764#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| |main_#t~mem11.base|))), 9765#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:26:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:45,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:26:45,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:26:45,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:26:45,107 INFO L87 Difference]: Start difference. First operand 190 states and 213 transitions. Second operand 30 states. [2018-02-02 10:26:46,693 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 87 DAG size of output 74 [2018-02-02 10:26:48,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:48,382 INFO L93 Difference]: Finished difference Result 287 states and 310 transitions. [2018-02-02 10:26:48,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 10:26:48,382 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 61 [2018-02-02 10:26:48,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:48,383 INFO L225 Difference]: With dead ends: 287 [2018-02-02 10:26:48,383 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 10:26:48,384 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1054, Invalid=4646, Unknown=0, NotChecked=0, Total=5700 [2018-02-02 10:26:48,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 10:26:48,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 195. [2018-02-02 10:26:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 10:26:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 218 transitions. [2018-02-02 10:26:48,386 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 218 transitions. Word has length 61 [2018-02-02 10:26:48,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:48,387 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 218 transitions. [2018-02-02 10:26:48,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:26:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 218 transitions. [2018-02-02 10:26:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:26:48,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:48,387 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:48,387 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:48,387 INFO L82 PathProgramCache]: Analyzing trace with hash -824929688, now seen corresponding path program 1 times [2018-02-02 10:26:48,388 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:48,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:48,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:48,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:26:48,806 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:48,806 INFO L182 omatonBuilderFactory]: Interpolants [10340#true, 10341#false, 10342#(= 0 |main_#t~malloc0.offset|), 10343#(= 0 main_~a~0.offset), 10344#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 10345#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 10346#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base)), 10347#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 10348#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 10349#(and (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem6.offset|) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (not (= main_~a~0.base |main_#t~mem6.base|))), 10350#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 10351#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 10352#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 10353#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~t~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2) (not (= main_~a~0.base main_~t~0.base))), 10354#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 10355#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (not (= main_~a~0.base |main_#t~mem6.base|))), 10356#(and (= 0 main_~a~0.offset) (= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= main_~p~0.base main_~a~0.base))), 10357#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (= 0 main_~a~0.offset)), 10358#(and (= main_~p~0.offset 0) (or (= 0 main_~flag~0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 2))), 10359#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 2) (= main_~p~0.offset 0)), 10360#(= (select (select |#memory_int| |main_#t~mem11.base|) |main_#t~mem11.offset|) 2), 10361#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2), 10362#(= |main_#t~mem8| 2), 10363#(not (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))), 10364#(not (= 3 |main_#t~mem12|))] [2018-02-02 10:26:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:48,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:26:48,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:26:48,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:26:48,807 INFO L87 Difference]: Start difference. First operand 195 states and 218 transitions. Second operand 25 states. [2018-02-02 10:26:49,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:49,640 INFO L93 Difference]: Finished difference Result 216 states and 233 transitions. [2018-02-02 10:26:49,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:26:49,641 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 63 [2018-02-02 10:26:49,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:49,641 INFO L225 Difference]: With dead ends: 216 [2018-02-02 10:26:49,641 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 10:26:49,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=409, Invalid=2141, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 10:26:49,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 10:26:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 195. [2018-02-02 10:26:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 10:26:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 217 transitions. [2018-02-02 10:26:49,644 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 217 transitions. Word has length 63 [2018-02-02 10:26:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:49,644 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 217 transitions. [2018-02-02 10:26:49,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:26:49,644 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 217 transitions. [2018-02-02 10:26:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:26:49,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:49,644 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2018-02-02 10:26:49,644 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:49,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1554597819, now seen corresponding path program 2 times [2018-02-02 10:26:49,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:49,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:50,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:50,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:26:50,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:50,255 INFO L182 omatonBuilderFactory]: Interpolants [10828#true, 10829#false, 10830#(= 0 |main_#t~malloc0.offset|), 10831#(= 0 main_~a~0.offset), 10832#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 10833#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 10834#(and (not (= |main_#t~malloc4.base| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 10835#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base main_~p~0.base))), 10836#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 10837#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 |main_#t~mem6.offset|)), 10838#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 10839#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 10840#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 10841#(and (not (= main_~t~0.base main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4)))), 10842#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 10843#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem6.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem6.offset|)), 10844#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 10845#(and (= 0 main_~a~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 10846#(and (or (= 0 main_~flag~0) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))))) (= main_~p~0.offset 0)), 10847#(and (or (= 0 main_~flag~0) (and (= |main_#t~mem8| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))))) (= main_~p~0.offset 0)), 10848#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))))) (= 0 main_~flag~0)) (= main_~p~0.offset 0)), 10849#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))))), 10850#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (not (= |main_#t~mem9| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))))), 10851#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (not (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))))), 10852#(and (not (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4))) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ 0 4))))) (= 0 |main_#t~mem11.offset|)), 10853#(or (<= (+ main_~p~0.offset 1) 0) (and (= main_~p~0.offset 0) (not (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))))), 10854#(and (= main_~p~0.offset 0) (not (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))), 10855#(not (= 1 (select (select |#memory_int| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 10856#(not (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))), 10857#(not (= 1 |main_#t~mem9|))] [2018-02-02 10:26:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:50,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:26:50,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:26:50,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=790, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:26:50,256 INFO L87 Difference]: Start difference. First operand 195 states and 217 transitions. Second operand 30 states. [2018-02-02 10:26:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:51,668 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2018-02-02 10:26:51,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:26:51,668 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-02-02 10:26:51,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:51,669 INFO L225 Difference]: With dead ends: 194 [2018-02-02 10:26:51,669 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 10:26:51,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=462, Invalid=3198, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 10:26:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 10:26:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 175. [2018-02-02 10:26:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 10:26:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 186 transitions. [2018-02-02 10:26:51,673 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 186 transitions. Word has length 65 [2018-02-02 10:26:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:51,673 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 186 transitions. [2018-02-02 10:26:51,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:26:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 186 transitions. [2018-02-02 10:26:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:26:51,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:51,674 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:51,674 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash -102008450, now seen corresponding path program 3 times [2018-02-02 10:26:51,675 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:51,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:52,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:52,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:26:52,584 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:52,585 INFO L182 omatonBuilderFactory]: Interpolants [11289#true, 11290#false, 11291#(= 0 |main_#t~malloc0.offset|), 11292#(= 0 main_~a~0.offset), 11293#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 11294#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 11295#(and (not (= |main_#t~malloc4.base| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 11296#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base main_~p~0.base))), 11297#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 11298#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 |main_#t~mem6.offset|)), 11299#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11300#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11301#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= main_~flag~0 (select |#valid| main_~a~0.base)) (= main_~flag~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))))), 11302#(and (or (= 0 main_~flag~0) (and (not (= |main_#t~malloc4.base| main_~p~0.base)) (= main_~flag~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= |main_#t~malloc4.base| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))) (= 0 main_~a~0.offset)), 11303#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (not (= main_~t~0.base main_~a~0.base)) (= main_~flag~0 1) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~t~0.base main_~p~0.base))))), 11304#(and (or (= 0 main_~flag~0) (and (= main_~flag~0 (select |#valid| main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))) (= 0 main_~a~0.offset)), 11305#(and (= 0 main_~a~0.offset) (or (and (not (= |main_#t~mem6.base| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~flag~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))) (= 0 main_~flag~0))), 11306#(and (or (= 0 main_~flag~0) (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= main_~flag~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))))) (= 0 main_~a~0.offset)), 11307#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11308#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (or (not (= main_~a~0.base |main_#t~malloc4.base|)) (= |main_#t~malloc4.offset| main_~a~0.offset)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= |main_#t~malloc4.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 11309#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~t~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (or (= main_~t~0.offset main_~a~0.offset) (not (= main_~a~0.base main_~t~0.base)))), 11310#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.offset))), 11311#(and (= 0 main_~a~0.offset) (or (= |main_#t~mem6.offset| main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem6.base|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 11312#(and (= 0 main_~a~0.offset) (or (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))) (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)))), 11313#(and (= 0 main_~a~0.offset) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))), 11314#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (= main_~p~0.offset 0)), 11315#(and (= main_~p~0.offset 0) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (= |main_#t~mem8| 3))), 11316#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 11317#(and (= 0 |main_#t~mem11.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4))))), 11318#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= (+ main_~p~0.offset 1) 0)), 11319#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 11320#(= 1 (select |#valid| |main_#t~mem11.base|)), 11321#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:26:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:52,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 10:26:52,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 10:26:52,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=953, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:26:52,586 INFO L87 Difference]: Start difference. First operand 175 states and 186 transitions. Second operand 33 states. [2018-02-02 10:26:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:55,499 INFO L93 Difference]: Finished difference Result 255 states and 265 transitions. [2018-02-02 10:26:55,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 10:26:55,499 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 69 [2018-02-02 10:26:55,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:55,500 INFO L225 Difference]: With dead ends: 255 [2018-02-02 10:26:55,500 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 10:26:55,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1597 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1048, Invalid=5432, Unknown=0, NotChecked=0, Total=6480 [2018-02-02 10:26:55,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 10:26:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 178. [2018-02-02 10:26:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 10:26:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 190 transitions. [2018-02-02 10:26:55,504 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 190 transitions. Word has length 69 [2018-02-02 10:26:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:55,504 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 190 transitions. [2018-02-02 10:26:55,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 10:26:55,505 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 190 transitions. [2018-02-02 10:26:55,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:26:55,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:55,505 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:55,505 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:55,506 INFO L82 PathProgramCache]: Analyzing trace with hash -102008449, now seen corresponding path program 2 times [2018-02-02 10:26:55,506 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:55,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:26:56,520 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:56,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:26:56,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 10:26:56,520 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:26:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:56,521 INFO L182 omatonBuilderFactory]: Interpolants [11851#true, 11852#false, 11853#(= 0 |main_#t~malloc0.offset|), 11854#(= 0 main_~a~0.offset), 11855#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 11856#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 11857#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 11858#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 11859#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 11860#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 |main_#t~mem6.offset|) (not (= main_~a~0.base |main_#t~mem6.base|))), 11861#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11862#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11863#(and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~flag~0 1) (= main_~flag~0 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11864#(and (= 0 main_~a~0.offset) (= main_~flag~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 0 |main_#t~malloc4.offset|)), 11865#(and (not (= main_~t~0.base main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~flag~0 1) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4)))), 11866#(and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= main_~p~0.offset 0) (or (= 0 main_~flag~0) (and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))))), 11867#(or (= 0 main_~flag~0) (and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem6.base|) (= main_~flag~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))))), 11868#(or (= 0 main_~flag~0) (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~flag~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base)))), 11869#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11870#(and (<= 0 main_~p~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11871#(and (<= 0 main_~p~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~malloc4.base|)) (or (not (= main_~a~0.base |main_#t~malloc4.base|)) (= |main_#t~malloc4.offset| main_~a~0.offset)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11872#(and (<= 0 main_~p~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (or (= main_~t~0.offset main_~a~0.offset) (not (= main_~a~0.base main_~t~0.base))) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base))), 11873#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.offset)) (<= 8 (select |#length| main_~p~0.base))), 11874#(and (= 0 main_~a~0.offset) (or (= |main_#t~mem6.offset| main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem6.base|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|))), 11875#(or (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))) (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))), 11876#(or (= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))))), 11877#(or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))), 11878#(or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= |main_#t~mem8| 3)), 11879#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 11880#(and (= 0 |main_#t~mem11.offset|) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ 0 4)))), 11881#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (<= (+ main_~p~0.offset 1) 0)), 11882#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 11883#(and (<= 8 (select |#length| |main_#t~mem11.base|)) (= 0 |main_#t~mem11.offset|)), 11884#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base)))] [2018-02-02 10:26:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:26:56,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:26:56,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:26:56,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:26:56,522 INFO L87 Difference]: Start difference. First operand 178 states and 190 transitions. Second operand 34 states. [2018-02-02 10:26:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:26:59,948 INFO L93 Difference]: Finished difference Result 266 states and 278 transitions. [2018-02-02 10:26:59,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-02 10:26:59,948 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 69 [2018-02-02 10:26:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:26:59,949 INFO L225 Difference]: With dead ends: 266 [2018-02-02 10:26:59,949 INFO L226 Difference]: Without dead ends: 266 [2018-02-02 10:26:59,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=968, Invalid=6864, Unknown=0, NotChecked=0, Total=7832 [2018-02-02 10:26:59,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-02 10:26:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 179. [2018-02-02 10:26:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 10:26:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 191 transitions. [2018-02-02 10:26:59,952 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 191 transitions. Word has length 69 [2018-02-02 10:26:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:26:59,952 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 191 transitions. [2018-02-02 10:26:59,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 10:26:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 191 transitions. [2018-02-02 10:26:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:26:59,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:26:59,953 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:26:59,953 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:26:59,953 INFO L82 PathProgramCache]: Analyzing trace with hash -345591359, now seen corresponding path program 1 times [2018-02-02 10:26:59,954 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:26:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:26:59,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:00,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:00,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:27:00,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:00,345 INFO L182 omatonBuilderFactory]: Interpolants [12440#true, 12441#false, 12442#(= 0 |main_#t~malloc0.offset|), 12443#(= 0 main_~a~0.offset), 12444#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 12445#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 12446#(and (not (= |main_#t~malloc4.base| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 12447#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base main_~p~0.base))), 12448#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 12449#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 12450#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 12451#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= |main_#t~malloc4.base| main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 12452#(and (not (= main_~t~0.base main_~a~0.base)) (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4)))), 12453#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 12454#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 12455#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 12456#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 12457#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (or (= 0 main_~flag~0) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)))), 12458#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 12459#(and (= 0 |main_#t~mem11.offset|) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem11.base|) (= 0 main_~a~0.offset)), 12460#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 12461#(and (= 0 main_~a~0.offset) (= |main_#t~mem8| (select (select |#memory_int| main_~p~0.base) 0)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 12462#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_int| main_~p~0.base) 0) 3)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 12463#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 0) 3)) (= 0 main_~a~0.offset)), 12464#(and (= main_~p~0.offset 0) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 3))), 12465#(not (= (select (select |#memory_int| |main_#t~mem13.base|) 0) 3)), 12466#(or (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (not (= 0 main_~p~0.offset))), 12467#(or (not (= 0 main_~p~0.offset)) (not (= |main_#t~mem12| 3))), 12468#(not (= 0 main_~p~0.offset))] [2018-02-02 10:27:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:00,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:27:00,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:27:00,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:27:00,345 INFO L87 Difference]: Start difference. First operand 179 states and 191 transitions. Second operand 29 states. [2018-02-02 10:27:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:01,291 INFO L93 Difference]: Finished difference Result 227 states and 240 transitions. [2018-02-02 10:27:01,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:27:01,291 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 71 [2018-02-02 10:27:01,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:01,292 INFO L225 Difference]: With dead ends: 227 [2018-02-02 10:27:01,292 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 10:27:01,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=453, Invalid=2627, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 10:27:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 10:27:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 197. [2018-02-02 10:27:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 10:27:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 214 transitions. [2018-02-02 10:27:01,294 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 214 transitions. Word has length 71 [2018-02-02 10:27:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:01,294 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 214 transitions. [2018-02-02 10:27:01,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:27:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 214 transitions. [2018-02-02 10:27:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:27:01,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:01,295 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:01,295 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:27:01,295 INFO L82 PathProgramCache]: Analyzing trace with hash -345541708, now seen corresponding path program 1 times [2018-02-02 10:27:01,295 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:01,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:27:01,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:01,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:27:01,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:01,572 INFO L182 omatonBuilderFactory]: Interpolants [12960#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 12961#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 12962#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 12963#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 12964#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base)))), 12965#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base)), 12966#(= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))), 12967#(= 0 |main_#t~mem13.offset|), 12968#(= 0 main_~p~0.offset), 12969#(= 0 main_~tmp~0.offset), 12947#true, 12948#false, 12949#(= 0 |main_#t~malloc0.offset|), 12950#(= 0 main_~a~0.offset), 12951#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 12952#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 12953#(and (not (= |main_#t~malloc4.base| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 12954#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base main_~p~0.base))), 12955#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 12956#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 12957#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 12958#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= |main_#t~malloc4.base| main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 12959#(and (not (= main_~t~0.base main_~a~0.base)) (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))))] [2018-02-02 10:27:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:27:01,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:27:01,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:27:01,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:27:01,573 INFO L87 Difference]: Start difference. First operand 197 states and 214 transitions. Second operand 23 states. [2018-02-02 10:27:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:02,335 INFO L93 Difference]: Finished difference Result 210 states and 226 transitions. [2018-02-02 10:27:02,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:27:02,336 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-02-02 10:27:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:02,337 INFO L225 Difference]: With dead ends: 210 [2018-02-02 10:27:02,337 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 10:27:02,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=402, Invalid=1578, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:27:02,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 10:27:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 203. [2018-02-02 10:27:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-02 10:27:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 223 transitions. [2018-02-02 10:27:02,340 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 223 transitions. Word has length 71 [2018-02-02 10:27:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:02,340 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 223 transitions. [2018-02-02 10:27:02,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:27:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 223 transitions. [2018-02-02 10:27:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:27:02,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:02,341 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:02,341 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:27:02,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2000251179, now seen corresponding path program 2 times [2018-02-02 10:27:02,342 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:02,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:03,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:03,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:27:03,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:03,277 INFO L182 omatonBuilderFactory]: Interpolants [13440#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (not (= main_~t~0.base main_~a~0.base)) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))))))), 13441#(and (or (= 0 main_~flag~0) (and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)))) (= 0 main_~a~0.offset)), 13442#(and (or (= 0 main_~flag~0) (and (not (= |main_#t~mem6.base| main_~a~0.base)) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)))) (= 0 main_~a~0.offset)), 13443#(and (or (= 0 main_~flag~0) (and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base)))) (= 0 main_~a~0.offset)), 13444#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 13445#(and (or (not (= main_~a~0.base |main_#t~malloc4.base|)) (= |main_#t~malloc4.offset| main_~a~0.offset)) (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 13446#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (or (= main_~t~0.offset main_~a~0.offset) (not (= main_~a~0.base main_~t~0.base)))), 13447#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.offset))), 13448#(and (= 0 main_~a~0.offset) (or (= |main_#t~mem6.offset| main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem6.base|))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 13449#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))))), 13450#(and (= 0 main_~a~0.offset) (or (= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))) (not (= 0 main_~a~0.base))), 13451#(and (or (and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base main_~a~0.base)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base))), 13452#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (or (= |main_#t~mem8| 3) (and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base main_~a~0.base)))), 13453#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 13454#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem11.base|) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem11.base|)) (not (= 0 main_~a~0.base))), 13455#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 13456#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 13457#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (not (= 0 main_~p~0.base))), 13458#(and (= main_~p~0.offset 0) (not (= 0 main_~tmp~0.base)) (= 1 (select (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 13459#(and (not (= 0 main_~tmp~0.base)) (= 1 (select (store |#valid| main_~tmp~0.base 0) |main_#t~mem13.base|))), 13460#(and (not (= 0 main_~tmp~0.base)) (= 1 (select (store |#valid| main_~tmp~0.base 0) main_~p~0.base))), 13461#(= 1 (select |#valid| main_~p~0.base)), 13427#true, 13428#false, 13429#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 13430#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 13431#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 13432#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 13433#(and (not (= |main_#t~malloc4.base| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 13434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base main_~p~0.base))), 13435#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 13436#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 1 (select |#valid| main_~a~0.base)) (not (= 0 main_~a~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 13437#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 13438#(and (or (= 0 main_~flag~0) (and (= main_~flag~0 (select |#valid| main_~a~0.base)) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base)))) (= 0 main_~a~0.offset)), 13439#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= |main_#t~malloc4.base| main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base)))))] [2018-02-02 10:27:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:03,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 10:27:03,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 10:27:03,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:27:03,278 INFO L87 Difference]: Start difference. First operand 203 states and 223 transitions. Second operand 35 states. [2018-02-02 10:27:03,793 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 77 DAG size of output 60 [2018-02-02 10:27:04,230 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 79 DAG size of output 63 [2018-02-02 10:27:04,354 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 89 DAG size of output 72 [2018-02-02 10:27:06,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:06,989 INFO L93 Difference]: Finished difference Result 341 states and 365 transitions. [2018-02-02 10:27:06,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-02 10:27:06,989 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 71 [2018-02-02 10:27:06,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:06,990 INFO L225 Difference]: With dead ends: 341 [2018-02-02 10:27:06,990 INFO L226 Difference]: Without dead ends: 341 [2018-02-02 10:27:06,990 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2618 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1620, Invalid=7310, Unknown=0, NotChecked=0, Total=8930 [2018-02-02 10:27:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-02 10:27:06,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 237. [2018-02-02 10:27:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 10:27:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 269 transitions. [2018-02-02 10:27:06,994 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 269 transitions. Word has length 71 [2018-02-02 10:27:06,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:06,994 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 269 transitions. [2018-02-02 10:27:06,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 10:27:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 269 transitions. [2018-02-02 10:27:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:27:06,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:06,995 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:06,995 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:27:06,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2000251180, now seen corresponding path program 2 times [2018-02-02 10:27:06,996 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:07,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:07,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:07,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:27:07,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:07,809 INFO L182 omatonBuilderFactory]: Interpolants [14160#true, 14161#false, 14162#(= 0 |main_#t~malloc0.offset|), 14163#(= 0 main_~a~0.offset), 14164#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 14165#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 14166#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 14167#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 14168#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 14169#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| |main_#t~mem6.base|)) (not (= main_~a~0.base |main_#t~mem6.base|))), 14170#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 14171#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 14172#(and (or (= 0 main_~flag~0) (and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= main_~flag~0 (select |#valid| main_~a~0.base)) (= main_~flag~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base)))) (= 0 main_~a~0.offset)), 14173#(and (or (and (= main_~flag~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= |main_#t~malloc4.base| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))) (= 0 main_~flag~0)) (= 0 main_~a~0.offset)), 14174#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (not (= main_~t~0.base main_~a~0.base)) (= main_~flag~0 1) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))))), 14175#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (= main_~flag~0 (select |#valid| main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))))), 14176#(and (or (= 0 main_~flag~0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~flag~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))))) (= 0 main_~a~0.offset)), 14177#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~flag~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))))), 14178#(and (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 14179#(and (or (not (= main_~a~0.base |main_#t~malloc4.base|)) (= |main_#t~malloc4.offset| main_~a~0.offset)) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 14180#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (or (= main_~t~0.offset main_~a~0.offset) (not (= main_~a~0.base main_~t~0.base))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))))), 14181#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.offset))), 14182#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (or (= |main_#t~mem6.offset| main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem6.base|))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 14183#(and (= 0 main_~a~0.offset) (or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))))), 14184#(and (= 0 main_~a~0.offset) (or (= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))))), 14185#(and (= 0 main_~a~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))), 14186#(and (= 0 main_~a~0.offset) (or (= |main_#t~mem8| 3) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))))), 14187#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base main_~a~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 14188#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 14189#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 14190#(and (= 8 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|)), 14191#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:27:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:07,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:27:07,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:27:07,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:27:07,809 INFO L87 Difference]: Start difference. First operand 237 states and 269 transitions. Second operand 32 states. [2018-02-02 10:27:10,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:10,686 INFO L93 Difference]: Finished difference Result 300 states and 317 transitions. [2018-02-02 10:27:10,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 10:27:10,686 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-02-02 10:27:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:10,687 INFO L225 Difference]: With dead ends: 300 [2018-02-02 10:27:10,687 INFO L226 Difference]: Without dead ends: 300 [2018-02-02 10:27:10,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1088, Invalid=4764, Unknown=0, NotChecked=0, Total=5852 [2018-02-02 10:27:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-02 10:27:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 229. [2018-02-02 10:27:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-02 10:27:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 260 transitions. [2018-02-02 10:27:10,691 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 260 transitions. Word has length 71 [2018-02-02 10:27:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:10,691 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 260 transitions. [2018-02-02 10:27:10,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:27:10,691 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 260 transitions. [2018-02-02 10:27:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:27:10,692 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:10,692 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:10,692 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:27:10,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1353097194, now seen corresponding path program 1 times [2018-02-02 10:27:10,693 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:10,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:11,614 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:27:11,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:11,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 10:27:11,614 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:11,614 INFO L182 omatonBuilderFactory]: Interpolants [14811#true, 14812#false, 14813#(= 0 (select |#valid| 0)), 14814#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|) (= 0 (select |#valid| 0))), 14815#(and (= 0 main_~a~0.offset) (= 0 (select |#valid| 0)) (not (= 0 main_~a~0.base))), 14816#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select |#valid| 0)) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 14817#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 14818#(and (not (= |main_#t~malloc4.base| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select |#valid| 0)) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 14819#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= 0 (select |#valid| 0)) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base main_~p~0.base))), 14820#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select |#valid| 0)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 14821#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (= 0 (select |#valid| 0)) (= 0 |main_#t~mem6.offset|)), 14822#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select |#valid| 0)) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 14823#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= 0 (select |#valid| 0)) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 14824#(and (= 0 main_~a~0.offset) (= 0 (select |#valid| 0)) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (not (= 0 main_~a~0.base)) (not (= |main_#t~malloc4.base| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 14825#(and (not (= main_~t~0.base main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select |#valid| 0)) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base))), 14826#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select |#valid| 0)) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 14827#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 0 (select |#valid| 0)) (not (= 0 main_~a~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem6.base|)), 14828#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select |#valid| 0)) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 14829#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select |#valid| 0)) (not (= 0 main_~a~0.base))), 14830#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~flag~0 1) (= 0 (select |#valid| 0)) (= main_~p~0.base main_~a~0.base) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))))) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base))), 14831#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= (select |#valid| 0) 1)) (= main_~p~0.base main_~a~0.base) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))))), 14832#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)))) (not (= (select |#valid| 0) 1)) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4))))), 14833#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= (select |#valid| 0) 1))), 14834#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= (select |#valid| 0) 1))), 14835#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (not (= (select |#valid| 0) 1)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))))), 14836#(and (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (not (= 0 main_~tmp~0.base)) (not (= (select |#valid| 0) 1)) (= 1 (select (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))))), 14837#(and (= 1 (select (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) (+ 0 4)))) (not (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) (+ 0 4)))) (not (= 0 main_~tmp~0.base)) (not (= (select |#valid| 0) 1))), 14838#(and (not (= 0 main_~tmp~0.base)) (or (and (or (not (= 0 main_~p~0.base)) (not (= (select |#valid| 0) 1))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset))), 14839#(or (<= (+ main_~p~0.offset 1) 0) (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (or (not (= 0 main_~p~0.base)) (not (= (select |#valid| main_~p~0.base) 1)))) (<= 1 main_~p~0.offset)), 14840#(or (not (= main_~p~0.offset 0)) (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= 0 main_~p~0.base)))), 14841#(or (and (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base main_~tmp~0.base)) (and (= main_~tmp~0.offset main_~p~0.offset) (not (= main_~p~0.offset 0)))), 14842#(or (not (= main_~tmp~0.offset 0)) (and (not (= 0 main_~tmp~0.base)) (= 1 (select (store |#valid| main_~tmp~0.base 0) |main_#t~mem13.base|)))), 14843#(or (not (= main_~tmp~0.offset 0)) (and (not (= 0 main_~tmp~0.base)) (= 1 (select (store |#valid| main_~tmp~0.base 0) main_~p~0.base)))), 14844#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:27:11,615 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:27:11,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:27:11,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:27:11,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:27:11,615 INFO L87 Difference]: Start difference. First operand 229 states and 260 transitions. Second operand 34 states. [2018-02-02 10:27:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:13,596 INFO L93 Difference]: Finished difference Result 250 states and 282 transitions. [2018-02-02 10:27:13,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:27:13,596 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 73 [2018-02-02 10:27:13,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:13,597 INFO L225 Difference]: With dead ends: 250 [2018-02-02 10:27:13,597 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 10:27:13,597 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=648, Invalid=4754, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 10:27:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 10:27:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2018-02-02 10:27:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 10:27:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 276 transitions. [2018-02-02 10:27:13,600 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 276 transitions. Word has length 73 [2018-02-02 10:27:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:13,600 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 276 transitions. [2018-02-02 10:27:13,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 10:27:13,601 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 276 transitions. [2018-02-02 10:27:13,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:27:13,601 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:13,601 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:13,601 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:27:13,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1353097193, now seen corresponding path program 1 times [2018-02-02 10:27:13,602 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:13,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:14,209 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:27:14,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:14,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:27:14,210 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:14,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:14,210 INFO L182 omatonBuilderFactory]: Interpolants [15424#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 15425#(and (not (= |main_#t~malloc4.base| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 15426#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base main_~p~0.base))), 15427#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 15428#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (= 0 |main_#t~mem6.offset|)), 15429#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 15430#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 15431#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 15432#(and (= 8 (select |#length| main_~t~0.base)) (not (= main_~t~0.base main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base))), 15433#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 15434#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|))), 15435#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 15436#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 15437#(and (or (= 0 main_~flag~0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.base main_~a~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))))) (= 0 main_~a~0.offset) (= main_~p~0.offset 0)), 15438#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 15439#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)))) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ 0 4)))), 15440#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 15441#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 15442#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) (+ 0 4)))), 15443#(or (<= (+ main_~p~0.offset 1) 0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= 1 main_~p~0.offset)), 15444#(or (and (= main_~tmp~0.offset main_~p~0.offset) (not (= main_~p~0.offset 0))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 15445#(or (not (= main_~tmp~0.offset 0)) (and (= 8 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|))), 15446#(or (not (= main_~tmp~0.offset 0)) (and (= main_~p~0.offset 0) (= 8 (select |#length| main_~p~0.base)))), 15447#(and (= main_~p~0.offset 0) (= 8 (select |#length| main_~p~0.base))), 15419#true, 15420#false, 15421#(= 0 |main_#t~malloc0.offset|), 15422#(= 0 main_~a~0.offset), 15423#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))] [2018-02-02 10:27:14,210 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:27:14,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:27:14,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:27:14,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:27:14,210 INFO L87 Difference]: Start difference. First operand 244 states and 276 transitions. Second operand 29 states. [2018-02-02 10:27:15,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:15,438 INFO L93 Difference]: Finished difference Result 268 states and 299 transitions. [2018-02-02 10:27:15,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:27:15,438 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 73 [2018-02-02 10:27:15,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:15,439 INFO L225 Difference]: With dead ends: 268 [2018-02-02 10:27:15,439 INFO L226 Difference]: Without dead ends: 268 [2018-02-02 10:27:15,439 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=441, Invalid=3099, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:27:15,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-02 10:27:15,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 246. [2018-02-02 10:27:15,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-02-02 10:27:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 278 transitions. [2018-02-02 10:27:15,442 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 278 transitions. Word has length 73 [2018-02-02 10:27:15,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:15,442 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 278 transitions. [2018-02-02 10:27:15,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:27:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 278 transitions. [2018-02-02 10:27:15,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:27:15,442 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:15,443 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2018-02-02 10:27:15,443 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:27:15,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2017330703, now seen corresponding path program 3 times [2018-02-02 10:27:15,443 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:15,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:16,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:16,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 10:27:16,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:16,014 INFO L182 omatonBuilderFactory]: Interpolants [16024#true, 16025#false, 16026#(= 0 |main_#t~malloc0.offset|), 16027#(= 0 main_~a~0.offset), 16028#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 16029#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 16030#(and (not (= |main_#t~malloc4.base| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 16031#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base main_~p~0.base))), 16032#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 16033#(and (= 0 main_~a~0.offset) (not (= |main_#t~mem6.base| main_~a~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 16034#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 16035#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (= main_~flag~0 (select |#valid| main_~a~0.base)) (= main_~flag~0 1) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))))), 16036#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= main_~flag~0 (select |#valid| main_~a~0.base)) (= main_~flag~0 1) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))))), 16037#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (= main_~flag~0 (select |#valid| main_~a~0.base)) (= main_~flag~0 1) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))))), 16038#(and (= 0 main_~a~0.offset) (or (and (= main_~flag~0 (select |#valid| main_~p~0.base)) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~flag~0 (select |#valid| main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~flag~0))), 16039#(and (or (= 0 main_~flag~0) (and (= main_~flag~0 (select |#valid| main_~a~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~flag~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem6.base|)))) (= 0 main_~a~0.offset)), 16040#(and (= 0 main_~a~0.offset) (or (= 0 main_~flag~0) (and (= main_~flag~0 (select |#valid| main_~a~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~flag~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))))), 16041#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base)) (not (= 0 (select |#valid| main_~a~0.base)))), 16042#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 16043#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= main_~a~0.base main_~t~0.base))), 16044#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 16045#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem6.base|))), 16046#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 16047#(and (= 0 main_~a~0.offset) (= |main_#t~malloc4.offset| main_~a~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= |main_#t~malloc4.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 16048#(and (= 0 main_~a~0.offset) (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= main_~t~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= main_~t~0.offset main_~a~0.offset)), 16049#(and (= 0 main_~a~0.offset) (or (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) main_~a~0.offset)), 16050#(and (= 0 main_~a~0.offset) (= |main_#t~mem6.offset| main_~a~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 16051#(and (= 0 main_~a~0.offset) (or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))))), 16052#(and (= 0 main_~a~0.offset) (or (= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))))), 16053#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (= main_~p~0.offset 0)), 16054#(and (= main_~p~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= |main_#t~mem8| 3))), 16055#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 16056#(= 1 (select |#valid| |main_#t~mem11.base|)), 16057#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:27:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:16,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:27:16,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:27:16,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:27:16,015 INFO L87 Difference]: Start difference. First operand 246 states and 278 transitions. Second operand 34 states. Received shutdown request... [2018-02-02 10:27:17,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:27:17,179 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:27:17,182 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:27:17,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:27:17 BoogieIcfgContainer [2018-02-02 10:27:17,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:27:17,183 INFO L168 Benchmark]: Toolchain (without parser) took 55327.74 ms. Allocated memory was 394.3 MB in the beginning and 1.0 GB in the end (delta: 627.0 MB). Free memory was 351.0 MB in the beginning and 843.1 MB in the end (delta: -492.1 MB). Peak memory consumption was 135.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:27:17,184 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 394.3 MB. Free memory is still 357.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:27:17,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.42 ms. Allocated memory is still 394.3 MB. Free memory was 351.0 MB in the beginning and 340.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:27:17,184 INFO L168 Benchmark]: Boogie Preprocessor took 30.91 ms. Allocated memory is still 394.3 MB. Free memory was 340.4 MB in the beginning and 339.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:27:17,184 INFO L168 Benchmark]: RCFGBuilder took 276.75 ms. Allocated memory is still 394.3 MB. Free memory was 337.7 MB in the beginning and 312.5 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:27:17,185 INFO L168 Benchmark]: TraceAbstraction took 54852.62 ms. Allocated memory was 394.3 MB in the beginning and 1.0 GB in the end (delta: 627.0 MB). Free memory was 312.5 MB in the beginning and 843.1 MB in the end (delta: -530.6 MB). Peak memory consumption was 96.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:27:17,185 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 394.3 MB. Free memory is still 357.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.42 ms. Allocated memory is still 394.3 MB. Free memory was 351.0 MB in the beginning and 340.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 30.91 ms. Allocated memory is still 394.3 MB. Free memory was 340.4 MB in the beginning and 339.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 276.75 ms. Allocated memory is still 394.3 MB. Free memory was 337.7 MB in the beginning and 312.5 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54852.62 ms. Allocated memory was 394.3 MB in the beginning and 1.0 GB in the end (delta: 627.0 MB). Free memory was 312.5 MB in the beginning and 843.1 MB in the end (delta: -530.6 MB). Peak memory consumption was 96.5 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 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 25 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 83 locations, 27 error locations. TIMEOUT Result, 54.8s OverallTime, 41 OverallIterations, 5 TraceHistogramMax, 39.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2104 SDtfs, 14515 SDslu, 16807 SDs, 0 SdLazy, 23440 SolverSat, 3926 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1664 GetRequests, 85 SyntacticMatches, 7 SemanticMatches, 1571 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21449 ImplicationChecksByTransitivity, 38.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 55/818 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 1398 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 1968 NumberOfCodeBlocks, 1968 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1927 ConstructedInterpolants, 0 QuantifiedInterpolants, 2220909 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 12 PerfectInterpolantSequences, 55/818 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/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-27-17-190.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-27-17-190.csv Completed graceful shutdown