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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:16:59,397 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:16:59,398 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:16:59,409 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:16:59,410 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:16:59,410 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:16:59,411 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:16:59,412 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:16:59,414 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:16:59,414 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:16:59,415 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:16:59,415 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:16:59,416 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:16:59,417 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:16:59,418 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:16:59,420 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:16:59,421 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:16:59,423 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:16:59,424 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:16:59,425 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:16:59,426 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:16:59,426 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:16:59,427 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:16:59,428 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:16:59,428 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:16:59,429 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:16:59,429 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:16:59,430 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:16:59,430 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:16:59,430 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:16:59,431 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:16:59,431 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 02:16:59,441 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:16:59,441 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:16:59,442 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:16:59,442 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:16:59,442 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:16:59,443 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:16:59,443 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:16:59,443 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:16:59,443 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:16:59,443 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:16:59,444 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:16:59,444 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:16:59,444 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:16:59,444 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:16:59,444 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:16:59,444 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:16:59,444 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:16:59,445 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:16:59,445 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:16:59,445 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:16:59,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:16:59,445 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:16:59,445 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:16:59,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:16:59,484 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:16:59,487 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:16:59,488 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:16:59,488 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:16:59,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-02-04 02:16:59,632 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:16:59,633 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:16:59,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:16:59,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:16:59,640 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:16:59,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:16:59" (1/1) ... [2018-02-04 02:16:59,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@131cb6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:16:59, skipping insertion in model container [2018-02-04 02:16:59,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:16:59" (1/1) ... [2018-02-04 02:16:59,652 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:16:59,680 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:16:59,761 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:16:59,772 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:16:59,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:16:59 WrapperNode [2018-02-04 02:16:59,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:16:59,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:16:59,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:16:59,782 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:16:59,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:16:59" (1/1) ... [2018-02-04 02:16:59,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:16:59" (1/1) ... [2018-02-04 02:16:59,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:16:59" (1/1) ... [2018-02-04 02:16:59,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:16:59" (1/1) ... [2018-02-04 02:16:59,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:16:59" (1/1) ... [2018-02-04 02:16:59,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:16:59" (1/1) ... [2018-02-04 02:16:59,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:16:59" (1/1) ... [2018-02-04 02:16:59,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:16:59,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:16:59,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:16:59,813 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:16:59,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:16:59" (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-04 02:16:59,849 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:16:59,849 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:16:59,850 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 02:16:59,850 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:16:59,850 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 02:16:59,850 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 02:16:59,850 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 02:16:59,850 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 02:16:59,850 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:16:59,850 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:16:59,850 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:16:59,850 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-02-04 02:16:59,850 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-02-04 02:16:59,850 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 02:16:59,851 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 02:16:59,851 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-02-04 02:16:59,851 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 02:16:59,851 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:16:59,851 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:16:59,851 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:16:59,954 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 02:17:00,034 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:17:00,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:17:00 BoogieIcfgContainer [2018-02-04 02:17:00,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:17:00,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:17:00,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:17:00,037 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:17:00,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:16:59" (1/3) ... [2018-02-04 02:17:00,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2569253b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:17:00, skipping insertion in model container [2018-02-04 02:17:00,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:16:59" (2/3) ... [2018-02-04 02:17:00,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2569253b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:17:00, skipping insertion in model container [2018-02-04 02:17:00,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:17:00" (3/3) ... [2018-02-04 02:17:00,040 INFO L107 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-02-04 02:17:00,045 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:17:00,050 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-04 02:17:00,080 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:17:00,080 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:17:00,080 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:17:00,080 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:17:00,080 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:17:00,081 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:17:00,081 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:17:00,081 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:17:00,082 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:17:00,093 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-02-04 02:17:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 02:17:00,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:00,102 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 02:17:00,102 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:00,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2931467, now seen corresponding path program 1 times [2018-02-04 02:17:00,153 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:00,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:00,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:17:00,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:17:00,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:00,258 INFO L182 omatonBuilderFactory]: Interpolants [64#false, 65#(= 1 (select |#valid| |~#a.base|)), 63#true] [2018-02-04 02:17:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:00,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:17:00,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:17:00,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:17:00,272 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-02-04 02:17:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:00,373 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-04 02:17:00,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:17:00,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 02:17:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:00,381 INFO L225 Difference]: With dead ends: 60 [2018-02-04 02:17:00,381 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 02:17:00,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 02:17:00,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 02:17:00,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 02:17:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 02:17:00,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-02-04 02:17:00,463 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2018-02-04 02:17:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:00,463 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-02-04 02:17:00,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:17:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-02-04 02:17:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 02:17:00,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:00,464 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 02:17:00,464 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:00,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2931468, now seen corresponding path program 1 times [2018-02-04 02:17:00,465 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:00,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:00,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:17:00,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:17:00,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:00,512 INFO L182 omatonBuilderFactory]: Interpolants [183#true, 184#false, 185#(and (= |~#a.offset| 0) (= (select |#length| |~#a.base|) 4))] [2018-02-04 02:17:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:00,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:17:00,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:17:00,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:17:00,515 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 3 states. [2018-02-04 02:17:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:00,559 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-04 02:17:00,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:17:00,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 02:17:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:00,560 INFO L225 Difference]: With dead ends: 53 [2018-02-04 02:17:00,560 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 02:17:00,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 02:17:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 02:17:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 02:17:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 02:17:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-02-04 02:17:00,566 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 4 [2018-02-04 02:17:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:00,567 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-02-04 02:17:00,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:17:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-02-04 02:17:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:17:00,567 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:00,568 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:17:00,568 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash -240006955, now seen corresponding path program 1 times [2018-02-04 02:17:00,569 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:00,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:00,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-04 02:17:00,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:17:00,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:17:00,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:00,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-04 02:17:00,654 INFO L182 omatonBuilderFactory]: Interpolants [292#true, 293#false, 294#(= 1 (select |#valid| |foo_~#p~0.base|))] [2018-02-04 02:17:00,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-04 02:17:00,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:17:00,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:17:00,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:17:00,654 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 3 states. [2018-02-04 02:17:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:00,684 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-02-04 02:17:00,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:17:00,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-04 02:17:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:00,685 INFO L225 Difference]: With dead ends: 51 [2018-02-04 02:17:00,686 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 02:17:00,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:17:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 02:17:00,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 02:17:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 02:17:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-04 02:17:00,691 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 14 [2018-02-04 02:17:00,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:00,691 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-04 02:17:00,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:17:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-04 02:17:00,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:17:00,692 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:00,692 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:17:00,692 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:00,692 INFO L82 PathProgramCache]: Analyzing trace with hash -240006954, now seen corresponding path program 1 times [2018-02-04 02:17:00,693 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:00,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:00,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:17:00,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:17:00,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:00,765 INFO L182 omatonBuilderFactory]: Interpolants [400#(and (= |foo_~#p~0.offset| 0) (= (select |#length| |foo_~#p~0.base|) 4)), 397#true, 398#false, 399#(and (= |foo_~#p~0.offset| 0) (= (select |#valid| |foo_~#p~0.base|) 1) (= 4 (select |#length| |foo_~#p~0.base|)))] [2018-02-04 02:17:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:00,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:17:00,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:17:00,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:17:00,765 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 4 states. [2018-02-04 02:17:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:00,789 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-02-04 02:17:00,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:17:00,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 02:17:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:00,790 INFO L225 Difference]: With dead ends: 49 [2018-02-04 02:17:00,790 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 02:17:00,791 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:17:00,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 02:17:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 02:17:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 02:17:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-02-04 02:17:00,793 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 14 [2018-02-04 02:17:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:00,793 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-02-04 02:17:00,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:17:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-02-04 02:17:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 02:17:00,794 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:00,794 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:17:00,794 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:00,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1149718964, now seen corresponding path program 1 times [2018-02-04 02:17:00,795 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:00,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:00,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:17:00,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:17:00,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:00,934 INFO L182 omatonBuilderFactory]: Interpolants [499#true, 500#false, 501#(and (= |~#a.offset| 0) (= (select |#length| |~#a.base|) 4)), 502#(and (= |~#a.offset| 0) (<= 4 (select |#length| |~#a.base|))), 503#(and (= |~#a.offset| 0) (<= 4 (select |#length| |~#a.base|)) (or (not (= |~#a.base| |foo_~#p~0.base|)) (= (select |#valid| |foo_~#p~0.base|) 1)))] [2018-02-04 02:17:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:00,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:17:00,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:17:00,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:17:00,935 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 5 states. [2018-02-04 02:17:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:00,997 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-02-04 02:17:00,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:17:00,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 02:17:00,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:00,998 INFO L225 Difference]: With dead ends: 47 [2018-02-04 02:17:00,998 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 02:17:00,998 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:17:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 02:17:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 02:17:01,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 02:17:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-02-04 02:17:01,000 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 15 [2018-02-04 02:17:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:01,001 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-02-04 02:17:01,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:17:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-02-04 02:17:01,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:17:01,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:01,001 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:17:01,001 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:01,002 INFO L82 PathProgramCache]: Analyzing trace with hash 536104684, now seen corresponding path program 1 times [2018-02-04 02:17:01,002 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:01,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:01,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:17:01,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:17:01,036 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:01,037 INFO L182 omatonBuilderFactory]: Interpolants [600#true, 601#false, 602#(= 1 (select |#valid| |main_~#p~1.base|))] [2018-02-04 02:17:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:01,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:17:01,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:17:01,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:17:01,038 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 3 states. [2018-02-04 02:17:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:01,054 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-02-04 02:17:01,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:17:01,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-04 02:17:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:01,055 INFO L225 Difference]: With dead ends: 45 [2018-02-04 02:17:01,055 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 02:17:01,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 02:17:01,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 02:17:01,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 02:17:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 02:17:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-02-04 02:17:01,057 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 27 [2018-02-04 02:17:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:01,058 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-02-04 02:17:01,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:17:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-02-04 02:17:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:17:01,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:01,058 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:17:01,059 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:01,059 INFO L82 PathProgramCache]: Analyzing trace with hash 536104685, now seen corresponding path program 1 times [2018-02-04 02:17:01,059 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:01,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:01,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:17:01,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:17:01,157 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:01,158 INFO L182 omatonBuilderFactory]: Interpolants [693#true, 694#false, 695#(= (select |#valid| |~#a.base|) 1), 696#(= |#valid| |old(#valid)|), 697#(= 0 (select |old(#valid)| |foo_~#p~0.base|)), 698#(= 1 (select |#valid| |#Ultimate.C_memcpy_dest.base|)), 699#(or (= 0 (select |old(#valid)| |~#a.base|)) (= 1 (select (store |#valid| |foo_~#p~0.base| 0) |~#a.base|))), 700#(or (= 0 (select |old(#valid)| |~#a.base|)) (= 1 (select |#valid| |~#a.base|)))] [2018-02-04 02:17:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:01,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:17:01,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:17:01,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:17:01,159 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 8 states. [2018-02-04 02:17:01,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:01,297 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-02-04 02:17:01,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:17:01,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-02-04 02:17:01,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:01,298 INFO L225 Difference]: With dead ends: 44 [2018-02-04 02:17:01,298 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 02:17:01,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:17:01,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 02:17:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-04 02:17:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 02:17:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-02-04 02:17:01,302 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 27 [2018-02-04 02:17:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:01,302 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-02-04 02:17:01,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:17:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-02-04 02:17:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:17:01,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:01,303 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:17:01,303 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:01,304 INFO L82 PathProgramCache]: Analyzing trace with hash 536104686, now seen corresponding path program 1 times [2018-02-04 02:17:01,304 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:01,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:01,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:17:01,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:17:01,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:01,370 INFO L182 omatonBuilderFactory]: Interpolants [800#(and (= |main_~#p~1.offset| 0) (= (select |#length| |main_~#p~1.base|) 4)), 798#true, 799#false] [2018-02-04 02:17:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:01,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:17:01,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:17:01,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:17:01,371 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 3 states. [2018-02-04 02:17:01,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:01,406 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-02-04 02:17:01,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:17:01,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-04 02:17:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:01,407 INFO L225 Difference]: With dead ends: 42 [2018-02-04 02:17:01,407 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 02:17:01,407 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 02:17:01,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 02:17:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-04 02:17:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 02:17:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-02-04 02:17:01,410 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 27 [2018-02-04 02:17:01,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:01,411 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-02-04 02:17:01,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:17:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-02-04 02:17:01,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 02:17:01,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:01,412 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:17:01,412 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:01,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1677513941, now seen corresponding path program 1 times [2018-02-04 02:17:01,413 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:01,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:17:01,491 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:17:01,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:17:01,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:01,492 INFO L182 omatonBuilderFactory]: Interpolants [885#true, 886#false, 887#(or (not (= |#Ultimate.C_memcpy_size| 4)) (= |#Ultimate.C_memcpy_#t~loopctr5| 0)), 888#(not (= |#Ultimate.C_memcpy_size| 4))] [2018-02-04 02:17:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:17:01,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:17:01,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:17:01,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:17:01,493 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 4 states. [2018-02-04 02:17:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:01,505 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-02-04 02:17:01,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:17:01,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-04 02:17:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:01,507 INFO L225 Difference]: With dead ends: 48 [2018-02-04 02:17:01,507 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 02:17:01,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:17:01,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 02:17:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-04 02:17:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 02:17:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-02-04 02:17:01,510 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2018-02-04 02:17:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:01,510 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-02-04 02:17:01,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:17:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-02-04 02:17:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 02:17:01,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:01,511 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:17:01,512 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:01,512 INFO L82 PathProgramCache]: Analyzing trace with hash -656412319, now seen corresponding path program 1 times [2018-02-04 02:17:01,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:01,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:17:01,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:17:01,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 02:17:01,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:01,663 INFO L182 omatonBuilderFactory]: Interpolants [981#true, 982#false, 983#(= |#Ultimate.C_memcpy_#t~loopctr5| 0), 984#(or (not (= |#Ultimate.C_memcpy_size| 4)) (<= |#Ultimate.C_memcpy_#t~loopctr5| 1)), 985#(not (= |#Ultimate.C_memcpy_size| 4))] [2018-02-04 02:17:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:17:01,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:17:01,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:17:01,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:17:01,664 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 5 states. [2018-02-04 02:17:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:01,706 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-02-04 02:17:01,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:17:01,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-02-04 02:17:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:01,707 INFO L225 Difference]: With dead ends: 50 [2018-02-04 02:17:01,707 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 02:17:01,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:17:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 02:17:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 02:17:01,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 02:17:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-02-04 02:17:01,710 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 37 [2018-02-04 02:17:01,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:01,710 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-02-04 02:17:01,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:17:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-02-04 02:17:01,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 02:17:01,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:01,711 INFO L351 BasicCegarLoop]: trace histogram [4, 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-04 02:17:01,711 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:01,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2111815019, now seen corresponding path program 2 times [2018-02-04 02:17:01,712 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:01,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 02:17:01,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:17:01,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:17:01,828 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:01,828 INFO L182 omatonBuilderFactory]: Interpolants [1082#true, 1083#false, 1084#(or (not (= |#Ultimate.C_memcpy_size| 4)) (= |#Ultimate.C_memcpy_#t~loopctr5| 0)), 1085#(or (not (= |#Ultimate.C_memcpy_size| 4)) (<= |#Ultimate.C_memcpy_#t~loopctr5| 1)), 1086#(or (not (= |#Ultimate.C_memcpy_size| 4)) (<= |#Ultimate.C_memcpy_#t~loopctr5| 2)), 1087#(not (= |#Ultimate.C_memcpy_size| 4))] [2018-02-04 02:17:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 02:17:01,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:17:01,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:17:01,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:17:01,829 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 6 states. [2018-02-04 02:17:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:01,881 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-02-04 02:17:01,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:17:01,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-04 02:17:01,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:01,883 INFO L225 Difference]: With dead ends: 52 [2018-02-04 02:17:01,883 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 02:17:01,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:17:01,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 02:17:01,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 02:17:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 02:17:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-02-04 02:17:01,885 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 39 [2018-02-04 02:17:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:01,885 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-02-04 02:17:01,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:17:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-02-04 02:17:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 02:17:01,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:01,885 INFO L351 BasicCegarLoop]: trace histogram [6, 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-04 02:17:01,885 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:01,886 INFO L82 PathProgramCache]: Analyzing trace with hash 304342049, now seen corresponding path program 3 times [2018-02-04 02:17:01,886 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:01,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 02:17:02,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:17:02,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:17:02,039 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:02,039 INFO L182 omatonBuilderFactory]: Interpolants [1188#true, 1189#false, 1190#(or (not (= |#Ultimate.C_memcpy_size| 4)) (= |#Ultimate.C_memcpy_#t~loopctr5| 0)), 1191#(or (not (= |#Ultimate.C_memcpy_size| 4)) (<= |#Ultimate.C_memcpy_#t~loopctr5| 1)), 1192#(or (not (= |#Ultimate.C_memcpy_size| 4)) (<= |#Ultimate.C_memcpy_#t~loopctr5| 2)), 1193#(or (not (= |#Ultimate.C_memcpy_size| 4)) (<= |#Ultimate.C_memcpy_#t~loopctr5| 3)), 1194#(not (= |#Ultimate.C_memcpy_size| 4))] [2018-02-04 02:17:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 02:17:02,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:17:02,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:17:02,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:17:02,040 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 7 states. [2018-02-04 02:17:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:02,055 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-02-04 02:17:02,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:17:02,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-02-04 02:17:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:02,056 INFO L225 Difference]: With dead ends: 54 [2018-02-04 02:17:02,056 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 02:17:02,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:17:02,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 02:17:02,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 02:17:02,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 02:17:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-02-04 02:17:02,058 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 41 [2018-02-04 02:17:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:02,059 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-02-04 02:17:02,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:17:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-02-04 02:17:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 02:17:02,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:02,060 INFO L351 BasicCegarLoop]: trace histogram [8, 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-04 02:17:02,060 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:02,060 INFO L82 PathProgramCache]: Analyzing trace with hash 747384917, now seen corresponding path program 4 times [2018-02-04 02:17:02,060 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:02,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 02:17:02,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:17:02,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:17:02,928 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:02,929 INFO L182 omatonBuilderFactory]: Interpolants [1312#(or (not (= |#Ultimate.C_memcpy_size| 4)) (= (select (select |old(#memory_$Pointer$.offset)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_$Pointer$.offset| |#Ultimate.C_memcpy_dest.base|) (+ (- (+ (- |#Ultimate.C_memcpy_size|) 4)) |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1313#(or (= 0 (select (select |#memory_$Pointer$.offset| |~#a.base|) |~#a.offset|)) (not (= |~#a.offset| 0))), 1314#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#a.base|) 0)) (= 0 |~#a.offset|)), 1315#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#a.base|) 0)) (= 0 |~#a.offset|) (= |main_~#p~1.offset| |~#a.offset|)), 1316#(or (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1317#(or (not (= 0 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|))) (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1318#(or (= (select (select |old(#memory_$Pointer$.offset)| |#Ultimate.C_memcpy_src.base|) 0) (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_dest.offset|) (select (select |#memory_$Pointer$.offset| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_src.offset|))) (+ |#Ultimate.C_memcpy_dest.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr5|) 1))))) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|) 0) (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 2 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|))), 1319#(or (= (select (select |old(#memory_$Pointer$.offset)| |#Ultimate.C_memcpy_src.base|) 0) (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_dest.offset|) (select (select |#memory_$Pointer$.offset| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_src.offset|))) (+ |#Ultimate.C_memcpy_dest.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr5|) 2))))) (not (= |#Ultimate.C_memcpy_size| 4)) (<= 3 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|) 1)), 1320#(or (<= 4 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|)) (= (select (select |old(#memory_$Pointer$.offset)| |#Ultimate.C_memcpy_src.base|) 0) (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_dest.offset|) (select (select |#memory_$Pointer$.offset| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_src.offset|))) (+ |#Ultimate.C_memcpy_dest.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr5|) 3))))) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|) 2) (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1321#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#p~1.base|) |main_~#p~1.offset|)), 1322#(= |main_#t~mem3.offset| 0), 1299#true, 1300#false, 1301#(= 0 |~#a.offset|), 1302#(= 0 |foo_~#p~0.offset|), 1303#(and (= 0 |foo_#t~malloc0.offset|) (= 0 |foo_~#p~0.offset|)), 1304#(and (= 0 (select (select |#memory_$Pointer$.offset| |foo_~#p~0.base|) 0)) (= 0 |foo_~#p~0.offset|)), 1305#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 1306#(or (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1307#(or (and (or (not (= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|) 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= |#Ultimate.C_memcpy_#t~loopctr5| 0)) (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1308#(or (and (or (= (select (select |old(#memory_$Pointer$.offset)| |#Ultimate.C_memcpy_src.base|) 0) (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr5|) (select (select |#memory_$Pointer$.offset| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|))) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr5|) 1)) |#Ultimate.C_memcpy_dest.offset|))) (not (= 1 (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_dest.offset|)))) (or (<= (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_dest.offset|) 0) (= 1 (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_dest.offset|)))) (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1309#(or (and (= (select (select |old(#memory_$Pointer$.offset)| |#Ultimate.C_memcpy_src.base|) 0) (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr5|) (select (select |#memory_$Pointer$.offset| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|))) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr5|) 2)) |#Ultimate.C_memcpy_dest.offset|))) (<= |#Ultimate.C_memcpy_#t~loopctr5| 2)) (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|) 1)), 1310#(or (not (= |#Ultimate.C_memcpy_size| 4)) (and (or (<= |#Ultimate.C_memcpy_#t~loopctr5| 2) (= (select (select |old(#memory_$Pointer$.offset)| |#Ultimate.C_memcpy_src.base|) 0) (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr5|) (select (select |#memory_$Pointer$.offset| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|))) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr5|) 3)) |#Ultimate.C_memcpy_dest.offset|)))) (<= |#Ultimate.C_memcpy_#t~loopctr5| 3)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1311#(or (and (= (select (select |old(#memory_$Pointer$.offset)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_$Pointer$.offset| |#Ultimate.C_memcpy_dest.base|) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr5|) 4)) |#Ultimate.C_memcpy_dest.offset|))) (<= |#Ultimate.C_memcpy_#t~loopctr5| 4)) (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_dest.offset|) 3))] [2018-02-04 02:17:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 02:17:02,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:17:02,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:17:02,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:17:02,930 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 24 states. [2018-02-04 02:17:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:03,586 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-02-04 02:17:03,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 02:17:03,587 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-02-04 02:17:03,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:03,589 INFO L225 Difference]: With dead ends: 75 [2018-02-04 02:17:03,589 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 02:17:03,589 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 02:17:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 02:17:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2018-02-04 02:17:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 02:17:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-02-04 02:17:03,595 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 43 [2018-02-04 02:17:03,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:03,595 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-02-04 02:17:03,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:17:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-02-04 02:17:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 02:17:03,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:03,596 INFO L351 BasicCegarLoop]: trace histogram [8, 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-04 02:17:03,597 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:03,597 INFO L82 PathProgramCache]: Analyzing trace with hash 747384918, now seen corresponding path program 1 times [2018-02-04 02:17:03,597 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:03,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:17:04,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:17:04,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:17:04,258 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:04,258 INFO L182 omatonBuilderFactory]: Interpolants [1505#true, 1506#false, 1507#(= 0 |~#a.offset|), 1508#(and (= (select |#valid| |foo_~#p~0.base|) 1) (= 0 |foo_~#p~0.offset|)), 1509#(and (= 1 (select (store |#valid| |foo_~#p~0.base| 0) |foo_#t~malloc0.base|)) (= 0 |foo_~#p~0.offset|)), 1510#(and (= 0 |foo_~#p~0.offset|) (= 1 (select (store |#valid| |foo_~#p~0.base| 0) (select (select |#memory_$Pointer$.base| |foo_~#p~0.base|) |foo_~#p~0.offset|)))), 1511#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 1512#(or (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 1513#(or (not (= |#Ultimate.C_memcpy_size| 4)) (not (= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|) 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 1514#(or (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|) 0) (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0) (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr5|) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|))) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr5|) 1)) |#Ultimate.C_memcpy_dest.offset|))) (<= 2 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|))), 1515#(or (not (= |#Ultimate.C_memcpy_size| 4)) (<= 3 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0) (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr5|) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|))) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr5|) 2)) |#Ultimate.C_memcpy_dest.offset|))) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|) 1)), 1516#(or (<= 4 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|)) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|) 2) (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr5|) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|))) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr5|) 3)) |#Ultimate.C_memcpy_dest.offset|)) (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0))), 1517#(or (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_size|) (or (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|) 3) (= (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr5|) 4)) |#Ultimate.C_memcpy_dest.offset|))) (<= 5 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_size|))))), 1518#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ (- (+ (- |#Ultimate.C_memcpy_size|) 4)) |#Ultimate.C_memcpy_dest.offset|))) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_size|) 3) (<= 5 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_size|))), 1519#(or (= 1 (select (store |#valid| |foo_~#p~0.base| 0) (select (select |#memory_$Pointer$.base| |~#a.base|) |~#a.offset|))) (not (= |~#a.offset| 0))), 1520#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#a.base|) |~#a.offset|))) (not (= |~#a.offset| 0))), 1521#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#a.base|) 0))) (= 0 |~#a.offset|)), 1522#(and (or (= |main_~#p~1.base| (select (select |#memory_$Pointer$.base| |~#a.base|) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#a.base|) 0)))) (= 0 |main_~#p~1.offset|) (= 0 |~#a.offset|)), 1523#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 1 (select |#valid| |#Ultimate.C_memcpy_dest.base|)))), 1524#(or (and (= |#Ultimate.C_memcpy_#t~loopctr5| 0) (or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 1 (select |#valid| |#Ultimate.C_memcpy_dest.base|))))) (not (= |#Ultimate.C_memcpy_src.offset| 0))), 1525#(or (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr5|) (= 1 (select |#valid| |#Ultimate.C_memcpy_dest.base|)) (= (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_dest.offset|) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_src.offset|))) (+ |#Ultimate.C_memcpy_dest.offset| (- 0))) (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1526#(or (and (<= 2 |#Ultimate.C_memcpy_#t~loopctr5|) (= 1 (select |#valid| |#Ultimate.C_memcpy_dest.base|)) (= (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_dest.offset|) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_src.offset|))) (+ |#Ultimate.C_memcpy_dest.offset| (- 0))) (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1527#(or (and (= 1 (select |#valid| |#Ultimate.C_memcpy_dest.base|)) (= (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_dest.offset|) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_src.offset|))) (+ |#Ultimate.C_memcpy_dest.offset| (- 0))) (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1528#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- 0))) (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0)) (= 1 (select |#valid| |#Ultimate.C_memcpy_dest.base|)))), 1529#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#p~1.base|) |main_~#p~1.offset|))), 1530#(= 1 (select |#valid| |main_#t~mem3.base|))] [2018-02-04 02:17:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:17:04,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 02:17:04,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 02:17:04,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:17:04,259 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 26 states. [2018-02-04 02:17:04,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:04,750 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-04 02:17:04,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:17:04,750 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 43 [2018-02-04 02:17:04,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:04,751 INFO L225 Difference]: With dead ends: 67 [2018-02-04 02:17:04,751 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 02:17:04,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=234, Invalid=1488, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 02:17:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 02:17:04,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 02:17:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 02:17:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-02-04 02:17:04,757 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 43 [2018-02-04 02:17:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:04,757 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-02-04 02:17:04,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 02:17:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-02-04 02:17:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 02:17:04,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:04,758 INFO L351 BasicCegarLoop]: trace histogram [10, 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-04 02:17:04,758 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:04,759 INFO L82 PathProgramCache]: Analyzing trace with hash 937657461, now seen corresponding path program 5 times [2018-02-04 02:17:04,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:04,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 02:17:04,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:17:04,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:17:04,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:04,860 INFO L182 omatonBuilderFactory]: Interpolants [1698#true, 1699#false, 1700#(= |#Ultimate.C_memcpy_#t~loopctr5| 0), 1701#(or (<= 1 |#Ultimate.C_memcpy_#t~loopctr5|) (not (= |#Ultimate.C_memcpy_size| 4))), 1702#(or (<= 2 |#Ultimate.C_memcpy_#t~loopctr5|) (not (= |#Ultimate.C_memcpy_size| 4))), 1703#(or (not (= |#Ultimate.C_memcpy_size| 4)) (<= 3 |#Ultimate.C_memcpy_#t~loopctr5|)), 1704#(or (not (= |#Ultimate.C_memcpy_size| 4)) (<= 4 |#Ultimate.C_memcpy_#t~loopctr5|)), 1705#(or (not (= |#Ultimate.C_memcpy_size| 4)) (<= 5 |#Ultimate.C_memcpy_#t~loopctr5|)), 1706#(not (= |#Ultimate.C_memcpy_size| 4))] [2018-02-04 02:17:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 02:17:04,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:17:04,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:17:04,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:17:04,861 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 9 states. [2018-02-04 02:17:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:04,889 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-04 02:17:04,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:17:04,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-02-04 02:17:04,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:04,891 INFO L225 Difference]: With dead ends: 60 [2018-02-04 02:17:04,891 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 02:17:04,891 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:17:04,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 02:17:04,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 02:17:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 02:17:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 47 transitions. [2018-02-04 02:17:04,893 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 47 transitions. Word has length 45 [2018-02-04 02:17:04,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:04,894 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 47 transitions. [2018-02-04 02:17:04,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:17:04,894 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 47 transitions. [2018-02-04 02:17:04,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 02:17:04,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:17:04,895 INFO L351 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:17:04,895 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 02:17:04,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1348121705, now seen corresponding path program 1 times [2018-02-04 02:17:04,896 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:17:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:17:04,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:17:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:17:06,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:17:06,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 02:17:06,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:17:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:17:06,492 INFO L182 omatonBuilderFactory]: Interpolants [1815#true, 1816#false, 1817#(= 0 |~#a.offset|), 1818#(and (= |#valid| |old(#valid)|) (= 0 |~#a.offset|)), 1819#(= |#valid| |old(#valid)|), 1820#(and (= 0 (select |old(#valid)| |foo_~#p~0.base|)) (= (store |#valid| |foo_~#p~0.base| (select |old(#valid)| |foo_~#p~0.base|)) |old(#valid)|) (= (select |#valid| |foo_~#p~0.base|) 1) (= 0 |foo_~#p~0.offset|)), 1821#(and (= 0 (select |old(#valid)| |foo_~#p~0.base|)) (= (select (store |#valid| |foo_~#p~0.base| 0) |foo_#t~malloc0.base|) 1) (= 0 (select |old(#valid)| |foo_#t~malloc0.base|)) (= 0 |foo_~#p~0.offset|) (not (= |foo_#t~malloc0.base| 0)) (= (store (store |#valid| |foo_~#p~0.base| (select |old(#valid)| |foo_~#p~0.base|)) |foo_#t~malloc0.base| (select |old(#valid)| |foo_#t~malloc0.base|)) |old(#valid)|)), 1822#(and (= 0 (select |old(#valid)| |foo_~#p~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |foo_~#p~0.base|) 0) 0)) (= (store (store |#valid| |foo_~#p~0.base| (select |old(#valid)| |foo_~#p~0.base|)) (select (select |#memory_$Pointer$.base| |foo_~#p~0.base|) |foo_~#p~0.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |foo_~#p~0.base|) |foo_~#p~0.offset|))) |old(#valid)|) (= (select (store |#valid| |foo_~#p~0.base| 0) (select (select |#memory_$Pointer$.base| |foo_~#p~0.base|) 0)) 1) (= 0 |foo_~#p~0.offset|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |foo_~#p~0.base|) |foo_~#p~0.offset|)))), 1823#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 1824#(or (and (= (select |#valid| |#Ultimate.C_memcpy_dest.base|) 1) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1825#(or (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select |#valid| |#Ultimate.C_memcpy_dest.base|) 1) (or (not (= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))), 1826#(or (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select |#valid| |#Ultimate.C_memcpy_dest.base|) 1) (or (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|) 0) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0) (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr5|) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|))) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr5|) 1)) |#Ultimate.C_memcpy_dest.offset|))) (<= 2 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|))))), 1827#(or (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select |#valid| |#Ultimate.C_memcpy_dest.base|) 1) (or (<= 3 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0) (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr5|) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|))) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr5|) 2)) |#Ultimate.C_memcpy_dest.offset|))) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|) 1)))), 1828#(or (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select |#valid| |#Ultimate.C_memcpy_dest.base|) 1) (or (<= 4 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|)) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|) 2) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr5|) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr5|))) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr5|) 3)) |#Ultimate.C_memcpy_dest.offset|)) (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0))))), 1829#(or (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_size|) (or (and (= (select |#valid| |#Ultimate.C_memcpy_dest.base|) 1) (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr5|) 4)) |#Ultimate.C_memcpy_dest.offset|))))) (<= (+ |#Ultimate.C_memcpy_#t~loopctr5| 1) |#Ultimate.C_memcpy_size|)))), 1830#(or (and (= (select |#valid| |#Ultimate.C_memcpy_dest.base|) 1) (or (= (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ (- (+ (- |#Ultimate.C_memcpy_size|) 4)) |#Ultimate.C_memcpy_dest.offset|))) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_size|) 3) (<= 5 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_size|)))) (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1831#(or (and (not (= (select (select |#memory_$Pointer$.base| |~#a.base|) |~#a.offset|) 0)) (= (select (store |#valid| |foo_~#p~0.base| 0) (select (select |#memory_$Pointer$.base| |~#a.base|) |~#a.offset|)) 1) (= (select (store |#valid| |foo_~#p~0.base| 0) |foo_~#p~0.base|) (select |old(#valid)| |foo_~#p~0.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#a.base|) |~#a.offset|))) (= (store (store |#valid| |foo_~#p~0.base| (select |old(#valid)| |foo_~#p~0.base|)) (select (select |#memory_$Pointer$.base| |~#a.base|) |~#a.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#a.base|) |~#a.offset|))) |old(#valid)|)) (not (= |~#a.offset| 0))), 1832#(or (and (not (= (select (select |#memory_$Pointer$.base| |~#a.base|) |~#a.offset|) 0)) (= (store |#valid| (select (select |#memory_$Pointer$.base| |~#a.base|) |~#a.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#a.base|) |~#a.offset|))) |old(#valid)|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#a.base|) |~#a.offset|)) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#a.base|) |~#a.offset|)))) (not (= |~#a.offset| 0))), 1833#(and (= (store |#valid| (select (select |#memory_$Pointer$.base| |~#a.base|) 0) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| |~#a.base|) 0) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#a.base|) 0)) 1) (= 0 |~#a.offset|)), 1834#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| |~#a.base|) 0) 0) |main_~#p~1.base| 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| |~#a.base|) 0) 0)) (= 0 |~#a.offset|) (not (= |main_~#p~1.base| (select (select |#memory_$Pointer$.base| |~#a.base|) 0))) (= |main_~#p~1.offset| |~#a.offset|)), 1835#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 1836#(or (and (or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#Ultimate.C_memcpy_#t~loopctr5| 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0))), 1837#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr5|) (= (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_dest.offset|) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_src.offset|))) (+ (- 0) |#Ultimate.C_memcpy_dest.offset|)) (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0)))), 1838#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 2 |#Ultimate.C_memcpy_#t~loopctr5|) (= (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_dest.offset|) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_src.offset|))) (+ (- 0) |#Ultimate.C_memcpy_dest.offset|)) (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0)))), 1839#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_dest.offset|) (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_src.offset|))) (+ (- 0) |#Ultimate.C_memcpy_dest.offset|)) (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0))), 1840#(or (= (select (select |#memory_$Pointer$.base| |#Ultimate.C_memcpy_dest.base|) (+ (- 0) |#Ultimate.C_memcpy_dest.offset|)) (select (select |old(#memory_$Pointer$.base)| |#Ultimate.C_memcpy_src.base|) 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1841#(and (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#p~1.base|) |main_~#p~1.offset|) 0) |main_~#p~1.base| 0)) (not (= |main_~#p~1.base| (select (select |#memory_$Pointer$.base| |main_~#p~1.base|) |main_~#p~1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p~1.base|) |main_~#p~1.offset|) 0))), 1842#(and (= (store (store |#valid| |main_#t~mem3.base| (select (store |#valid| |main_#t~mem3.base| 0) |main_#t~mem3.base|)) |main_~#p~1.base| 0) |old(#valid)|) (not (= |main_#t~mem3.base| 0)) (not (= |main_#t~mem3.base| |main_~#p~1.base|))), 1843#(= (store |#valid| |main_~#p~1.base| (select (store |#valid| |main_~#p~1.base| 0) |main_~#p~1.base|)) |old(#valid)|)] [2018-02-04 02:17:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:17:06,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 02:17:06,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 02:17:06,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2018-02-04 02:17:06,493 INFO L87 Difference]: Start difference. First operand 48 states and 47 transitions. Second operand 29 states. [2018-02-04 02:17:07,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:17:07,220 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2018-02-04 02:17:07,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:17:07,221 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 47 [2018-02-04 02:17:07,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:17:07,221 INFO L225 Difference]: With dead ends: 47 [2018-02-04 02:17:07,221 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 02:17:07,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=216, Invalid=1854, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 02:17:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 02:17:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 02:17:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 02:17:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 02:17:07,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2018-02-04 02:17:07,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:17:07,222 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 02:17:07,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 02:17:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 02:17:07,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 02:17:07,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:17:07 BoogieIcfgContainer [2018-02-04 02:17:07,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:17:07,226 INFO L168 Benchmark]: Toolchain (without parser) took 7593.19 ms. Allocated memory was 404.8 MB in the beginning and 826.3 MB in the end (delta: 421.5 MB). Free memory was 361.6 MB in the beginning and 463.4 MB in the end (delta: -101.7 MB). Peak memory consumption was 319.8 MB. Max. memory is 5.3 GB. [2018-02-04 02:17:07,226 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:17:07,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.03 ms. Allocated memory is still 404.8 MB. Free memory was 361.6 MB in the beginning and 350.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 5.3 GB. [2018-02-04 02:17:07,227 INFO L168 Benchmark]: Boogie Preprocessor took 30.73 ms. Allocated memory is still 404.8 MB. Free memory was 350.8 MB in the beginning and 349.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 02:17:07,227 INFO L168 Benchmark]: RCFGBuilder took 222.20 ms. Allocated memory is still 404.8 MB. Free memory was 349.5 MB in the beginning and 327.4 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. [2018-02-04 02:17:07,227 INFO L168 Benchmark]: TraceAbstraction took 7190.25 ms. Allocated memory was 404.8 MB in the beginning and 826.3 MB in the end (delta: 421.5 MB). Free memory was 327.4 MB in the beginning and 463.4 MB in the end (delta: -135.9 MB). Peak memory consumption was 285.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:17:07,228 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.16 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 147.03 ms. Allocated memory is still 404.8 MB. Free memory was 361.6 MB in the beginning and 350.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.73 ms. Allocated memory is still 404.8 MB. Free memory was 350.8 MB in the beginning and 349.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 222.20 ms. Allocated memory is still 404.8 MB. Free memory was 349.5 MB in the beginning and 327.4 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7190.25 ms. Allocated memory was 404.8 MB in the beginning and 826.3 MB in the end (delta: 421.5 MB). Free memory was 327.4 MB in the beginning and 463.4 MB in the end (delta: -135.9 MB). Peak memory consumption was 285.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 746]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 23 error locations. SAFE Result, 7.1s OverallTime, 16 OverallIterations, 10 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 525 SDtfs, 311 SDslu, 1137 SDs, 0 SdLazy, 1605 SolverSat, 209 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 34 SyntacticMatches, 11 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 73/283 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 446 ConstructedInterpolants, 0 QuantifiedInterpolants, 137441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 73/283 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-17-07-232.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_02-17-07-232.csv Received shutdown request...