java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf -i ../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:58:30,628 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:58:30,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:58:30,641 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:58:30,641 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:58:30,642 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:58:30,642 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:58:30,644 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:58:30,645 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:58:30,646 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:58:30,646 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:58:30,647 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:58:30,647 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:58:30,648 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:58:30,649 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:58:30,650 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:58:30,652 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:58:30,653 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:58:30,654 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:58:30,655 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:58:30,657 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:58:30,657 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:58:30,657 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:58:30,658 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:58:30,658 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:58:30,659 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:58:30,659 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:58:30,660 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:58:30,660 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:58:30,660 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:58:30,660 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:58:30,661 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-02 10:58:30,669 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:58:30,670 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:58:30,670 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:58:30,671 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:58:30,671 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:58:30,671 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:58:30,671 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:58:30,671 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:58:30,671 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:58:30,671 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:58:30,671 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:58:30,671 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:58:30,671 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:58:30,672 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:58:30,672 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:58:30,672 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:58:30,672 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:58:30,672 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:58:30,672 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:58:30,672 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:58:30,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:58:30,672 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:58:30,673 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-02 10:58:30,673 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-02 10:58:30,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:30,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:58:30,706 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:58:30,708 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:58:30,709 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:58:30,710 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:58:30,710 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-02 10:58:30,827 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:58:30,827 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:58:30,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:58:30,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:58:30,832 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:58:30,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:58:30" (1/1) ... [2018-02-02 10:58:30,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1801275f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:58:30, skipping insertion in model container [2018-02-02 10:58:30,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:58:30" (1/1) ... [2018-02-02 10:58:30,843 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:58:30,870 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:58:30,951 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:58:30,963 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:58:30,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:58:30 WrapperNode [2018-02-02 10:58:30,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:58:30,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:58:30,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:58:30,973 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:58:30,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:58:30" (1/1) ... [2018-02-02 10:58:30,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:58:30" (1/1) ... [2018-02-02 10:58:30,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:58:30" (1/1) ... [2018-02-02 10:58:30,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:58:30" (1/1) ... [2018-02-02 10:58:30,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:58:30" (1/1) ... [2018-02-02 10:58:30,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:58:30" (1/1) ... [2018-02-02 10:58:31,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:58:30" (1/1) ... [2018-02-02 10:58:31,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:58:31,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:58:31,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:58:31,003 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:58:31,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:58:30" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:58:31,040 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:58:31,040 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:58:31,040 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 10:58:31,040 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:58:31,040 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:58:31,040 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:58:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:58:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:58:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:58:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:58:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:58:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-02-02 10:58:31,041 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-02-02 10:58:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:58:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:58:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-02-02 10:58:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 10:58:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:58:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:58:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:58:31,132 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 10:58:31,204 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:58:31,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:58:31 BoogieIcfgContainer [2018-02-02 10:58:31,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:58:31,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:58:31,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:58:31,207 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:58:31,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:58:30" (1/3) ... [2018-02-02 10:58:31,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50537309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:58:31, skipping insertion in model container [2018-02-02 10:58:31,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:58:30" (2/3) ... [2018-02-02 10:58:31,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50537309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:58:31, skipping insertion in model container [2018-02-02 10:58:31,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:58:31" (3/3) ... [2018-02-02 10:58:31,209 INFO L107 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-02-02 10:58:31,215 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:58:31,219 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 10:58:31,247 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:58:31,247 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:58:31,248 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-02 10:58:31,248 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:58:31,248 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:58:31,248 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:58:31,248 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:58:31,248 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:58:31,248 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:58:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-02-02 10:58:31,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 10:58:31,262 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:31,263 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 10:58:31,263 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-02 10:58:31,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2931467, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:31,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:31,336 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:58:31,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:58:31,337 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:58:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:31,338 INFO L182 omatonBuilderFactory]: Interpolants [64#false, 65#(= 1 (select |#valid| |~#a.base|)), 63#true] [2018-02-02 10:58:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:31,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:58:31,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:58:31,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:58:31,347 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-02-02 10:58:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:58:31,451 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-02 10:58:31,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:58:31,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 10:58:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:58:31,459 INFO L225 Difference]: With dead ends: 60 [2018-02-02 10:58:31,459 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 10:58:31,461 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-02 10:58:31,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 10:58:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 10:58:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 10:58:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-02-02 10:58:31,485 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2018-02-02 10:58:31,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:58:31,485 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-02-02 10:58:31,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:58:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-02-02 10:58:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 10:58:31,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:31,485 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 10:58:31,486 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-02 10:58:31,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2931468, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:31,491 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:31,497 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-02 10:58:31,500 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,500 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,501 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,501 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,522 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |c_#length| %1 4)) :qid itp)) :qid itp)) is different from true [2018-02-02 10:58:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:31,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:58:31,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:58:31,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:58:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:31,580 INFO L182 omatonBuilderFactory]: Interpolants [183#true, 184#false, 185#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 186#(and (= 4 (select |#length| |~#a.base|)) (<= 0 |~#a.offset|) (<= (+ |~#a.offset| 1) (select |#length| |~#a.base|)))] [2018-02-02 10:58:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:31,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:58:31,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:58:31,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-02 10:58:31,582 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 4 states. [2018-02-02 10:58:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:58:31,629 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-02-02 10:58:31,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:58:31,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-02-02 10:58:31,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:58:31,630 INFO L225 Difference]: With dead ends: 56 [2018-02-02 10:58:31,630 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 10:58:31,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-02 10:58:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 10:58:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 10:58:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 10:58:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-02-02 10:58:31,635 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 4 [2018-02-02 10:58:31,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:58:31,635 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-02-02 10:58:31,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:58:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-02-02 10:58:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-02-02 10:58:31,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:31,636 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-02-02 10:58:31,636 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-02 10:58:31,636 INFO L82 PathProgramCache]: Analyzing trace with hash 90875495, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:31,639 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:31,655 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-02 10:58:31,657 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,657 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,657 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,658 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,725 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |c_#length| %1 4)) :qid itp)) :qid itp)) is different from true [2018-02-02 10:58:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:31,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:58:31,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:58:31,769 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:58:31,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:31,769 INFO L182 omatonBuilderFactory]: Interpolants [299#true, 300#false, 301#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 302#(and (= 4 (select |#length| |~#a.base|)) (<= (+ |~#a.offset| 2) (select |#length| |~#a.base|)) (<= 0 (+ |~#a.offset| 1)))] [2018-02-02 10:58:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:31,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:58:31,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:58:31,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-02 10:58:31,770 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 4 states. [2018-02-02 10:58:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:58:31,805 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-02-02 10:58:31,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:58:31,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-02-02 10:58:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:58:31,807 INFO L225 Difference]: With dead ends: 55 [2018-02-02 10:58:31,807 INFO L226 Difference]: Without dead ends: 55 [2018-02-02 10:58:31,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-02 10:58:31,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-02 10:58:31,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-02 10:58:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 10:58:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-02-02 10:58:31,811 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 5 [2018-02-02 10:58:31,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:58:31,811 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-02-02 10:58:31,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:58:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-02-02 10:58:31,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-02-02 10:58:31,812 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:31,812 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-02-02 10:58:31,812 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-02 10:58:31,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1477826961, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:31,816 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:31,832 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-02 10:58:31,833 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,833 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,834 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,834 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,838 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |c_#length| %1 4)) :qid itp)) :qid itp)) is different from true [2018-02-02 10:58:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:31,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:58:31,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:58:31,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:58:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:31,892 INFO L182 omatonBuilderFactory]: Interpolants [416#(and (= 4 (select |#length| |~#a.base|)) (<= (+ |~#a.offset| 3) (select |#length| |~#a.base|)) (<= 0 (+ |~#a.offset| 2))), 413#true, 414#false, 415#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp))] [2018-02-02 10:58:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:31,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:58:31,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:58:31,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-02 10:58:31,893 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 4 states. [2018-02-02 10:58:31,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:58:31,932 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-02-02 10:58:31,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:58:31,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-02-02 10:58:31,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:58:31,933 INFO L225 Difference]: With dead ends: 54 [2018-02-02 10:58:31,933 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 10:58:31,933 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-02 10:58:31,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 10:58:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 10:58:31,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 10:58:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-02-02 10:58:31,936 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 6 [2018-02-02 10:58:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:58:31,936 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-02-02 10:58:31,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:58:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-02-02 10:58:31,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:58:31,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:31,936 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:58:31,937 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-02 10:58:31,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1432004458, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:31,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:31,951 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-02 10:58:31,952 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,952 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,953 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,953 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:31,962 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |c_#length| %1 4)) :qid itp)) :qid itp)) is different from true [2018-02-02 10:58:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:32,006 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:58:32,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:58:32,006 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:58:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:32,007 INFO L182 omatonBuilderFactory]: Interpolants [528#(and (= 4 (select |#length| |~#a.base|)) (<= 0 (+ |~#a.offset| 3)) (<= (+ |~#a.offset| 4) (select |#length| |~#a.base|))), 525#true, 526#false, 527#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp))] [2018-02-02 10:58:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:32,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:58:32,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:58:32,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-02 10:58:32,008 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 4 states. [2018-02-02 10:58:32,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:58:32,047 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-02 10:58:32,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:58:32,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-02-02 10:58:32,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:58:32,048 INFO L225 Difference]: With dead ends: 53 [2018-02-02 10:58:32,049 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 10:58:32,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-02 10:58:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 10:58:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 10:58:32,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 10:58:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-02-02 10:58:32,052 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 7 [2018-02-02 10:58:32,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:58:32,053 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-02-02 10:58:32,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:58:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-02-02 10:58:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:58:32,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:32,054 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:58:32,054 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-02 10:58:32,054 INFO L82 PathProgramCache]: Analyzing trace with hash -240006955, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:32,061 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:32,071 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-02 10:58:32,072 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:32,072 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:32,072 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:32,072 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:32,077 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |c_#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)) is different from true [2018-02-02 10:58:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:32,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:58:32,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:58:32,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:58:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:32,118 INFO L182 omatonBuilderFactory]: Interpolants [645#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)), 646#(= 1 (select |#valid| |foo_~#p~0.base|)), 647#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 635#true, 636#false] [2018-02-02 10:58:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:32,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:58:32,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:58:32,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-02-02 10:58:32,118 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 5 states. [2018-02-02 10:58:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:58:32,224 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-02-02 10:58:32,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:58:32,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:58:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:58:32,227 INFO L225 Difference]: With dead ends: 57 [2018-02-02 10:58:32,227 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 10:58:32,228 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=12, Unknown=2, NotChecked=6, Total=30 [2018-02-02 10:58:32,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 10:58:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-02-02 10:58:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 10:58:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-02 10:58:32,231 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 14 [2018-02-02 10:58:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:58:32,231 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-02 10:58:32,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:58:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-02 10:58:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:58:32,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:32,232 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:58:32,232 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-02 10:58:32,232 INFO L82 PathProgramCache]: Analyzing trace with hash -240006954, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:32,237 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:32,252 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-02 10:58:32,255 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:32,255 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:32,255 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:32,255 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:32,255 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:32,256 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:32,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-02-02 10:58:32,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:32,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 10:58:32,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:9 [2018-02-02 10:58:32,271 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (exists ((%2 (Array Int Int))) (! (and (= (store |c_#valid| %1 1) (store %0 %1 1)) (= (store %2 %1 4) (store |c_#length| %1 4))) :qid itp)) :qid itp)) :qid itp)) is different from true [2018-02-02 10:58:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:32,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:58:32,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:58:32,339 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:58:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:32,339 INFO L182 omatonBuilderFactory]: Interpolants [768#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (exists ((%2 (Array Int Int))) (! (and (= (store |#valid| %1 1) (store %0 %1 1)) (= (store %2 %1 4) (store |#length| %1 4))) :qid itp)) :qid itp)) :qid itp)), 769#(and (= 4 (select |#length| |foo_~#p~0.base|)) (= 1 (select |#valid| |foo_~#p~0.base|)) (= 0 |foo_~#p~0.offset|)), 770#(and (= 4 (select |#length| |foo_~#p~0.base|)) (<= (+ |foo_~#p~0.offset| 4) (select |#length| |foo_~#p~0.base|)) (<= 0 |foo_~#p~0.offset|)), 771#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 758#true, 759#false] [2018-02-02 10:58:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:32,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:58:32,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:58:32,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-02-02 10:58:32,340 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 6 states. [2018-02-02 10:58:32,361 WARN L1011 $PredicateComparison]: unable to prove that (and (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (exists ((%2 (Array Int Int))) (! (and (= (store |c_#valid| %1 1) (store %0 %1 1)) (= (store %2 %1 4) (store |c_#length| %1 4))) :qid itp)) :qid itp)) :qid itp)) (= |c_~#a.base| |c_old(~#a.base)|) (= |c_~#a.offset| |c_old(~#a.offset)|) (= |c_#valid| |c_old(#valid)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_#memory_int| |c_old(#memory_int)|) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_old(#length)| |c_#length|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2018-02-02 10:58:32,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:58:32,443 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-02 10:58:32,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:58:32,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-02 10:58:32,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:58:32,455 INFO L225 Difference]: With dead ends: 55 [2018-02-02 10:58:32,455 INFO L226 Difference]: Without dead ends: 55 [2018-02-02 10:58:32,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2018-02-02 10:58:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-02 10:58:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-02-02 10:58:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 10:58:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-02-02 10:58:32,458 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 14 [2018-02-02 10:58:32,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:58:32,458 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-02-02 10:58:32,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:58:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-02-02 10:58:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:58:32,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:32,458 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:58:32,458 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-02 10:58:32,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1149718964, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:32,463 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:32,484 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-02 10:58:32,534 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:32,534 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:32,534 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:32,535 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:38,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:58:38,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:58:38,699 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:58:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:38,699 INFO L182 omatonBuilderFactory]: Interpolants [888#(and (<= 4 (select |#length| |~#a.base|)) (= 1 (select |#valid| |~#a.base|)) (= 0 |~#a.offset|)), 889#(and (= |~#a.offset| 0) (= 1 (select |#valid| |~#a.base|)) (forall ((%0 Int)) (or (= |~#a.base| %0) (<= 4 (select (store |#length| %0 4) |~#a.base|))))), 890#(and (<= 4 (select |#length| |~#a.base|)) (= 0 |~#a.offset|)), 891#(and (<= 0 |~#a.offset|) (<= (+ |~#a.offset| 4) (select |#length| |~#a.base|))), 892#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 893#(= 0 |~#a.offset|), 878#true, 894#(and (= 1 (select |#valid| |~#a.base|)) (= 0 |~#a.offset|)), 879#false] [2018-02-02 10:58:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:38,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:58:38,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:58:38,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=44, Unknown=3, NotChecked=0, Total=72 [2018-02-02 10:58:38,700 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 9 states. [2018-02-02 10:58:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:58:38,844 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-02-02 10:58:38,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:58:38,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-02-02 10:58:38,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:58:38,845 INFO L225 Difference]: With dead ends: 53 [2018-02-02 10:58:38,845 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 10:58:38,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=41, Invalid=66, Unknown=3, NotChecked=0, Total=110 [2018-02-02 10:58:38,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 10:58:38,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2018-02-02 10:58:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 10:58:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-02-02 10:58:38,849 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 15 [2018-02-02 10:58:38,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:58:38,849 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-02-02 10:58:38,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:58:38,849 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-02-02 10:58:38,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:58:38,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:38,850 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:58:38,850 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-02 10:58:38,850 INFO L82 PathProgramCache]: Analyzing trace with hash 536104684, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:38,855 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:38,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:58:38,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:58:38,975 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:58:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:38,975 INFO L182 omatonBuilderFactory]: Interpolants [1024#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1030#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 999#true, 1031#(= 0 |#Ultimate.C_memcpy_#t~loopctr5|), 1000#false, 1032#(<= |#Ultimate.C_memcpy_size| 0), 1023#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 10:58:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:38,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:58:38,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:58:38,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:58:38,976 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 7 states. [2018-02-02 10:58:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:58:39,074 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-02 10:58:39,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:58:39,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 10:58:39,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:58:39,075 INFO L225 Difference]: With dead ends: 53 [2018-02-02 10:58:39,076 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 10:58:39,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:58:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 10:58:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 10:58:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 10:58:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-02-02 10:58:39,079 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 27 [2018-02-02 10:58:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:58:39,079 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-02-02 10:58:39,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:58:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-02-02 10:58:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:58:39,080 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:39,080 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:58:39,080 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-02 10:58:39,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1523422323, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:39,083 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:39,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:58:39,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:58:39,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:58:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:39,185 INFO L182 omatonBuilderFactory]: Interpolants [1139#true, 1140#false, 1172#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1173#(= 0 |#Ultimate.C_memcpy_#t~loopctr5|), 1174#(or (and (< 1 |#Ultimate.C_memcpy_size|) (< |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_size|)) (and (<= |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_#t~loopctr5|) (<= |#Ultimate.C_memcpy_size| 1))), 1175#(<= |#Ultimate.C_memcpy_size| 1), 1164#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1165#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 10:58:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:39,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:58:39,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:58:39,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:58:39,186 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 8 states. [2018-02-02 10:58:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:58:39,258 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-02-02 10:58:39,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:58:39,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-02 10:58:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:58:39,259 INFO L225 Difference]: With dead ends: 55 [2018-02-02 10:58:39,259 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 10:58:39,259 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:58:39,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 10:58:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 10:58:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 10:58:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-02 10:58:39,262 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 28 [2018-02-02 10:58:39,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:58:39,262 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-02 10:58:39,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:58:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-02 10:58:39,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:58:39,263 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:39,263 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:58:39,263 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-02 10:58:39,264 INFO L82 PathProgramCache]: Analyzing trace with hash -944250100, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:39,267 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:39,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:58:39,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:58:39,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:58:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:39,358 INFO L182 omatonBuilderFactory]: Interpolants [1312#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1313#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1286#true, 1287#false, 1321#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1322#(= 0 |#Ultimate.C_memcpy_#t~loopctr5|), 1323#(= 1 |#Ultimate.C_memcpy_#t~loopctr5|), 1324#(or (and (< 2 |#Ultimate.C_memcpy_size|) (< |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_size|)) (and (<= |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_#t~loopctr5|) (<= |#Ultimate.C_memcpy_size| 2))), 1325#(<= |#Ultimate.C_memcpy_size| 2)] [2018-02-02 10:58:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:39,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:58:39,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:58:39,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:58:39,359 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 9 states. [2018-02-02 10:58:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:58:39,439 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-02-02 10:58:39,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:58:39,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-02 10:58:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:58:39,440 INFO L225 Difference]: With dead ends: 57 [2018-02-02 10:58:39,440 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 10:58:39,440 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:58:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 10:58:39,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 10:58:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 10:58:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-02-02 10:58:39,442 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 29 [2018-02-02 10:58:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:58:39,442 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-02-02 10:58:39,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:58:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-02-02 10:58:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:58:39,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:39,443 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:58:39,443 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-02 10:58:39,443 INFO L82 PathProgramCache]: Analyzing trace with hash -169780371, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:39,446 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:39,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:58:39,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:58:39,543 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:58:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:39,543 INFO L182 omatonBuilderFactory]: Interpolants [1440#true, 1441#false, 1477#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1478#(= 0 |#Ultimate.C_memcpy_#t~loopctr5|), 1479#(= 1 |#Ultimate.C_memcpy_#t~loopctr5|), 1480#(= 2 |#Ultimate.C_memcpy_#t~loopctr5|), 1481#(or (and (< 3 |#Ultimate.C_memcpy_size|) (< |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_size|)) (and (<= |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_#t~loopctr5|) (<= |#Ultimate.C_memcpy_size| 3))), 1482#(<= |#Ultimate.C_memcpy_size| 3), 1467#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1468#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 10:58:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:39,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:58:39,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:58:39,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:58:39,544 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 10 states. [2018-02-02 10:58:39,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:58:39,651 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-02-02 10:58:39,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:58:39,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-02-02 10:58:39,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:58:39,651 INFO L225 Difference]: With dead ends: 59 [2018-02-02 10:58:39,652 INFO L226 Difference]: Without dead ends: 55 [2018-02-02 10:58:39,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:58:39,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-02 10:58:39,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-02 10:58:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 10:58:39,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-02-02 10:58:39,654 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 30 [2018-02-02 10:58:39,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:58:39,655 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-02-02 10:58:39,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:58:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-02-02 10:58:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:58:39,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:39,655 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:58:39,656 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-02 10:58:39,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1931022548, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:39,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:58:39,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:58:39,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:58:39,733 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:58:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:39,734 INFO L182 omatonBuilderFactory]: Interpolants [1601#true, 1602#false, 1641#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1629#(= 1 (select |#valid| |main_~#p~1.base|)), 1630#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1631#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 10:58:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:58:39,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:58:39,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:58:39,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:58:39,734 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 6 states. [2018-02-02 10:58:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:58:39,768 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-02 10:58:39,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:58:39,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-02 10:58:39,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:58:39,768 INFO L225 Difference]: With dead ends: 53 [2018-02-02 10:58:39,768 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 10:58:39,768 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:58:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 10:58:39,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 10:58:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 10:58:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-02-02 10:58:39,770 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 31 [2018-02-02 10:58:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:58:39,771 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-02-02 10:58:39,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:58:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-02-02 10:58:39,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:58:39,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:39,771 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:58:39,771 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-02 10:58:39,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1931022547, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:39,774 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:58:39,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:58:39,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:58:39,894 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:58:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:39,895 INFO L182 omatonBuilderFactory]: Interpolants [1792#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1793#(= 1 (select |#valid| |#Ultimate.C_memcpy_dest.base|)), 1778#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1794#(or (= (select |#valid| |#Ultimate.C_memcpy_dest.base|) 1) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|)), 1779#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1748#true, 1780#(= 0 (select |old(#valid)| |foo_~#p~0.base|)), 1749#false, 1758#(= 1 (select |#valid| |~#a.base|)), 1790#(or (= (select |old(#valid)| |~#a.base|) 0) (= (select (store |#valid| |foo_~#p~0.base| 0) |~#a.base|) 1)), 1759#(not (= 0 (select |#valid| |~#a.base|))), 1791#(or (= (select |#valid| |~#a.base|) 1) (= (select |old(#valid)| |~#a.base|) 0))] [2018-02-02 10:58:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:58:39,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:58:39,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:58:39,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:58:39,895 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2018-02-02 10:58:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:58:40,029 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-02-02 10:58:40,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:58:40,029 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-02-02 10:58:40,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:58:40,030 INFO L225 Difference]: With dead ends: 52 [2018-02-02 10:58:40,030 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 10:58:40,030 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:58:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 10:58:40,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 10:58:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 10:58:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-02-02 10:58:40,032 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 31 [2018-02-02 10:58:40,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:58:40,032 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-02-02 10:58:40,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:58:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-02-02 10:58:40,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:58:40,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:40,033 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:58:40,033 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-02 10:58:40,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1931022546, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:40,038 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:58:40,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:58:40,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:58:40,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:58:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:58:40,102 INFO L182 omatonBuilderFactory]: Interpolants [1953#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1941#(and (= 4 (select |#length| |main_~#p~1.base|)) (<= 0 |main_~#p~1.offset|) (<= (+ |main_~#p~1.offset| 4) (select |#length| |main_~#p~1.base|))), 1942#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1943#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1913#true, 1914#false] [2018-02-02 10:58:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:58:40,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:58:40,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:58:40,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:58:40,103 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 6 states. [2018-02-02 10:58:40,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:58:40,132 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-02-02 10:58:40,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:58:40,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-02 10:58:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:58:40,132 INFO L225 Difference]: With dead ends: 50 [2018-02-02 10:58:40,132 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 10:58:40,133 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:58:40,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 10:58:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 10:58:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 10:58:40,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-02-02 10:58:40,134 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 31 [2018-02-02 10:58:40,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:58:40,134 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-02-02 10:58:40,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:58:40,134 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-02-02 10:58:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:58:40,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:58:40,135 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-02 10:58:40,135 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-02 10:58:40,135 INFO L82 PathProgramCache]: Analyzing trace with hash 747384917, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:58:40,140 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:58:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:40,165 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-02 10:58:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:40,213 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-02 10:58:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:58:40,293 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier [2018-02-02 10:58:40,349 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:40,349 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:40,350 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:40,350 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:40,350 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:40,350 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:40,360 WARN L1011 $PredicateComparison]: unable to prove that (forall ((%0 Int)) (! (exists ((%2 Int) (%1 (Array Int Int)) (%3 (Array Int (Array Int Int)))) (! (forall ((%4 Int)) (! (or (not (= |c_#Ultimate.C_memcpy_src.offset| 0)) (not (= |c_#Ultimate.C_memcpy_dest.offset| 0)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_#Ultimate.C_memcpy_src.base|) 1))) (and (= .cse0 (select (select |c_#memory_$Pointer$.offset| |c_#Ultimate.C_memcpy_dest.base|) 1)) (= (select (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memcpy_src.base|) |c_#Ultimate.C_memcpy_src.offset|))) %0) %1) (= %1 (select |c_#memory_$Pointer$.offset| %0)) (let ((.cse1 (store %1 1 %2))) (= (store |c_#memory_$Pointer$.offset| %4 .cse1) (store %3 %4 .cse1))) (= .cse0 %2)))) :qid itp)) :qid itp)) :qid itp)) is different from false [2018-02-02 10:58:40,362 WARN L1033 $PredicateComparison]: unable to prove that (forall ((%0 Int)) (! (exists ((%2 Int) (%1 (Array Int Int)) (%3 (Array Int (Array Int Int)))) (! (forall ((%4 Int)) (! (or (not (= |c_#Ultimate.C_memcpy_src.offset| 0)) (not (= |c_#Ultimate.C_memcpy_dest.offset| 0)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_#Ultimate.C_memcpy_src.base|) 1))) (and (= .cse0 (select (select |c_#memory_$Pointer$.offset| |c_#Ultimate.C_memcpy_dest.base|) 1)) (= (select (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memcpy_src.base|) |c_#Ultimate.C_memcpy_src.offset|))) %0) %1) (= %1 (select |c_#memory_$Pointer$.offset| %0)) (let ((.cse1 (store %1 1 %2))) (= (store |c_#memory_$Pointer$.offset| %4 .cse1) (store %3 %4 .cse1))) (= .cse0 %2)))) :qid itp)) :qid itp)) :qid itp)) is different from true [2018-02-02 10:58:40,363 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:40,363 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:40,363 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:40,371 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:40,372 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:40,372 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:40,373 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:40,373 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:40,373 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:40,373 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:58:42,830 WARN L146 SmtUtils]: Spent 2376ms on a formula simplification. DAG size of input: 594 DAG size of output 153 [2018-02-02 10:58:42,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 165 [2018-02-02 10:58:42,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:42,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 192 [2018-02-02 10:58:42,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:43,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-02-02 10:58:43,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:43,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 148 [2018-02-02 10:58:43,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:44,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 138 [2018-02-02 10:58:44,157 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:44,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 165 [2018-02-02 10:58:44,161 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:44,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 165 [2018-02-02 10:58:44,496 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:44,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 151 [2018-02-02 10:58:44,823 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:45,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 124 [2018-02-02 10:58:45,129 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:45,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 97 [2018-02-02 10:58:45,382 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:45,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 121 [2018-02-02 10:58:45,567 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:45,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 94 [2018-02-02 10:58:45,740 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:45,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 138 [2018-02-02 10:58:45,908 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:46,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 111 [2018-02-02 10:58:46,057 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:46,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 138 [2018-02-02 10:58:46,193 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:46,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 111 [2018-02-02 10:58:46,278 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:46,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 111 [2018-02-02 10:58:46,280 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-02 10:58:46,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 14 dim-2 vars, End of recursive call: 19 dim-0 vars, and 9 xjuncts. [2018-02-02 10:58:46,356 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 93 variables, input treesize:4587, output treesize:435 [2018-02-02 10:58:46,357 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-02 10:58:46,599 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 769 Received shutdown request... [2018-02-02 10:59:44,721 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:59:44,724 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:59:44,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:59:44 BoogieIcfgContainer [2018-02-02 10:59:44,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:59:44,725 INFO L168 Benchmark]: Toolchain (without parser) took 73898.33 ms. Allocated memory was 399.5 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 356.4 MB in the beginning and 1.0 GB in the end (delta: -689.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-02-02 10:59:44,726 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:59:44,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.41 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 345.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:59:44,727 INFO L168 Benchmark]: Boogie Preprocessor took 29.60 ms. Allocated memory is still 399.5 MB. Free memory was 345.6 MB in the beginning and 344.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:59:44,727 INFO L168 Benchmark]: RCFGBuilder took 202.15 ms. Allocated memory is still 399.5 MB. Free memory was 344.2 MB in the beginning and 322.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:59:44,728 INFO L168 Benchmark]: TraceAbstraction took 73519.77 ms. Allocated memory was 399.5 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 320.9 MB in the beginning and 1.0 GB in the end (delta: -724.7 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-02-02 10:59:44,730 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.10 ms. Allocated memory is still 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 144.41 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 345.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.60 ms. Allocated memory is still 399.5 MB. Free memory was 345.6 MB in the beginning and 344.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 202.15 ms. Allocated memory is still 399.5 MB. Free memory was 344.2 MB in the beginning and 322.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 73519.77 ms. Allocated memory was 399.5 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 320.9 MB in the beginning and 1.0 GB in the end (delta: -724.7 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 746]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 746). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 23 error locations. TIMEOUT Result, 73.4s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 529 SDtfs, 220 SDslu, 911 SDs, 0 SdLazy, 958 SolverSat, 143 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 30/40 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, 15 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 261 ConstructedInterpolants, 11 QuantifiedInterpolants, 28089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 30/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-59-44-738.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_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-59-44-738.csv Completed graceful shutdown