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/ldv-memsafety/memset_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 11:03:09,624 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 11:03:09,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 11:03:09,637 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 11:03:09,637 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 11:03:09,638 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 11:03:09,639 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 11:03:09,640 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 11:03:09,642 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 11:03:09,642 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 11:03:09,643 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 11:03:09,643 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 11:03:09,644 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 11:03:09,645 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 11:03:09,646 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 11:03:09,647 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 11:03:09,649 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 11:03:09,650 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 11:03:09,651 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 11:03:09,652 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 11:03:09,654 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 11:03:09,654 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 11:03:09,654 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 11:03:09,655 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 11:03:09,656 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 11:03:09,657 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 11:03:09,657 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 11:03:09,658 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 11:03:09,658 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 11:03:09,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 11:03:09,658 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 11:03:09,658 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 11:03:09,667 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 11:03:09,667 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 11:03:09,668 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 11:03:09,668 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 11:03:09,669 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 11:03:09,669 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 11:03:09,669 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 11:03:09,669 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 11:03:09,669 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 11:03:09,669 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 11:03:09,670 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 11:03:09,670 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 11:03:09,670 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 11:03:09,670 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 11:03:09,670 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 11:03:09,670 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 11:03:09,670 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 11:03:09,671 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 11:03:09,671 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 11:03:09,671 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 11:03:09,671 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 11:03:09,671 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 11:03:09,671 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-02 11:03:09,672 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-02 11:03:09,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:09,697 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 11:03:09,705 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 11:03:09,707 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 11:03:09,708 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 11:03:09,708 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 11:03:09,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memset_true-valid-memsafety_true-termination.c [2018-02-02 11:03:09,799 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 11:03:09,800 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 11:03:09,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 11:03:09,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 11:03:09,807 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 11:03:09,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 11:03:09" (1/1) ... [2018-02-02 11:03:09,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@110124be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:03:09, skipping insertion in model container [2018-02-02 11:03:09,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 11:03:09" (1/1) ... [2018-02-02 11:03:09,823 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 11:03:09,837 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 11:03:09,932 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 11:03:09,941 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 11:03:09,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:03:09 WrapperNode [2018-02-02 11:03:09,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 11:03:09,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 11:03:09,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 11:03:09,947 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 11:03:09,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:03:09" (1/1) ... [2018-02-02 11:03:09,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:03:09" (1/1) ... [2018-02-02 11:03:09,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:03:09" (1/1) ... [2018-02-02 11:03:09,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:03:09" (1/1) ... [2018-02-02 11:03:09,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:03:09" (1/1) ... [2018-02-02 11:03:09,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:03:09" (1/1) ... [2018-02-02 11:03:09,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:03:09" (1/1) ... [2018-02-02 11:03:09,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 11:03:09,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 11:03:09,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 11:03:09,972 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 11:03:09,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:03:09" (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 11:03:10,007 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 11:03:10,008 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 11:03:10,008 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 11:03:10,008 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 11:03:10,008 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 11:03:10,008 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 11:03:10,008 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 11:03:10,008 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 11:03:10,008 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 11:03:10,008 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 11:03:10,008 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 11:03:10,009 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 11:03:10,062 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 11:03:10,094 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 11:03:10,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 11:03:10 BoogieIcfgContainer [2018-02-02 11:03:10,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 11:03:10,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 11:03:10,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 11:03:10,097 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 11:03:10,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 11:03:09" (1/3) ... [2018-02-02 11:03:10,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8a6521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 11:03:10, skipping insertion in model container [2018-02-02 11:03:10,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:03:09" (2/3) ... [2018-02-02 11:03:10,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8a6521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 11:03:10, skipping insertion in model container [2018-02-02 11:03:10,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 11:03:10" (3/3) ... [2018-02-02 11:03:10,099 INFO L107 eAbstractionObserver]: Analyzing ICFG memset_true-valid-memsafety_true-termination.c [2018-02-02 11:03:10,105 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 11:03:10,111 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-02 11:03:10,139 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 11:03:10,139 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 11:03:10,139 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-02 11:03:10,139 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 11:03:10,140 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 11:03:10,140 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 11:03:10,140 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 11:03:10,140 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 11:03:10,141 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 11:03:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-02-02 11:03:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 11:03:10,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:10,159 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:10,159 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:10,163 INFO L82 PathProgramCache]: Analyzing trace with hash 682221498, 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 11:03:10,173 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:10,198 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-02 11:03:10,209 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:03:10,209 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:03:10,210 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:03:10,210 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:03:10,247 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 11:03:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:10,328 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:03:10,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 11:03:10,330 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:10,330 INFO L182 omatonBuilderFactory]: Interpolants [32#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 25#true, 26#false, 30#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)), 31#(= 1 (select |#valid| |main_~#cstats~0.base|))] [2018-02-02 11:03:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:10,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 11:03:10,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 11:03:10,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-02-02 11:03:10,343 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-02-02 11:03:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:10,423 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-02-02 11:03:10,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 11:03:10,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-02-02 11:03:10,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:10,431 INFO L225 Difference]: With dead ends: 21 [2018-02-02 11:03:10,431 INFO L226 Difference]: Without dead ends: 18 [2018-02-02 11:03:10,432 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 11:03:10,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-02-02 11:03:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-02-02 11:03:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-02-02 11:03:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-02-02 11:03:10,452 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 7 [2018-02-02 11:03:10,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:10,452 INFO L432 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-02-02 11:03:10,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 11:03:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-02-02 11:03:10,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 11:03:10,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:10,453 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:10,453 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:10,453 INFO L82 PathProgramCache]: Analyzing trace with hash 682221499, 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 11:03:10,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:10,463 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-02 11:03:10,464 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:03:10,464 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:03:10,464 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:03:10,464 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:03:10,468 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |c_#length| %1 80) (store %0 %1 80)) :qid itp)) :qid itp)) is different from true [2018-02-02 11:03:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:10,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:10,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:03:10,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 11:03:10,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:10,536 INFO L182 omatonBuilderFactory]: Interpolants [80#(and (= 80 (select |#length| |main_~#cstats~0.base|)) (<= 0 |main_~#cstats~0.offset|) (<= (+ |main_~#cstats~0.offset| 80) (select |#length| |main_~#cstats~0.base|))), 81#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 74#true, 75#false, 79#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#length| %1 80) (store %0 %1 80)) :qid itp)) :qid itp))] [2018-02-02 11:03:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:10,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 11:03:10,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 11:03:10,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-02-02 11:03:10,539 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2018-02-02 11:03:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:10,589 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-02-02 11:03:10,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 11:03:10,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-02-02 11:03:10,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:10,590 INFO L225 Difference]: With dead ends: 17 [2018-02-02 11:03:10,590 INFO L226 Difference]: Without dead ends: 17 [2018-02-02 11:03:10,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=11, Unknown=3, NotChecked=6, Total=30 [2018-02-02 11:03:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-02-02 11:03:10,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-02-02 11:03:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-02-02 11:03:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-02-02 11:03:10,593 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 7 [2018-02-02 11:03:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:10,594 INFO L432 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-02-02 11:03:10,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 11:03:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-02-02 11:03:10,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 11:03:10,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:10,595 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:10,595 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:10,595 INFO L82 PathProgramCache]: Analyzing trace with hash -898824040, 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 11:03:10,599 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:10,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:03:10,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 11:03:10,660 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:10,660 INFO L182 omatonBuilderFactory]: Interpolants [128#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 129#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 130#(<= |#Ultimate.C_memset_#amount| 0), 118#true, 119#false] [2018-02-02 11:03:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:10,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 11:03:10,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 11:03:10,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 11:03:10,662 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 5 states. [2018-02-02 11:03:10,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:10,719 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-02-02 11:03:10,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 11:03:10,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-02 11:03:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:10,720 INFO L225 Difference]: With dead ends: 20 [2018-02-02 11:03:10,720 INFO L226 Difference]: Without dead ends: 18 [2018-02-02 11:03:10,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 11:03:10,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-02-02 11:03:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-02-02 11:03:10,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-02-02 11:03:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-02-02 11:03:10,722 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-02-02 11:03:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:10,723 INFO L432 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-02-02 11:03:10,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 11:03:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-02-02 11:03:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 11:03:10,723 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:10,724 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:10,724 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:10,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1616948477, 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 11:03:10,727 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:10,761 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 11:03:10,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:10,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 11:03:10,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:10,779 INFO L182 omatonBuilderFactory]: Interpolants [184#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 185#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 186#(or (and (< |#Ultimate.C_memset_#t~loopctr5| |#Ultimate.C_memset_#amount|) (< 1 |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr5|) (<= |#Ultimate.C_memset_#amount| 1))), 187#(<= |#Ultimate.C_memset_#amount| 1), 173#true, 174#false] [2018-02-02 11:03:10,779 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 11:03:10,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 11:03:10,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 11:03:10,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 11:03:10,780 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-02-02 11:03:10,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:10,869 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-02-02 11:03:10,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 11:03:10,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-02 11:03:10,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:10,870 INFO L225 Difference]: With dead ends: 21 [2018-02-02 11:03:10,870 INFO L226 Difference]: Without dead ends: 19 [2018-02-02 11:03:10,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 11:03:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-02-02 11:03:10,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-02-02 11:03:10,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-02-02 11:03:10,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-02-02 11:03:10,873 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-02-02 11:03:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:10,873 INFO L432 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-02-02 11:03:10,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 11:03:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-02-02 11:03:10,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 11:03:10,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:10,874 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:10,874 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:10,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1998482120, now seen corresponding path program 2 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 11:03:10,880 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:10,925 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 11:03:10,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:10,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 11:03:10,949 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:10,949 INFO L182 omatonBuilderFactory]: Interpolants [246#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 247#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 248#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 249#(= 2 |#Ultimate.C_memset_#t~loopctr5|), 234#true, 250#(not (= 80 |#Ultimate.C_memset_#amount|)), 235#false] [2018-02-02 11:03:10,949 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 11:03:10,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 11:03:10,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 11:03:10,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 11:03:10,950 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2018-02-02 11:03:11,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:11,032 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-02-02 11:03:11,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 11:03:11,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-02 11:03:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:11,033 INFO L225 Difference]: With dead ends: 22 [2018-02-02 11:03:11,033 INFO L226 Difference]: Without dead ends: 20 [2018-02-02 11:03:11,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-02-02 11:03:11,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-02-02 11:03:11,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-02-02 11:03:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-02-02 11:03:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-02-02 11:03:11,035 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-02-02 11:03:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:11,036 INFO L432 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-02-02 11:03:11,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 11:03:11,036 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-02-02 11:03:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 11:03:11,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:11,037 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:11,037 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:11,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1887286365, now seen corresponding path program 3 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 11:03:11,040 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,084 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 11:03:11,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:11,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 11:03:11,113 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,114 INFO L182 omatonBuilderFactory]: Interpolants [314#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 315#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 316#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 301#true, 317#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 302#false, 318#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 319#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:11,114 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 11:03:11,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 11:03:11,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 11:03:11,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 11:03:11,115 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2018-02-02 11:03:11,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:11,198 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-02-02 11:03:11,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 11:03:11,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-02 11:03:11,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:11,198 INFO L225 Difference]: With dead ends: 23 [2018-02-02 11:03:11,198 INFO L226 Difference]: Without dead ends: 21 [2018-02-02 11:03:11,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-02-02 11:03:11,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-02-02 11:03:11,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-02-02 11:03:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-02-02 11:03:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-02-02 11:03:11,200 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-02-02 11:03:11,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:11,200 INFO L432 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-02-02 11:03:11,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 11:03:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-02-02 11:03:11,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 11:03:11,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:11,201 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:11,201 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:11,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2087025112, now seen corresponding path program 4 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 11:03:11,207 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:11,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 11:03:11,263 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,263 INFO L182 omatonBuilderFactory]: Interpolants [388#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 389#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 374#true, 390#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 375#false, 391#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 392#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 393#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 394#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 11:03:11,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 11:03:11,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-02 11:03:11,264 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 9 states. [2018-02-02 11:03:11,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:11,363 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-02-02 11:03:11,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 11:03:11,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-02 11:03:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:11,363 INFO L225 Difference]: With dead ends: 24 [2018-02-02 11:03:11,363 INFO L226 Difference]: Without dead ends: 22 [2018-02-02 11:03:11,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-02 11:03:11,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-02-02 11:03:11,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-02-02 11:03:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-02-02 11:03:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-02-02 11:03:11,368 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-02-02 11:03:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:11,368 INFO L432 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-02-02 11:03:11,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 11:03:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-02-02 11:03:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 11:03:11,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:11,369 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:11,369 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:11,369 INFO L82 PathProgramCache]: Analyzing trace with hash -311008323, now seen corresponding path program 5 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 11:03:11,372 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:11,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 11:03:11,438 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,438 INFO L182 omatonBuilderFactory]: Interpolants [468#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 453#true, 469#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 454#false, 470#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 471#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 472#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 473#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 474#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 475#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 11:03:11,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 11:03:11,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-02-02 11:03:11,439 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 10 states. [2018-02-02 11:03:11,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:11,509 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-02-02 11:03:11,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 11:03:11,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-02-02 11:03:11,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:11,510 INFO L225 Difference]: With dead ends: 25 [2018-02-02 11:03:11,510 INFO L226 Difference]: Without dead ends: 23 [2018-02-02 11:03:11,510 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-02 11:03:11,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-02-02 11:03:11,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-02-02 11:03:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-02-02 11:03:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-02-02 11:03:11,512 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-02-02 11:03:11,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:11,512 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-02-02 11:03:11,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 11:03:11,512 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-02-02 11:03:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 11:03:11,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:11,512 INFO L351 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:11,512 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:11,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1635600776, now seen corresponding path program 6 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 11:03:11,515 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:11,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 11:03:11,593 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,593 INFO L182 omatonBuilderFactory]: Interpolants [560#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 561#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 562#(not (= 80 |#Ultimate.C_memset_#amount|)), 538#true, 554#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 539#false, 555#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 556#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 557#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 558#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 559#(<= |#Ultimate.C_memset_#t~loopctr5| 4)] [2018-02-02 11:03:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 11:03:11,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 11:03:11,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-02-02 11:03:11,594 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 11 states. [2018-02-02 11:03:11,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:11,673 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-02-02 11:03:11,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 11:03:11,673 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-02 11:03:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:11,674 INFO L225 Difference]: With dead ends: 26 [2018-02-02 11:03:11,674 INFO L226 Difference]: Without dead ends: 24 [2018-02-02 11:03:11,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-02-02 11:03:11,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-02 11:03:11,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-02 11:03:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-02 11:03:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-02-02 11:03:11,676 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-02-02 11:03:11,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:11,676 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-02-02 11:03:11,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 11:03:11,676 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-02-02 11:03:11,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 11:03:11,677 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:11,677 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:11,677 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:11,677 INFO L82 PathProgramCache]: Analyzing trace with hash 251706141, now seen corresponding path program 7 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 11:03:11,679 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:11,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 11:03:11,743 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,743 INFO L182 omatonBuilderFactory]: Interpolants [629#true, 630#false, 646#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 647#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 648#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 649#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 650#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 651#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 652#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 653#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 654#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 655#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 11:03:11,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 11:03:11,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-02-02 11:03:11,744 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 12 states. [2018-02-02 11:03:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:11,870 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-02-02 11:03:11,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 11:03:11,871 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-02-02 11:03:11,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:11,871 INFO L225 Difference]: With dead ends: 27 [2018-02-02 11:03:11,871 INFO L226 Difference]: Without dead ends: 25 [2018-02-02 11:03:11,872 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-02-02 11:03:11,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-02 11:03:11,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-02 11:03:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-02 11:03:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-02-02 11:03:11,874 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-02-02 11:03:11,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:11,874 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-02-02 11:03:11,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 11:03:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-02-02 11:03:11,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 11:03:11,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:11,877 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:11,877 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:11,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1371321576, now seen corresponding path program 8 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 11:03:11,881 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:11,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 11:03:11,964 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,964 INFO L182 omatonBuilderFactory]: Interpolants [744#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 745#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 746#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 747#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 748#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 749#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 750#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 751#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 752#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 753#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 754#(not (= 80 |#Ultimate.C_memset_#amount|)), 726#true, 727#false] [2018-02-02 11:03:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:11,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 11:03:11,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 11:03:11,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-02-02 11:03:11,964 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-02-02 11:03:12,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:12,051 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-02-02 11:03:12,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 11:03:12,051 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-02-02 11:03:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:12,051 INFO L225 Difference]: With dead ends: 28 [2018-02-02 11:03:12,051 INFO L226 Difference]: Without dead ends: 26 [2018-02-02 11:03:12,052 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2018-02-02 11:03:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-02 11:03:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-02 11:03:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-02 11:03:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-02-02 11:03:12,053 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-02-02 11:03:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:12,053 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-02-02 11:03:12,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 11:03:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-02-02 11:03:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 11:03:12,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:12,054 INFO L351 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:12,054 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:12,054 INFO L82 PathProgramCache]: Analyzing trace with hash -145573251, now seen corresponding path program 9 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 11:03:12,056 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:12,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:12,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 11:03:12,187 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:12,187 INFO L182 omatonBuilderFactory]: Interpolants [848#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 849#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 850#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 851#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 852#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 853#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 854#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 855#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 856#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 857#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 858#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 859#(not (= 80 |#Ultimate.C_memset_#amount|)), 829#true, 830#false] [2018-02-02 11:03:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:12,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 11:03:12,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 11:03:12,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-02-02 11:03:12,188 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2018-02-02 11:03:12,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:12,325 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-02-02 11:03:12,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 11:03:12,326 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-02-02 11:03:12,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:12,326 INFO L225 Difference]: With dead ends: 29 [2018-02-02 11:03:12,326 INFO L226 Difference]: Without dead ends: 27 [2018-02-02 11:03:12,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2018-02-02 11:03:12,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-02 11:03:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-02-02 11:03:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-02 11:03:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-02-02 11:03:12,328 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-02-02 11:03:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:12,328 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-02-02 11:03:12,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 11:03:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-02-02 11:03:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 11:03:12,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:12,329 INFO L351 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:12,329 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:12,329 INFO L82 PathProgramCache]: Analyzing trace with hash -802080840, now seen corresponding path program 10 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 11:03:12,331 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:12,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:12,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 11:03:12,410 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:12,410 INFO L182 omatonBuilderFactory]: Interpolants [960#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 961#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 962#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 963#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 964#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 965#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 966#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 967#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 968#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 969#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 938#true, 970#(not (= 80 |#Ultimate.C_memset_#amount|)), 939#false, 958#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 959#(= 0 |#Ultimate.C_memset_#t~loopctr5|)] [2018-02-02 11:03:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:12,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 11:03:12,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 11:03:12,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2018-02-02 11:03:12,411 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2018-02-02 11:03:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:12,540 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-02-02 11:03:12,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 11:03:12,541 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-02-02 11:03:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:12,541 INFO L225 Difference]: With dead ends: 30 [2018-02-02 11:03:12,541 INFO L226 Difference]: Without dead ends: 28 [2018-02-02 11:03:12,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=463, Unknown=0, NotChecked=0, Total=702 [2018-02-02 11:03:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-02 11:03:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-02 11:03:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-02 11:03:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-02-02 11:03:12,543 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-02-02 11:03:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:12,543 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-02-02 11:03:12,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 11:03:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-02-02 11:03:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 11:03:12,544 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:12,544 INFO L351 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:12,544 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash 321020381, now seen corresponding path program 11 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 11:03:12,546 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:12,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:12,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 11:03:12,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:12,666 INFO L182 omatonBuilderFactory]: Interpolants [1074#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1075#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 1076#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 1077#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 1078#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 1079#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 1080#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 1081#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 1082#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 1083#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 1084#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 1053#true, 1085#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 1054#false, 1086#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 1087#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:12,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 11:03:12,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 11:03:12,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-02-02 11:03:12,667 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 16 states. [2018-02-02 11:03:12,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:12,825 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-02-02 11:03:12,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 11:03:12,825 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-02-02 11:03:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:12,826 INFO L225 Difference]: With dead ends: 31 [2018-02-02 11:03:12,826 INFO L226 Difference]: Without dead ends: 29 [2018-02-02 11:03:12,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2018-02-02 11:03:12,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-02 11:03:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-02 11:03:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-02 11:03:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-02-02 11:03:12,829 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-02-02 11:03:12,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:12,829 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-02-02 11:03:12,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 11:03:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-02-02 11:03:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 11:03:12,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:12,830 INFO L351 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:12,830 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:12,830 INFO L82 PathProgramCache]: Analyzing trace with hash 777419864, now seen corresponding path program 12 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 11:03:12,833 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:12,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:12,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 11:03:12,940 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:12,941 INFO L182 omatonBuilderFactory]: Interpolants [1196#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1197#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 1198#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 1199#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 1200#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 1201#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 1202#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 1203#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 1204#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 1205#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 1174#true, 1206#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 1175#false, 1207#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 1208#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 1209#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 1210#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:12,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 11:03:12,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 11:03:12,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2018-02-02 11:03:12,941 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 17 states. [2018-02-02 11:03:13,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:13,084 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-02-02 11:03:13,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 11:03:13,084 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-02-02 11:03:13,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:13,085 INFO L225 Difference]: With dead ends: 32 [2018-02-02 11:03:13,085 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 11:03:13,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2018-02-02 11:03:13,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 11:03:13,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-02 11:03:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-02 11:03:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-02-02 11:03:13,087 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-02-02 11:03:13,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:13,087 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-02-02 11:03:13,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 11:03:13,087 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-02-02 11:03:13,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 11:03:13,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:13,088 INFO L351 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:13,088 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:13,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2040901949, now seen corresponding path program 13 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 11:03:13,090 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:13,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:13,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 11:03:13,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:13,186 INFO L182 omatonBuilderFactory]: Interpolants [1324#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1325#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 1326#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 1327#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 1328#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 1329#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 1330#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 1331#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 1332#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 1301#true, 1333#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 1302#false, 1334#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 1335#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 1336#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 1337#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 1338#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 1339#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:13,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 11:03:13,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 11:03:13,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2018-02-02 11:03:13,186 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 18 states. [2018-02-02 11:03:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:13,335 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-02-02 11:03:13,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 11:03:13,335 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-02-02 11:03:13,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:13,335 INFO L225 Difference]: With dead ends: 33 [2018-02-02 11:03:13,335 INFO L226 Difference]: Without dead ends: 31 [2018-02-02 11:03:13,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=365, Invalid=691, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 11:03:13,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-02 11:03:13,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-02 11:03:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 11:03:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-02-02 11:03:13,338 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-02-02 11:03:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:13,338 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-02-02 11:03:13,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 11:03:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-02-02 11:03:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 11:03:13,339 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:13,339 INFO L351 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:13,339 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:13,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1740826376, now seen corresponding path program 14 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:13,341 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:13,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:13,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 11:03:13,450 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:13,450 INFO L182 omatonBuilderFactory]: Interpolants [1472#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 1473#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 1474#(not (= 80 |#Ultimate.C_memset_#amount|)), 1458#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1459#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 1460#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 1461#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 1462#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 1463#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 1464#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 1465#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 1434#true, 1466#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 1435#false, 1467#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 1468#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 1469#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 1470#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 1471#(<= |#Ultimate.C_memset_#t~loopctr5| 12)] [2018-02-02 11:03:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:13,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 11:03:13,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 11:03:13,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=203, Unknown=0, NotChecked=0, Total=342 [2018-02-02 11:03:13,451 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 19 states. [2018-02-02 11:03:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:13,602 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-02-02 11:03:13,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 11:03:13,602 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-02-02 11:03:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:13,602 INFO L225 Difference]: With dead ends: 34 [2018-02-02 11:03:13,602 INFO L226 Difference]: Without dead ends: 32 [2018-02-02 11:03:13,603 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 11:03:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-02 11:03:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-02 11:03:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-02 11:03:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-02-02 11:03:13,604 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-02-02 11:03:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:13,604 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-02-02 11:03:13,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 11:03:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-02-02 11:03:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 11:03:13,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:13,605 INFO L351 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:13,605 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:13,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1284679837, now seen corresponding path program 15 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:13,608 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:13,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:13,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 11:03:13,715 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:13,716 INFO L182 omatonBuilderFactory]: Interpolants [1600#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 1601#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 1602#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 1603#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 1604#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 1573#true, 1605#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 1574#false, 1606#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 1607#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 1608#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 1609#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 1610#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 1611#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 1612#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 1613#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 1614#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 1615#(not (= 80 |#Ultimate.C_memset_#amount|)), 1598#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1599#(= 0 |#Ultimate.C_memset_#t~loopctr5|)] [2018-02-02 11:03:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:13,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 11:03:13,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 11:03:13,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=224, Unknown=0, NotChecked=0, Total=380 [2018-02-02 11:03:13,716 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 20 states. [2018-02-02 11:03:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:13,887 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-02-02 11:03:13,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 11:03:13,887 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-02-02 11:03:13,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:13,887 INFO L225 Difference]: With dead ends: 35 [2018-02-02 11:03:13,887 INFO L226 Difference]: Without dead ends: 33 [2018-02-02 11:03:13,888 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=464, Invalid=868, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 11:03:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-02 11:03:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-02-02 11:03:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-02 11:03:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-02-02 11:03:13,889 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-02-02 11:03:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:13,889 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-02-02 11:03:13,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 11:03:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-02-02 11:03:13,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 11:03:13,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:13,890 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:13,890 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:13,890 INFO L82 PathProgramCache]: Analyzing trace with hash 586091928, now seen corresponding path program 16 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:13,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:14,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:14,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 11:03:14,033 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:14,034 INFO L182 omatonBuilderFactory]: Interpolants [1760#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 1761#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 1762#(not (= 80 |#Ultimate.C_memset_#amount|)), 1744#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1745#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 1746#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 1747#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 1748#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 1749#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 1718#true, 1750#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 1719#false, 1751#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 1752#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 1753#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 1754#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 1755#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 1756#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 1757#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 1758#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 1759#(<= |#Ultimate.C_memset_#t~loopctr5| 14)] [2018-02-02 11:03:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:14,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 11:03:14,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 11:03:14,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-02 11:03:14,034 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 21 states. [2018-02-02 11:03:14,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:14,230 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-02-02 11:03:14,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 11:03:14,230 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-02-02 11:03:14,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:14,231 INFO L225 Difference]: With dead ends: 36 [2018-02-02 11:03:14,231 INFO L226 Difference]: Without dead ends: 34 [2018-02-02 11:03:14,231 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 11:03:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-02 11:03:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-02 11:03:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-02 11:03:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-02-02 11:03:14,237 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-02-02 11:03:14,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:14,237 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-02-02 11:03:14,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 11:03:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-02-02 11:03:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 11:03:14,237 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:14,238 INFO L351 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:14,238 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:14,238 INFO L82 PathProgramCache]: Analyzing trace with hash 404703229, now seen corresponding path program 17 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:14,241 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:14,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:14,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 11:03:14,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:14,400 INFO L182 omatonBuilderFactory]: Interpolants [1896#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1897#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 1898#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 1899#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 1900#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 1869#true, 1901#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 1870#false, 1902#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 1903#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 1904#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 1905#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 1906#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 1907#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 1908#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 1909#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 1910#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 1911#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 1912#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 1913#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 1914#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 1915#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:14,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 11:03:14,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 11:03:14,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=269, Unknown=0, NotChecked=0, Total=462 [2018-02-02 11:03:14,401 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 22 states. [2018-02-02 11:03:14,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:14,611 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-02-02 11:03:14,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 11:03:14,611 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2018-02-02 11:03:14,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:14,612 INFO L225 Difference]: With dead ends: 37 [2018-02-02 11:03:14,612 INFO L226 Difference]: Without dead ends: 35 [2018-02-02 11:03:14,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=575, Invalid=1065, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 11:03:14,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-02 11:03:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-02 11:03:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-02 11:03:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-02-02 11:03:14,614 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-02-02 11:03:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:14,614 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-02-02 11:03:14,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 11:03:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-02-02 11:03:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 11:03:14,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:14,615 INFO L351 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:14,615 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:14,615 INFO L82 PathProgramCache]: Analyzing trace with hash -923379144, now seen corresponding path program 18 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:14,618 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:14,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:14,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 11:03:14,771 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:14,772 INFO L182 omatonBuilderFactory]: Interpolants [2054#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 2055#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 2056#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 2057#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 2026#true, 2058#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 2027#false, 2059#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 2060#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 2061#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 2062#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 2063#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 2064#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 2065#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 2066#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 2067#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 2068#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 2069#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 2070#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 2071#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 2072#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 2073#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 2074#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:14,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 11:03:14,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 11:03:14,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=293, Unknown=0, NotChecked=0, Total=506 [2018-02-02 11:03:14,773 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 23 states. [2018-02-02 11:03:15,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:15,045 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-02-02 11:03:15,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 11:03:15,045 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2018-02-02 11:03:15,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:15,045 INFO L225 Difference]: With dead ends: 38 [2018-02-02 11:03:15,045 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 11:03:15,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=635, Invalid=1171, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 11:03:15,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 11:03:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-02 11:03:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 11:03:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-02-02 11:03:15,048 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-02-02 11:03:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:15,048 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-02-02 11:03:15,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 11:03:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-02-02 11:03:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 11:03:15,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:15,049 INFO L351 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:15,049 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:15,049 INFO L82 PathProgramCache]: Analyzing trace with hash 855740253, now seen corresponding path program 19 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:15,054 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:15,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:15,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 11:03:15,298 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:15,299 INFO L182 omatonBuilderFactory]: Interpolants [2218#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 2219#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 2220#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 2189#true, 2221#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 2190#false, 2222#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 2223#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 2224#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 2225#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 2226#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 2227#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 2228#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 2229#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 2230#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 2231#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 2232#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 2233#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 2234#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 2235#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 2236#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 2237#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 2238#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 2239#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:15,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 11:03:15,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 11:03:15,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=318, Unknown=0, NotChecked=0, Total=552 [2018-02-02 11:03:15,300 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 24 states. [2018-02-02 11:03:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:15,683 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-02-02 11:03:15,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 11:03:15,684 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-02-02 11:03:15,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:15,685 INFO L225 Difference]: With dead ends: 39 [2018-02-02 11:03:15,685 INFO L226 Difference]: Without dead ends: 37 [2018-02-02 11:03:15,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=698, Invalid=1282, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 11:03:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-02 11:03:15,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-02 11:03:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 11:03:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-02-02 11:03:15,688 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-02-02 11:03:15,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:15,688 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-02-02 11:03:15,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 11:03:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-02-02 11:03:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 11:03:15,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:15,689 INFO L351 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:15,689 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:15,689 INFO L82 PathProgramCache]: Analyzing trace with hash 173866712, now seen corresponding path program 20 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:15,693 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:15,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:15,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 11:03:15,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:15,877 INFO L182 omatonBuilderFactory]: Interpolants [2388#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 2389#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 2390#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 2391#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 2392#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 2393#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 2394#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 2395#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 2396#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 2397#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 2398#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 2399#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 2400#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 2401#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 2402#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 2403#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 2404#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 2405#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 2406#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 2407#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 2408#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 2409#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 2410#(not (= 80 |#Ultimate.C_memset_#amount|)), 2358#true, 2359#false] [2018-02-02 11:03:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:15,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 11:03:15,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 11:03:15,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=344, Unknown=0, NotChecked=0, Total=600 [2018-02-02 11:03:15,878 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 25 states. [2018-02-02 11:03:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:16,147 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-02-02 11:03:16,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 11:03:16,148 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 36 [2018-02-02 11:03:16,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:16,148 INFO L225 Difference]: With dead ends: 40 [2018-02-02 11:03:16,148 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 11:03:16,148 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=764, Invalid=1398, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 11:03:16,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 11:03:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-02 11:03:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 11:03:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-02-02 11:03:16,150 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-02-02 11:03:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:16,150 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-02-02 11:03:16,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 11:03:16,150 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-02-02 11:03:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 11:03:16,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:16,150 INFO L351 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:16,150 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:16,150 INFO L82 PathProgramCache]: Analyzing trace with hash 510623421, now seen corresponding path program 21 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:16,152 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:16,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:16,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 11:03:16,325 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:16,326 INFO L182 omatonBuilderFactory]: Interpolants [2564#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 2565#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 2566#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 2567#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 2568#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 2569#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 2570#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 2571#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 2572#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 2573#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 2574#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 2575#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 2576#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 2577#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 2578#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 2579#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 2580#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 2581#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 2582#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 2583#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 2584#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 2585#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 2586#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 2587#(not (= 80 |#Ultimate.C_memset_#amount|)), 2533#true, 2534#false] [2018-02-02 11:03:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:16,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 11:03:16,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 11:03:16,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=371, Unknown=0, NotChecked=0, Total=650 [2018-02-02 11:03:16,326 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 26 states. [2018-02-02 11:03:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:16,598 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-02-02 11:03:16,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 11:03:16,598 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-02-02 11:03:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:16,599 INFO L225 Difference]: With dead ends: 41 [2018-02-02 11:03:16,599 INFO L226 Difference]: Without dead ends: 39 [2018-02-02 11:03:16,599 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=833, Invalid=1519, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 11:03:16,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-02 11:03:16,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-02 11:03:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 11:03:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-02-02 11:03:16,601 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-02-02 11:03:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:16,601 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-02-02 11:03:16,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 11:03:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-02-02 11:03:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 11:03:16,602 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:16,602 INFO L351 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:16,602 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:16,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1934820488, now seen corresponding path program 22 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:16,606 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:16,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:16,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 11:03:16,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:16,784 INFO L182 omatonBuilderFactory]: Interpolants [2752#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 2753#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 2754#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 2755#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 2756#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 2757#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 2758#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 2759#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 2760#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 2761#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 2762#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 2763#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 2764#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 2765#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 2766#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 2767#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 2768#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 2769#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 2770#(not (= 80 |#Ultimate.C_memset_#amount|)), 2714#true, 2715#false, 2746#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 2747#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 2748#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 2749#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 2750#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 2751#(<= |#Ultimate.C_memset_#t~loopctr5| 4)] [2018-02-02 11:03:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:16,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 11:03:16,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 11:03:16,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=399, Unknown=0, NotChecked=0, Total=702 [2018-02-02 11:03:16,785 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 27 states. [2018-02-02 11:03:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:17,073 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-02-02 11:03:17,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 11:03:17,073 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 38 [2018-02-02 11:03:17,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:17,074 INFO L225 Difference]: With dead ends: 42 [2018-02-02 11:03:17,074 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 11:03:17,074 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=905, Invalid=1645, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 11:03:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 11:03:17,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-02 11:03:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 11:03:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-02-02 11:03:17,076 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-02-02 11:03:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:17,076 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-02-02 11:03:17,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 11:03:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-02-02 11:03:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 11:03:17,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:17,076 INFO L351 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:17,076 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:17,076 INFO L82 PathProgramCache]: Analyzing trace with hash -434170339, now seen corresponding path program 23 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:17,080 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:17,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:17,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 11:03:17,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:17,267 INFO L182 omatonBuilderFactory]: Interpolants [2944#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 2945#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 2946#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 2947#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 2948#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 2949#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 2950#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 2951#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 2952#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 2953#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 2954#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 2955#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 2956#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 2957#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 2958#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 2959#(not (= 80 |#Ultimate.C_memset_#amount|)), 2901#true, 2902#false, 2934#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 2935#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 2936#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 2937#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 2938#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 2939#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 2940#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 2941#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 2942#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 2943#(<= |#Ultimate.C_memset_#t~loopctr5| 8)] [2018-02-02 11:03:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:17,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 11:03:17,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 11:03:17,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=428, Unknown=0, NotChecked=0, Total=756 [2018-02-02 11:03:17,268 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 28 states. [2018-02-02 11:03:17,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:17,620 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-02 11:03:17,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 11:03:17,620 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2018-02-02 11:03:17,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:17,621 INFO L225 Difference]: With dead ends: 43 [2018-02-02 11:03:17,621 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 11:03:17,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=980, Invalid=1776, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 11:03:17,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 11:03:17,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-02 11:03:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 11:03:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-02-02 11:03:17,624 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-02-02 11:03:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:17,624 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-02-02 11:03:17,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 11:03:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-02-02 11:03:17,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 11:03:17,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:17,625 INFO L351 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:17,625 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:17,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1158655976, now seen corresponding path program 24 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:17,629 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:17,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:17,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 11:03:17,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:17,867 INFO L182 omatonBuilderFactory]: Interpolants [3136#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 3137#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 3138#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 3139#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 3140#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 3141#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 3142#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 3143#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 3144#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 3145#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 3146#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 3147#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 3148#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 3149#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 3150#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 3151#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 3152#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 3153#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 3154#(not (= 80 |#Ultimate.C_memset_#amount|)), 3094#true, 3095#false, 3128#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 3129#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 3130#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 3131#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 3132#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 3133#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 3134#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 3135#(<= |#Ultimate.C_memset_#t~loopctr5| 6)] [2018-02-02 11:03:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:17,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 11:03:17,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 11:03:17,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=458, Unknown=0, NotChecked=0, Total=812 [2018-02-02 11:03:17,868 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 29 states. [2018-02-02 11:03:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:18,174 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-02-02 11:03:18,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 11:03:18,174 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2018-02-02 11:03:18,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:18,174 INFO L225 Difference]: With dead ends: 44 [2018-02-02 11:03:18,174 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 11:03:18,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1058, Invalid=1912, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 11:03:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 11:03:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-02 11:03:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 11:03:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-02-02 11:03:18,177 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-02-02 11:03:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:18,177 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-02-02 11:03:18,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 11:03:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-02-02 11:03:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 11:03:18,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:18,178 INFO L351 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:18,178 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:18,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2142874243, now seen corresponding path program 25 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:18,181 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:18,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:18,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 11:03:18,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:18,391 INFO L182 omatonBuilderFactory]: Interpolants [3328#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 3329#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 3330#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 3331#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 3332#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 3333#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 3334#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 3335#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 3336#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 3337#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 3338#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 3339#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 3340#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 3341#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 3342#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 3343#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 3344#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 3345#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 3346#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 3347#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 3348#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 3349#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 3350#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 3351#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 3352#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 3353#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 3354#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 3355#(not (= 80 |#Ultimate.C_memset_#amount|)), 3293#true, 3294#false] [2018-02-02 11:03:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:18,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 11:03:18,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 11:03:18,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=489, Unknown=0, NotChecked=0, Total=870 [2018-02-02 11:03:18,393 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 30 states. [2018-02-02 11:03:18,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:18,735 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-02-02 11:03:18,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 11:03:18,735 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2018-02-02 11:03:18,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:18,736 INFO L225 Difference]: With dead ends: 45 [2018-02-02 11:03:18,736 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 11:03:18,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1139, Invalid=2053, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 11:03:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 11:03:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-02 11:03:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 11:03:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-02-02 11:03:18,738 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-02-02 11:03:18,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:18,738 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-02-02 11:03:18,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 11:03:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-02-02 11:03:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 11:03:18,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:18,739 INFO L351 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:18,739 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:18,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1706097848, now seen corresponding path program 26 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:18,741 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:18,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:18,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 11:03:18,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:18,966 INFO L182 omatonBuilderFactory]: Interpolants [3534#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 3535#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 3536#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 3537#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 3538#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 3539#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 3540#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 3541#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 3542#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 3543#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 3544#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 3545#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 3546#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 3547#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 3548#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 3549#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 3550#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 3551#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 3552#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 3553#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 3554#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 3555#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 3556#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 3557#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 3558#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 3559#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 3560#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 3561#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 3498#true, 3562#(not (= 80 |#Ultimate.C_memset_#amount|)), 3499#false] [2018-02-02 11:03:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:18,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 11:03:18,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 11:03:18,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=521, Unknown=0, NotChecked=0, Total=930 [2018-02-02 11:03:18,967 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 31 states. [2018-02-02 11:03:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:19,359 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-02-02 11:03:19,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 11:03:19,359 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 42 [2018-02-02 11:03:19,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:19,360 INFO L225 Difference]: With dead ends: 46 [2018-02-02 11:03:19,360 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 11:03:19,361 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1223, Invalid=2199, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 11:03:19,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 11:03:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 11:03:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 11:03:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-02-02 11:03:19,362 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-02-02 11:03:19,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:19,362 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-02-02 11:03:19,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 11:03:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-02-02 11:03:19,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 11:03:19,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:19,363 INFO L351 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:19,363 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:19,363 INFO L82 PathProgramCache]: Analyzing trace with hash 765148381, now seen corresponding path program 27 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:19,365 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:19,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:19,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 11:03:19,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:19,638 INFO L182 omatonBuilderFactory]: Interpolants [3746#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 3747#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 3748#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 3749#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 3750#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 3751#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 3752#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 3753#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 3754#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 3755#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 3756#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 3757#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 3758#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 3759#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 3760#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 3761#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 3762#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 3763#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 3764#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 3765#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 3766#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 3767#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 3768#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 3769#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 3770#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 3771#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 3772#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 3709#true, 3773#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 3710#false, 3774#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 3775#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:19,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 11:03:19,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 11:03:19,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=554, Unknown=0, NotChecked=0, Total=992 [2018-02-02 11:03:19,638 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 32 states. [2018-02-02 11:03:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:20,065 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-02-02 11:03:20,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 11:03:20,065 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 43 [2018-02-02 11:03:20,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:20,066 INFO L225 Difference]: With dead ends: 47 [2018-02-02 11:03:20,066 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 11:03:20,067 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1310, Invalid=2350, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 11:03:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 11:03:20,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 11:03:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 11:03:20,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-02-02 11:03:20,069 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-02-02 11:03:20,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:20,069 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-02-02 11:03:20,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 11:03:20,069 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-02-02 11:03:20,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 11:03:20,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:20,069 INFO L351 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:20,070 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:20,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1660485976, now seen corresponding path program 28 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:20,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:20,318 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:20,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 11:03:20,319 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:20,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 11:03:20,319 INFO L182 omatonBuilderFactory]: Interpolants [3968#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 3969#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 3970#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 3971#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 3972#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 3973#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 3974#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 3975#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 3976#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 3977#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 3978#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 3979#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 3980#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 3981#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 3982#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 3983#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 3984#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 3985#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 3986#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 3987#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 3988#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 3989#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 3926#true, 3990#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 3927#false, 3991#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 3992#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 3993#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 3994#(not (= 80 |#Ultimate.C_memset_#amount|)), 3964#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 3965#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 3966#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 3967#(<= |#Ultimate.C_memset_#t~loopctr5| 2)] [2018-02-02 11:03:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:20,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 11:03:20,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 11:03:20,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=588, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 11:03:20,320 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 33 states. [2018-02-02 11:03:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:20,696 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-02-02 11:03:20,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 11:03:20,696 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 44 [2018-02-02 11:03:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:20,697 INFO L225 Difference]: With dead ends: 48 [2018-02-02 11:03:20,697 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 11:03:20,697 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1400, Invalid=2506, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 11:03:20,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 11:03:20,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 11:03:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 11:03:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-02 11:03:20,699 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-02-02 11:03:20,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:20,699 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-02 11:03:20,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 11:03:20,699 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-02 11:03:20,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 11:03:20,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:20,699 INFO L351 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:20,699 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:20,699 INFO L82 PathProgramCache]: Analyzing trace with hash -648819651, now seen corresponding path program 29 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:20,704 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:20,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:20,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 11:03:20,964 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:20,964 INFO L182 omatonBuilderFactory]: Interpolants [4188#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 4189#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 4190#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 4191#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 4192#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 4193#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 4194#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 4195#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 4196#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 4197#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 4198#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 4199#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 4200#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 4201#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 4202#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 4203#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 4204#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 4205#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 4206#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 4207#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 4208#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 4209#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 4210#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 4211#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 4212#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 4149#true, 4213#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 4150#false, 4214#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 4215#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 4216#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 4217#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 4218#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 4219#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:20,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 11:03:20,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 11:03:20,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=623, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 11:03:20,965 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 34 states. [2018-02-02 11:03:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:21,363 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-02-02 11:03:21,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 11:03:21,363 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 45 [2018-02-02 11:03:21,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:21,363 INFO L225 Difference]: With dead ends: 49 [2018-02-02 11:03:21,364 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 11:03:21,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1493, Invalid=2667, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 11:03:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 11:03:21,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 11:03:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 11:03:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-02-02 11:03:21,365 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-02-02 11:03:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:21,366 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-02-02 11:03:21,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 11:03:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-02-02 11:03:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 11:03:21,366 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:21,366 INFO L351 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:21,366 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:21,366 INFO L82 PathProgramCache]: Analyzing trace with hash 777149944, now seen corresponding path program 30 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:21,369 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:21,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:21,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 11:03:21,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:21,662 INFO L182 omatonBuilderFactory]: Interpolants [4418#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 4419#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 4420#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 4421#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 4422#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 4423#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 4424#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 4425#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 4426#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 4427#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 4428#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 4429#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 4430#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 4431#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 4432#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 4433#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 4434#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 4435#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 4436#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 4437#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 4438#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 4439#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 4440#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 4441#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 4378#true, 4442#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 4379#false, 4443#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 4444#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 4445#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 4446#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 4447#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 4448#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 4449#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 4450#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:21,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 11:03:21,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 11:03:21,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=659, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 11:03:21,663 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 35 states. [2018-02-02 11:03:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:22,084 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-02-02 11:03:22,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 11:03:22,084 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 46 [2018-02-02 11:03:22,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:22,084 INFO L225 Difference]: With dead ends: 50 [2018-02-02 11:03:22,084 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 11:03:22,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1589, Invalid=2833, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 11:03:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 11:03:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-02 11:03:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 11:03:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-02-02 11:03:22,087 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-02-02 11:03:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:22,087 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-02-02 11:03:22,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 11:03:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-02-02 11:03:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 11:03:22,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:22,088 INFO L351 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:22,088 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:22,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2032534429, now seen corresponding path program 31 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:22,090 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:22,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:22,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 11:03:22,387 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:22,388 INFO L182 omatonBuilderFactory]: Interpolants [4672#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 4673#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 4674#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 4675#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 4676#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 4613#true, 4677#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 4614#false, 4678#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 4679#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 4680#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 4681#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 4682#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 4683#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 4684#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 4685#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 4686#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 4687#(not (= 80 |#Ultimate.C_memset_#amount|)), 4654#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 4655#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 4656#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 4657#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 4658#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 4659#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 4660#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 4661#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 4662#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 4663#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 4664#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 4665#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 4666#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 4667#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 4668#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 4669#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 4670#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 4671#(<= |#Ultimate.C_memset_#t~loopctr5| 16)] [2018-02-02 11:03:22,388 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:22,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 11:03:22,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 11:03:22,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=696, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 11:03:22,388 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 36 states. [2018-02-02 11:03:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:22,814 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-02-02 11:03:22,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 11:03:22,815 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 47 [2018-02-02 11:03:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:22,815 INFO L225 Difference]: With dead ends: 51 [2018-02-02 11:03:22,815 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 11:03:22,816 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1688, Invalid=3004, Unknown=0, NotChecked=0, Total=4692 [2018-02-02 11:03:22,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 11:03:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 11:03:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 11:03:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-02-02 11:03:22,817 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-02-02 11:03:22,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:22,817 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-02-02 11:03:22,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 11:03:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-02-02 11:03:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 11:03:22,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:22,817 INFO L351 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:22,817 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:22,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2000219496, now seen corresponding path program 32 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:22,819 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:23,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:23,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 11:03:23,138 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:23,139 INFO L182 omatonBuilderFactory]: Interpolants [4928#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 4929#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 4930#(not (= 80 |#Ultimate.C_memset_#amount|)), 4896#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 4897#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 4898#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 4899#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 4900#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 4901#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 4902#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 4903#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 4904#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 4905#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 4906#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 4907#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 4908#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 4909#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 4910#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 4911#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 4912#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 4913#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 4914#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 4915#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 4916#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 4917#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 4854#true, 4918#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 4855#false, 4919#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 4920#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 4921#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 4922#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 4923#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 4924#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 4925#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 4926#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 4927#(<= |#Ultimate.C_memset_#t~loopctr5| 30)] [2018-02-02 11:03:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:23,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 11:03:23,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 11:03:23,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=734, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 11:03:23,139 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 37 states. [2018-02-02 11:03:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:23,564 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-02-02 11:03:23,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 11:03:23,564 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 48 [2018-02-02 11:03:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:23,564 INFO L225 Difference]: With dead ends: 52 [2018-02-02 11:03:23,564 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 11:03:23,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1790, Invalid=3180, Unknown=0, NotChecked=0, Total=4970 [2018-02-02 11:03:23,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 11:03:23,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 11:03:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 11:03:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-02-02 11:03:23,566 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-02-02 11:03:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:23,566 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-02-02 11:03:23,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 11:03:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-02-02 11:03:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 11:03:23,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:23,566 INFO L351 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:23,566 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:23,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1833427709, now seen corresponding path program 33 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:23,572 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:23,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:23,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-02 11:03:23,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:23,880 INFO L182 omatonBuilderFactory]: Interpolants [5144#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 5145#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 5146#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 5147#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 5148#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 5149#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 5150#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 5151#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 5152#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 5153#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 5154#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 5155#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 5156#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 5157#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 5158#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 5159#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 5160#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 5161#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 5162#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 5163#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 5164#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 5101#true, 5165#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 5102#false, 5166#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 5167#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 5168#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 5169#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 5170#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 5171#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 5172#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 5173#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 5174#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 5175#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 5176#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 5177#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 5178#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 5179#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:23,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 11:03:23,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 11:03:23,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=773, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 11:03:23,881 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 38 states. [2018-02-02 11:03:24,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:24,421 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-02 11:03:24,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 11:03:24,421 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 49 [2018-02-02 11:03:24,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:24,421 INFO L225 Difference]: With dead ends: 53 [2018-02-02 11:03:24,421 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 11:03:24,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1895, Invalid=3361, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 11:03:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 11:03:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 11:03:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 11:03:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-02-02 11:03:24,423 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-02-02 11:03:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:24,423 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-02-02 11:03:24,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 11:03:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-02-02 11:03:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 11:03:24,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:24,424 INFO L351 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:24,424 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:24,424 INFO L82 PathProgramCache]: Analyzing trace with hash 417406776, now seen corresponding path program 34 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:24,426 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:24,789 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:24,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 11:03:24,790 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:24,790 INFO L182 omatonBuilderFactory]: Interpolants [5398#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 5399#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 5400#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 5401#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 5402#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 5403#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 5404#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 5405#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 5406#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 5407#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 5408#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 5409#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 5410#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 5411#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 5412#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 5413#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 5414#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 5415#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 5416#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 5417#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 5354#true, 5418#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 5355#false, 5419#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 5420#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 5421#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 5422#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 5423#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 5424#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 5425#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 5426#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 5427#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 5428#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 5429#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 5430#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 5431#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 5432#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 5433#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 5434#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:24,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 11:03:24,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 11:03:24,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=813, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 11:03:24,791 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 39 states. [2018-02-02 11:03:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:25,332 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-02-02 11:03:25,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 11:03:25,332 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 50 [2018-02-02 11:03:25,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:25,333 INFO L225 Difference]: With dead ends: 54 [2018-02-02 11:03:25,333 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 11:03:25,333 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2003, Invalid=3547, Unknown=0, NotChecked=0, Total=5550 [2018-02-02 11:03:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 11:03:25,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 11:03:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 11:03:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-02-02 11:03:25,335 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-02-02 11:03:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:25,335 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-02-02 11:03:25,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 11:03:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-02-02 11:03:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 11:03:25,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:25,336 INFO L351 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:25,336 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:25,336 INFO L82 PathProgramCache]: Analyzing trace with hash -529569187, now seen corresponding path program 35 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:25,338 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:25,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:25,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 11:03:25,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:25,722 INFO L182 omatonBuilderFactory]: Interpolants [5658#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 5659#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 5660#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 5661#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 5662#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 5663#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 5664#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 5665#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 5666#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 5667#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 5668#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 5669#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 5670#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 5671#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 5672#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 5673#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 5674#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 5675#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 5676#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 5613#true, 5677#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 5614#false, 5678#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 5679#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 5680#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 5681#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 5682#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 5683#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 5684#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 5685#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 5686#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 5687#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 5688#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 5689#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 5690#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 5691#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 5692#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 5693#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 5694#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 5695#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:25,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 11:03:25,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 11:03:25,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=854, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 11:03:25,722 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 40 states. [2018-02-02 11:03:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:26,271 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-02-02 11:03:26,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 11:03:26,271 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 51 [2018-02-02 11:03:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:26,271 INFO L225 Difference]: With dead ends: 55 [2018-02-02 11:03:26,272 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 11:03:26,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2114, Invalid=3738, Unknown=0, NotChecked=0, Total=5852 [2018-02-02 11:03:26,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 11:03:26,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 11:03:26,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 11:03:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-02 11:03:26,273 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-02-02 11:03:26,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:26,273 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-02 11:03:26,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 11:03:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-02 11:03:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 11:03:26,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:26,273 INFO L351 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:26,274 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:26,274 INFO L82 PathProgramCache]: Analyzing trace with hash 178947032, now seen corresponding path program 36 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:26,276 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:26,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:26,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 11:03:26,650 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:26,650 INFO L182 omatonBuilderFactory]: Interpolants [5952#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 5953#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 5954#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 5955#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 5956#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 5957#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 5958#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 5959#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 5960#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 5961#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 5962#(not (= 80 |#Ultimate.C_memset_#amount|)), 5924#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 5925#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 5926#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 5927#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 5928#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 5929#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 5930#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 5931#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 5932#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 5933#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 5934#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 5935#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 5936#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 5937#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 5938#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 5939#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 5940#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 5941#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 5878#true, 5942#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 5879#false, 5943#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 5944#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 5945#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 5946#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 5947#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 5948#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 5949#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 5950#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 5951#(<= |#Ultimate.C_memset_#t~loopctr5| 26)] [2018-02-02 11:03:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:26,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 11:03:26,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 11:03:26,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=896, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 11:03:26,651 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 41 states. [2018-02-02 11:03:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:27,182 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-02-02 11:03:27,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 11:03:27,182 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 52 [2018-02-02 11:03:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:27,183 INFO L225 Difference]: With dead ends: 56 [2018-02-02 11:03:27,183 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 11:03:27,183 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2228, Invalid=3934, Unknown=0, NotChecked=0, Total=6162 [2018-02-02 11:03:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 11:03:27,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 11:03:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 11:03:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-02-02 11:03:27,185 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-02-02 11:03:27,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:27,185 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-02-02 11:03:27,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 11:03:27,185 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-02-02 11:03:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 11:03:27,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:27,185 INFO L351 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:27,185 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:27,186 INFO L82 PathProgramCache]: Analyzing trace with hash 668113341, now seen corresponding path program 37 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:27,202 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:27,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:27,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 11:03:27,607 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:27,608 INFO L182 omatonBuilderFactory]: Interpolants [6208#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 6209#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 6210#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 6211#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 6212#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 6149#true, 6213#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 6150#false, 6214#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 6215#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 6216#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 6217#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 6218#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 6219#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 6220#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 6221#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 6222#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 6223#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 6224#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 6225#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 6226#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 6227#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 6228#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 6229#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 6230#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 6231#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 6232#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 6233#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 6234#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 6235#(not (= 80 |#Ultimate.C_memset_#amount|)), 6196#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 6197#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 6198#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 6199#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 6200#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 6201#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 6202#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 6203#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 6204#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 6205#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 6206#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 6207#(<= |#Ultimate.C_memset_#t~loopctr5| 10)] [2018-02-02 11:03:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:27,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 11:03:27,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 11:03:27,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=939, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 11:03:27,608 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 42 states. [2018-02-02 11:03:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:28,151 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-02-02 11:03:28,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 11:03:28,151 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 53 [2018-02-02 11:03:28,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:28,151 INFO L225 Difference]: With dead ends: 57 [2018-02-02 11:03:28,151 INFO L226 Difference]: Without dead ends: 55 [2018-02-02 11:03:28,152 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2345, Invalid=4135, Unknown=0, NotChecked=0, Total=6480 [2018-02-02 11:03:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-02 11:03:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-02 11:03:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 11:03:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-02-02 11:03:28,153 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-02-02 11:03:28,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:28,153 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-02-02 11:03:28,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 11:03:28,153 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-02-02 11:03:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 11:03:28,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:28,154 INFO L351 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:28,154 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:28,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1347600264, now seen corresponding path program 38 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:28,159 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:28,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:28,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 11:03:28,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:28,587 INFO L182 omatonBuilderFactory]: Interpolants [6474#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 6475#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 6476#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 6477#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 6478#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 6479#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 6480#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 6481#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 6482#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 6483#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 6484#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 6485#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 6486#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 6487#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 6488#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 6489#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 6426#true, 6490#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 6427#false, 6491#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 6492#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 6493#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 6494#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 6495#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 6496#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 6497#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 6498#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 6499#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 6500#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 6501#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 6502#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 6503#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 6504#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 6505#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 6506#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 6507#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 6508#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 6509#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 6510#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 6511#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 6512#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 6513#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 6514#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:28,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 11:03:28,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 11:03:28,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=983, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 11:03:28,587 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 43 states. [2018-02-02 11:03:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:29,226 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-02-02 11:03:29,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 11:03:29,227 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 54 [2018-02-02 11:03:29,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:29,227 INFO L225 Difference]: With dead ends: 58 [2018-02-02 11:03:29,227 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 11:03:29,227 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2465, Invalid=4341, Unknown=0, NotChecked=0, Total=6806 [2018-02-02 11:03:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 11:03:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 11:03:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 11:03:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-02-02 11:03:29,229 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-02-02 11:03:29,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:29,229 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-02-02 11:03:29,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 11:03:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-02-02 11:03:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 11:03:29,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:29,229 INFO L351 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:29,229 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:29,229 INFO L82 PathProgramCache]: Analyzing trace with hash 589787421, now seen corresponding path program 39 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:29,232 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:29,704 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:29,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:29,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-02 11:03:29,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:29,721 INFO L182 omatonBuilderFactory]: Interpolants [6784#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 6785#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 6786#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 6787#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 6788#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 6789#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 6790#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 6791#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 6792#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 6793#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 6794#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 6795#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 6796#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 6797#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 6798#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 6799#(not (= 80 |#Ultimate.C_memset_#amount|)), 6758#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 6759#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 6760#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 6761#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 6762#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 6763#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 6764#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 6765#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 6766#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 6767#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 6768#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 6769#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 6770#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 6771#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 6772#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 6709#true, 6773#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 6710#false, 6774#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 6775#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 6776#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 6777#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 6778#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 6779#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 6780#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 6781#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 6782#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 6783#(<= |#Ultimate.C_memset_#t~loopctr5| 24)] [2018-02-02 11:03:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:29,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 11:03:29,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 11:03:29,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=1028, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 11:03:29,722 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 44 states. [2018-02-02 11:03:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:30,393 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-02-02 11:03:30,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 11:03:30,394 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 55 [2018-02-02 11:03:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:30,394 INFO L225 Difference]: With dead ends: 59 [2018-02-02 11:03:30,394 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 11:03:30,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2588, Invalid=4552, Unknown=0, NotChecked=0, Total=7140 [2018-02-02 11:03:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 11:03:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 11:03:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 11:03:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-02-02 11:03:30,395 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-02-02 11:03:30,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:30,396 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-02-02 11:03:30,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 11:03:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-02-02 11:03:30,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 11:03:30,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:30,396 INFO L351 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:30,396 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:30,396 INFO L82 PathProgramCache]: Analyzing trace with hash 519263512, now seen corresponding path program 40 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:30,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:30,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:30,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-02 11:03:30,840 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:30,841 INFO L182 omatonBuilderFactory]: Interpolants [7048#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 7049#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 7050#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 7051#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 7052#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 7053#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 7054#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 7055#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 7056#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 7057#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 7058#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 7059#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 7060#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 7061#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 6998#true, 7062#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 6999#false, 7063#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 7064#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 7065#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 7066#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 7067#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 7068#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 7069#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 7070#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 7071#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 7072#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 7073#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 7074#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 7075#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 7076#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 7077#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 7078#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 7079#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 7080#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 7081#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 7082#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 7083#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 7084#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 7085#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 7086#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 7087#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 7088#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 7089#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 7090#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:30,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 11:03:30,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 11:03:30,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=1074, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 11:03:30,841 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 45 states. [2018-02-02 11:03:31,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:31,524 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-02-02 11:03:31,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 11:03:31,524 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 56 [2018-02-02 11:03:31,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:31,525 INFO L225 Difference]: With dead ends: 60 [2018-02-02 11:03:31,525 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 11:03:31,526 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2714, Invalid=4768, Unknown=0, NotChecked=0, Total=7482 [2018-02-02 11:03:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 11:03:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-02 11:03:31,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 11:03:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-02-02 11:03:31,528 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-02-02 11:03:31,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:31,529 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-02-02 11:03:31,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 11:03:31,529 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-02-02 11:03:31,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 11:03:31,529 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:31,529 INFO L351 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:31,529 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:31,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1666977667, now seen corresponding path program 41 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:31,532 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:31,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:31,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-02 11:03:31,979 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:31,979 INFO L182 omatonBuilderFactory]: Interpolants [7360#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 7361#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 7362#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 7363#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 7364#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 7365#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 7366#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 7367#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 7368#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 7369#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 7370#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 7371#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 7372#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 7373#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 7374#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 7375#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 7376#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 7377#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 7378#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 7379#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 7380#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 7381#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 7382#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 7383#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 7384#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 7385#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 7386#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 7387#(not (= 80 |#Ultimate.C_memset_#amount|)), 7344#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 7345#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 7346#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 7347#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 7348#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 7349#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 7350#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 7351#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 7352#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 7353#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 7354#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 7355#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 7356#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 7293#true, 7357#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 7294#false, 7358#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 7359#(<= |#Ultimate.C_memset_#t~loopctr5| 14)] [2018-02-02 11:03:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:31,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 11:03:31,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 11:03:31,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1121, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 11:03:31,980 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 46 states. [2018-02-02 11:03:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:32,609 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-02-02 11:03:32,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 11:03:32,609 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 57 [2018-02-02 11:03:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:32,610 INFO L225 Difference]: With dead ends: 61 [2018-02-02 11:03:32,610 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 11:03:32,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2843, Invalid=4989, Unknown=0, NotChecked=0, Total=7832 [2018-02-02 11:03:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 11:03:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 11:03:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 11:03:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-02-02 11:03:32,611 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-02-02 11:03:32,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:32,611 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-02-02 11:03:32,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 11:03:32,611 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-02-02 11:03:32,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 11:03:32,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:32,612 INFO L351 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:32,612 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:32,612 INFO L82 PathProgramCache]: Analyzing trace with hash -720977480, now seen corresponding path program 42 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:32,614 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:33,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:33,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-02 11:03:33,091 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:33,091 INFO L182 omatonBuilderFactory]: Interpolants [7680#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 7681#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 7682#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 7683#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 7684#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 7685#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 7686#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 7687#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 7688#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 7689#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 7690#(not (= 80 |#Ultimate.C_memset_#amount|)), 7646#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 7647#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 7648#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 7649#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 7650#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 7651#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 7652#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 7653#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 7654#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 7655#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 7656#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 7657#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 7594#true, 7658#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 7595#false, 7659#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 7660#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 7661#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 7662#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 7663#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 7664#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 7665#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 7666#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 7667#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 7668#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 7669#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 7670#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 7671#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 7672#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 7673#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 7674#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 7675#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 7676#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 7677#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 7678#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 7679#(<= |#Ultimate.C_memset_#t~loopctr5| 32)] [2018-02-02 11:03:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:33,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 11:03:33,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 11:03:33,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1169, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 11:03:33,092 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 47 states. [2018-02-02 11:03:33,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:33,802 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-02-02 11:03:33,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 11:03:33,802 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 58 [2018-02-02 11:03:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:33,803 INFO L225 Difference]: With dead ends: 62 [2018-02-02 11:03:33,803 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 11:03:33,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2975, Invalid=5215, Unknown=0, NotChecked=0, Total=8190 [2018-02-02 11:03:33,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 11:03:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 11:03:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 11:03:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-02-02 11:03:33,805 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-02-02 11:03:33,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:33,805 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-02-02 11:03:33,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 11:03:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-02-02 11:03:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 11:03:33,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:33,805 INFO L351 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:33,805 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:33,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1459742755, now seen corresponding path program 43 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:33,807 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:34,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:34,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-02 11:03:34,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:34,378 INFO L182 omatonBuilderFactory]: Interpolants [7954#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 7955#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 7956#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 7957#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 7958#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 7959#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 7960#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 7961#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 7962#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 7963#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 7964#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 7901#true, 7965#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 7902#false, 7966#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 7967#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 7968#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 7969#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 7970#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 7971#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 7972#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 7973#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 7974#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 7975#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 7976#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 7977#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 7978#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 7979#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 7980#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 7981#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 7982#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 7983#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 7984#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 7985#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 7986#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 7987#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 7988#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 7989#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 7990#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 7991#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 7992#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 7993#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 7994#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 7995#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 7996#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 7997#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 7998#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 7999#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:34,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 11:03:34,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 11:03:34,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1218, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 11:03:34,379 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 48 states. [2018-02-02 11:03:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:35,192 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-02-02 11:03:35,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 11:03:35,192 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 59 [2018-02-02 11:03:35,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:35,193 INFO L225 Difference]: With dead ends: 63 [2018-02-02 11:03:35,193 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 11:03:35,193 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3110, Invalid=5446, Unknown=0, NotChecked=0, Total=8556 [2018-02-02 11:03:35,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 11:03:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-02 11:03:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 11:03:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-02-02 11:03:35,194 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-02-02 11:03:35,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:35,194 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-02-02 11:03:35,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 11:03:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-02-02 11:03:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 11:03:35,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:35,195 INFO L351 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:35,195 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:35,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1408337496, now seen corresponding path program 44 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:35,203 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:35,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:35,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-02 11:03:35,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:35,796 INFO L182 omatonBuilderFactory]: Interpolants [8214#true, 8215#false, 8268#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 8269#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 8270#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 8271#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 8272#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 8273#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 8274#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 8275#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 8276#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 8277#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 8278#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 8279#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 8280#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 8281#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 8282#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 8283#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 8284#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 8285#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 8286#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 8287#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 8288#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 8289#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 8290#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 8291#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 8292#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 8293#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 8294#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 8295#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 8296#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 8297#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 8298#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 8299#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 8300#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 8301#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 8302#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 8303#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 8304#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 8305#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 8306#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 8307#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 8308#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 8309#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 8310#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 8311#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 8312#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 8313#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 8314#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:35,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 11:03:35,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 11:03:35,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1268, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 11:03:35,797 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 49 states. [2018-02-02 11:03:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:36,585 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-02-02 11:03:36,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 11:03:36,585 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 60 [2018-02-02 11:03:36,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:36,585 INFO L225 Difference]: With dead ends: 64 [2018-02-02 11:03:36,585 INFO L226 Difference]: Without dead ends: 62 [2018-02-02 11:03:36,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3248, Invalid=5682, Unknown=0, NotChecked=0, Total=8930 [2018-02-02 11:03:36,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-02 11:03:36,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-02 11:03:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 11:03:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-02-02 11:03:36,587 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-02-02 11:03:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:36,587 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-02-02 11:03:36,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 11:03:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-02-02 11:03:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 11:03:36,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:36,588 INFO L351 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:36,588 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:36,588 INFO L82 PathProgramCache]: Analyzing trace with hash 124512061, now seen corresponding path program 45 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:36,591 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:37,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:37,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-02 11:03:37,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:37,197 INFO L182 omatonBuilderFactory]: Interpolants [8588#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 8589#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 8590#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 8591#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 8592#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 8593#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 8594#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 8595#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 8596#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 8597#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 8598#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 8599#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 8600#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 8601#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 8602#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 8603#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 8604#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 8605#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 8606#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 8607#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 8608#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 8609#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 8610#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 8611#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 8612#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 8613#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 8614#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 8615#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 8616#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 8617#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 8618#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 8619#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 8620#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 8621#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 8622#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 8623#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 8624#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 8625#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 8626#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 8627#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 8628#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 8629#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 8630#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 8631#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 8632#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 8633#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 8634#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 8635#(not (= 80 |#Ultimate.C_memset_#amount|)), 8533#true, 8534#false] [2018-02-02 11:03:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:37,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 11:03:37,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 11:03:37,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1319, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 11:03:37,198 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 50 states. [2018-02-02 11:03:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:38,039 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-02-02 11:03:38,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 11:03:38,039 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 61 [2018-02-02 11:03:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:38,039 INFO L225 Difference]: With dead ends: 65 [2018-02-02 11:03:38,039 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 11:03:38,040 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3389, Invalid=5923, Unknown=0, NotChecked=0, Total=9312 [2018-02-02 11:03:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 11:03:38,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-02 11:03:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 11:03:38,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-02-02 11:03:38,041 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-02-02 11:03:38,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:38,041 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-02-02 11:03:38,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-02 11:03:38,041 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-02-02 11:03:38,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 11:03:38,042 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:38,042 INFO L351 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:38,042 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:38,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1019370760, now seen corresponding path program 46 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:38,044 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:38,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:38,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-02 11:03:38,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:38,626 INFO L182 omatonBuilderFactory]: Interpolants [8960#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 8961#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 8962#(not (= 80 |#Ultimate.C_memset_#amount|)), 8858#true, 8859#false, 8914#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 8915#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 8916#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 8917#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 8918#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 8919#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 8920#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 8921#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 8922#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 8923#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 8924#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 8925#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 8926#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 8927#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 8928#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 8929#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 8930#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 8931#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 8932#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 8933#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 8934#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 8935#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 8936#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 8937#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 8938#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 8939#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 8940#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 8941#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 8942#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 8943#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 8944#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 8945#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 8946#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 8947#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 8948#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 8949#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 8950#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 8951#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 8952#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 8953#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 8954#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 8955#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 8956#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 8957#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 8958#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 8959#(<= |#Ultimate.C_memset_#t~loopctr5| 44)] [2018-02-02 11:03:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:38,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-02 11:03:38,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-02 11:03:38,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1371, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 11:03:38,627 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 51 states. [2018-02-02 11:03:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:39,487 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-02-02 11:03:39,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 11:03:39,487 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 62 [2018-02-02 11:03:39,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:39,487 INFO L225 Difference]: With dead ends: 66 [2018-02-02 11:03:39,488 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 11:03:39,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3533, Invalid=6169, Unknown=0, NotChecked=0, Total=9702 [2018-02-02 11:03:39,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 11:03:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-02 11:03:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 11:03:39,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-02-02 11:03:39,489 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-02-02 11:03:39,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:39,489 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-02-02 11:03:39,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-02 11:03:39,489 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-02-02 11:03:39,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 11:03:39,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:39,490 INFO L351 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:39,490 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:39,490 INFO L82 PathProgramCache]: Analyzing trace with hash -2119999843, now seen corresponding path program 47 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:39,492 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:40,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:40,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-02 11:03:40,184 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:40,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 11:03:40,185 INFO L182 omatonBuilderFactory]: Interpolants [9246#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 9247#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 9248#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 9249#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 9250#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 9251#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 9252#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 9253#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 9254#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 9255#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 9256#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 9257#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 9258#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 9259#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 9260#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 9261#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 9262#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 9263#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 9264#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 9265#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 9266#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 9267#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 9268#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 9269#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 9270#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 9271#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 9272#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 9273#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 9274#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 9275#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 9276#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 9277#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 9278#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 9279#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 9280#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 9281#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 9282#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 9283#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 9284#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 9285#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 9286#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 9287#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 9288#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 9289#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 9290#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 9291#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 9292#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 9293#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 9294#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 9295#(not (= 80 |#Ultimate.C_memset_#amount|)), 9189#true, 9190#false] [2018-02-02 11:03:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:40,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-02 11:03:40,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-02 11:03:40,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1424, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 11:03:40,186 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 52 states. [2018-02-02 11:03:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:41,093 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-02-02 11:03:41,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-02 11:03:41,093 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 63 [2018-02-02 11:03:41,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:41,093 INFO L225 Difference]: With dead ends: 67 [2018-02-02 11:03:41,094 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 11:03:41,094 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3680, Invalid=6420, Unknown=0, NotChecked=0, Total=10100 [2018-02-02 11:03:41,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 11:03:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-02 11:03:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 11:03:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-02-02 11:03:41,095 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-02-02 11:03:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:41,095 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-02-02 11:03:41,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-02 11:03:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-02-02 11:03:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 11:03:41,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:41,095 INFO L351 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:41,096 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:41,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1879763048, now seen corresponding path program 48 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:41,098 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:41,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:41,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-02 11:03:41,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:41,757 INFO L182 omatonBuilderFactory]: Interpolants [9600#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 9601#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 9602#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 9603#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 9604#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 9605#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 9606#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 9607#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 9608#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 9609#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 9610#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 9611#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 9612#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 9613#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 9614#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 9615#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 9616#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 9617#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 9618#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 9619#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 9620#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 9621#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 9622#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 9623#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 9624#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 9625#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 9626#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 9627#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 9628#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 9629#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 9630#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 9631#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 9632#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 9633#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 9634#(not (= 80 |#Ultimate.C_memset_#amount|)), 9526#true, 9527#false, 9584#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 9585#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 9586#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 9587#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 9588#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 9589#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 9590#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 9591#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 9592#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 9593#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 9594#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 9595#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 9596#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 9597#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 9598#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 9599#(<= |#Ultimate.C_memset_#t~loopctr5| 14)] [2018-02-02 11:03:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:41,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-02 11:03:41,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-02 11:03:41,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1478, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 11:03:41,758 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 53 states. [2018-02-02 11:03:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:42,666 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-02-02 11:03:42,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 11:03:42,667 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 64 [2018-02-02 11:03:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:42,667 INFO L225 Difference]: With dead ends: 68 [2018-02-02 11:03:42,667 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 11:03:42,668 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3830, Invalid=6676, Unknown=0, NotChecked=0, Total=10506 [2018-02-02 11:03:42,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 11:03:42,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-02 11:03:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 11:03:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-02-02 11:03:42,670 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-02-02 11:03:42,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:42,670 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-02-02 11:03:42,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-02 11:03:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-02-02 11:03:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 11:03:42,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:42,671 INFO L351 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:42,671 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:42,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1272610301, now seen corresponding path program 49 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:42,674 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:43,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:43,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-02 11:03:43,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:43,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 11:03:43,358 INFO L182 omatonBuilderFactory]: Interpolants [9869#true, 9870#false, 9928#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 9929#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 9930#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 9931#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 9932#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 9933#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 9934#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 9935#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 9936#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 9937#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 9938#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 9939#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 9940#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 9941#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 9942#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 9943#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 9944#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 9945#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 9946#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 9947#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 9948#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 9949#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 9950#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 9951#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 9952#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 9953#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 9954#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 9955#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 9956#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 9957#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 9958#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 9959#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 9960#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 9961#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 9962#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 9963#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 9964#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 9965#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 9966#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 9967#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 9968#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 9969#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 9970#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 9971#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 9972#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 9973#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 9974#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 9975#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 9976#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 9977#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 9978#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 9979#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:03:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:43,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-02 11:03:43,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-02 11:03:43,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1533, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 11:03:43,359 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 54 states. [2018-02-02 11:03:44,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:44,293 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-02-02 11:03:44,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 11:03:44,294 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 65 [2018-02-02 11:03:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:44,294 INFO L225 Difference]: With dead ends: 69 [2018-02-02 11:03:44,294 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 11:03:44,295 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3983, Invalid=6937, Unknown=0, NotChecked=0, Total=10920 [2018-02-02 11:03:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 11:03:44,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-02 11:03:44,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 11:03:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-02-02 11:03:44,296 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-02-02 11:03:44,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:44,296 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-02-02 11:03:44,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-02 11:03:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-02-02 11:03:44,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 11:03:44,297 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:44,297 INFO L351 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:44,297 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:44,297 INFO L82 PathProgramCache]: Analyzing trace with hash 211936312, now seen corresponding path program 50 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:44,299 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:45,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:45,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-02 11:03:45,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:45,094 INFO L182 omatonBuilderFactory]: Interpolants [10278#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 10279#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 10280#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 10281#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 10282#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 10283#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 10284#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 10285#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 10286#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 10287#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 10288#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 10289#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 10290#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 10291#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 10292#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 10293#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 10294#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 10295#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 10296#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 10297#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 10298#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 10299#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 10300#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 10301#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 10302#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 10303#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 10304#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 10305#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 10306#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 10307#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 10308#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 10309#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 10310#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 10311#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 10312#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 10313#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 10314#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 10315#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 10316#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 10317#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 10318#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 10319#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 10320#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 10321#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 10322#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 10323#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 10324#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 10325#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 10326#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 10327#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 10328#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 10329#(<= |#Ultimate.C_memset_#t~loopctr5| 50), 10330#(not (= 80 |#Ultimate.C_memset_#amount|)), 10218#true, 10219#false] [2018-02-02 11:03:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:45,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-02 11:03:45,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-02 11:03:45,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1589, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 11:03:45,095 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 55 states. [2018-02-02 11:03:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:46,069 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-02-02 11:03:46,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-02 11:03:46,070 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 66 [2018-02-02 11:03:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:46,070 INFO L225 Difference]: With dead ends: 70 [2018-02-02 11:03:46,070 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 11:03:46,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4139, Invalid=7203, Unknown=0, NotChecked=0, Total=11342 [2018-02-02 11:03:46,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 11:03:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-02 11:03:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 11:03:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-02-02 11:03:46,072 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-02-02 11:03:46,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:46,072 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-02-02 11:03:46,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-02 11:03:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-02-02 11:03:46,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 11:03:46,072 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:46,072 INFO L351 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:46,072 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:46,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1690781021, now seen corresponding path program 51 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:46,075 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:46,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:46,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-02 11:03:46,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:46,774 INFO L182 omatonBuilderFactory]: Interpolants [10634#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 10635#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 10636#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 10637#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 10638#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 10639#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 10640#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 10641#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 10642#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 10643#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 10644#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 10645#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 10646#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 10647#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 10648#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 10649#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 10650#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 10651#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 10652#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 10653#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 10654#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 10655#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 10656#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 10657#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 10658#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 10659#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 10660#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 10661#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 10662#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 10663#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 10664#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 10665#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 10666#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 10667#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 10668#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 10669#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 10670#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 10671#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 10672#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 10673#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 10674#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 10675#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 10676#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 10677#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 10678#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 10679#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 10680#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 10681#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 10682#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 10683#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 10684#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 10685#(<= |#Ultimate.C_memset_#t~loopctr5| 50), 10686#(<= |#Ultimate.C_memset_#t~loopctr5| 51), 10687#(not (= 80 |#Ultimate.C_memset_#amount|)), 10573#true, 10574#false] [2018-02-02 11:03:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:46,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-02 11:03:46,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-02 11:03:46,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1646, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 11:03:46,775 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 56 states. [2018-02-02 11:03:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:47,755 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-02-02 11:03:47,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-02 11:03:47,755 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 67 [2018-02-02 11:03:47,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:47,755 INFO L225 Difference]: With dead ends: 71 [2018-02-02 11:03:47,755 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 11:03:47,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1427 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4298, Invalid=7474, Unknown=0, NotChecked=0, Total=11772 [2018-02-02 11:03:47,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 11:03:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-02 11:03:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 11:03:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-02-02 11:03:47,757 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-02-02 11:03:47,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:47,757 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-02-02 11:03:47,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-02 11:03:47,757 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-02-02 11:03:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 11:03:47,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:47,758 INFO L351 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:47,758 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:47,758 INFO L82 PathProgramCache]: Analyzing trace with hash 290326744, now seen corresponding path program 52 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:47,760 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:48,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:48,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:48,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-02 11:03:48,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:48,522 INFO L182 omatonBuilderFactory]: Interpolants [11008#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 11009#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 11010#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 11011#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 11012#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 11013#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 11014#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 11015#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 11016#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 11017#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 11018#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 11019#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 11020#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 11021#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 11022#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 11023#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 11024#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 11025#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 11026#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 11027#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 11028#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 11029#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 11030#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 11031#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 11032#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 11033#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 11034#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 11035#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 11036#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 11037#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 11038#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 11039#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 11040#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 11041#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 11042#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 11043#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 11044#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 11045#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 11046#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 11047#(<= |#Ultimate.C_memset_#t~loopctr5| 50), 11048#(<= |#Ultimate.C_memset_#t~loopctr5| 51), 11049#(<= |#Ultimate.C_memset_#t~loopctr5| 52), 11050#(not (= 80 |#Ultimate.C_memset_#amount|)), 10934#true, 10935#false, 10996#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 10997#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 10998#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 10999#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 11000#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 11001#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 11002#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 11003#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 11004#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 11005#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 11006#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 11007#(<= |#Ultimate.C_memset_#t~loopctr5| 10)] [2018-02-02 11:03:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:48,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-02 11:03:48,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-02 11:03:48,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1704, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 11:03:48,523 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 57 states. [2018-02-02 11:03:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:49,720 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-02-02 11:03:49,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-02 11:03:49,720 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 68 [2018-02-02 11:03:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:49,721 INFO L225 Difference]: With dead ends: 72 [2018-02-02 11:03:49,721 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 11:03:49,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1481 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4460, Invalid=7750, Unknown=0, NotChecked=0, Total=12210 [2018-02-02 11:03:49,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 11:03:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-02 11:03:49,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 11:03:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-02-02 11:03:49,722 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-02-02 11:03:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:49,723 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-02-02 11:03:49,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-02 11:03:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-02-02 11:03:49,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 11:03:49,723 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:49,723 INFO L351 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:49,723 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:49,723 INFO L82 PathProgramCache]: Analyzing trace with hash -174082883, now seen corresponding path program 53 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:49,728 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:50,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:50,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-02 11:03:50,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:50,576 INFO L182 omatonBuilderFactory]: Interpolants [11392#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 11393#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 11394#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 11395#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 11396#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 11397#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 11398#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 11399#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 11400#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 11401#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 11402#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 11403#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 11404#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 11405#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 11406#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 11407#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 11408#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 11409#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 11410#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 11411#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 11412#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 11413#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 11414#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 11415#(<= |#Ultimate.C_memset_#t~loopctr5| 50), 11416#(<= |#Ultimate.C_memset_#t~loopctr5| 51), 11417#(<= |#Ultimate.C_memset_#t~loopctr5| 52), 11418#(<= |#Ultimate.C_memset_#t~loopctr5| 53), 11419#(not (= 80 |#Ultimate.C_memset_#amount|)), 11301#true, 11302#false, 11364#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 11365#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 11366#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 11367#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 11368#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 11369#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 11370#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 11371#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 11372#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 11373#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 11374#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 11375#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 11376#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 11377#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 11378#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 11379#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 11380#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 11381#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 11382#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 11383#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 11384#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 11385#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 11386#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 11387#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 11388#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 11389#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 11390#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 11391#(<= |#Ultimate.C_memset_#t~loopctr5| 26)] [2018-02-02 11:03:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:50,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-02 11:03:50,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-02 11:03:50,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1763, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 11:03:50,577 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 58 states. [2018-02-02 11:03:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:51,617 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-02-02 11:03:51,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-02 11:03:51,617 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 69 [2018-02-02 11:03:51,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:51,617 INFO L225 Difference]: With dead ends: 73 [2018-02-02 11:03:51,618 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 11:03:51,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4625, Invalid=8031, Unknown=0, NotChecked=0, Total=12656 [2018-02-02 11:03:51,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 11:03:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-02 11:03:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 11:03:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-02-02 11:03:51,620 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-02-02 11:03:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:51,620 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-02-02 11:03:51,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-02 11:03:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-02-02 11:03:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 11:03:51,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:51,621 INFO L351 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:51,621 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:51,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1685879432, now seen corresponding path program 54 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:51,624 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:52,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:52,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-02 11:03:52,394 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:52,394 INFO L182 omatonBuilderFactory]: Interpolants [11776#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 11777#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 11778#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 11779#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 11780#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 11781#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 11782#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 11783#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 11784#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 11785#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 11786#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 11787#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 11788#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 11789#(<= |#Ultimate.C_memset_#t~loopctr5| 50), 11790#(<= |#Ultimate.C_memset_#t~loopctr5| 51), 11791#(<= |#Ultimate.C_memset_#t~loopctr5| 52), 11792#(<= |#Ultimate.C_memset_#t~loopctr5| 53), 11793#(<= |#Ultimate.C_memset_#t~loopctr5| 54), 11794#(not (= 80 |#Ultimate.C_memset_#amount|)), 11674#true, 11675#false, 11738#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 11739#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 11740#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 11741#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 11742#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 11743#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 11744#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 11745#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 11746#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 11747#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 11748#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 11749#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 11750#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 11751#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 11752#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 11753#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 11754#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 11755#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 11756#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 11757#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 11758#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 11759#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 11760#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 11761#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 11762#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 11763#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 11764#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 11765#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 11766#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 11767#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 11768#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 11769#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 11770#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 11771#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 11772#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 11773#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 11774#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 11775#(<= |#Ultimate.C_memset_#t~loopctr5| 36)] [2018-02-02 11:03:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:52,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-02 11:03:52,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-02 11:03:52,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1823, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 11:03:52,395 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 59 states. [2018-02-02 11:03:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:53,458 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-02-02 11:03:53,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-02 11:03:53,459 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 70 [2018-02-02 11:03:53,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:53,459 INFO L225 Difference]: With dead ends: 74 [2018-02-02 11:03:53,459 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 11:03:53,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1592 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4793, Invalid=8317, Unknown=0, NotChecked=0, Total=13110 [2018-02-02 11:03:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 11:03:53,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-02 11:03:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 11:03:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-02-02 11:03:53,461 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-02-02 11:03:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:53,461 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-02-02 11:03:53,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-02 11:03:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-02-02 11:03:53,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 11:03:53,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:53,462 INFO L351 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:53,462 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:53,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1306932195, now seen corresponding path program 55 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:53,468 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:54,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:54,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-02 11:03:54,273 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:54,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:54,274 INFO L182 omatonBuilderFactory]: Interpolants [12160#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 12161#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 12162#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 12163#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 12164#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 12165#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 12166#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 12167#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 12168#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 12169#(<= |#Ultimate.C_memset_#t~loopctr5| 50), 12170#(<= |#Ultimate.C_memset_#t~loopctr5| 51), 12171#(<= |#Ultimate.C_memset_#t~loopctr5| 52), 12172#(<= |#Ultimate.C_memset_#t~loopctr5| 53), 12173#(<= |#Ultimate.C_memset_#t~loopctr5| 54), 12174#(<= |#Ultimate.C_memset_#t~loopctr5| 55), 12175#(not (= 80 |#Ultimate.C_memset_#amount|)), 12053#true, 12054#false, 12118#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 12119#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 12120#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 12121#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 12122#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 12123#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 12124#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 12125#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 12126#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 12127#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 12128#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 12129#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 12130#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 12131#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 12132#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 12133#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 12134#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 12135#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 12136#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 12137#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 12138#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 12139#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 12140#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 12141#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 12142#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 12143#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 12144#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 12145#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 12146#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 12147#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 12148#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 12149#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 12150#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 12151#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 12152#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 12153#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 12154#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 12155#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 12156#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 12157#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 12158#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 12159#(<= |#Ultimate.C_memset_#t~loopctr5| 40)] [2018-02-02 11:03:54,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:54,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-02 11:03:54,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-02 11:03:54,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1884, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 11:03:54,275 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 60 states. [2018-02-02 11:03:55,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:55,392 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-02-02 11:03:55,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-02 11:03:55,392 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 71 [2018-02-02 11:03:55,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:55,393 INFO L225 Difference]: With dead ends: 75 [2018-02-02 11:03:55,393 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 11:03:55,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1649 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4964, Invalid=8608, Unknown=0, NotChecked=0, Total=13572 [2018-02-02 11:03:55,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 11:03:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-02 11:03:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 11:03:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-02-02 11:03:55,394 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-02-02 11:03:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:55,394 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-02-02 11:03:55,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-02 11:03:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-02-02 11:03:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 11:03:55,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:55,395 INFO L351 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:55,395 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:55,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1850497560, now seen corresponding path program 56 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:55,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:56,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:56,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-02 11:03:56,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:56,219 INFO L182 omatonBuilderFactory]: Interpolants [12544#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 12545#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 12546#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 12547#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 12548#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 12549#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 12550#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 12551#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 12552#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 12553#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 12554#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 12555#(<= |#Ultimate.C_memset_#t~loopctr5| 50), 12556#(<= |#Ultimate.C_memset_#t~loopctr5| 51), 12557#(<= |#Ultimate.C_memset_#t~loopctr5| 52), 12558#(<= |#Ultimate.C_memset_#t~loopctr5| 53), 12559#(<= |#Ultimate.C_memset_#t~loopctr5| 54), 12560#(<= |#Ultimate.C_memset_#t~loopctr5| 55), 12561#(<= |#Ultimate.C_memset_#t~loopctr5| 56), 12562#(not (= 80 |#Ultimate.C_memset_#amount|)), 12438#true, 12439#false, 12504#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 12505#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 12506#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 12507#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 12508#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 12509#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 12510#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 12511#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 12512#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 12513#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 12514#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 12515#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 12516#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 12517#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 12518#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 12519#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 12520#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 12521#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 12522#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 12523#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 12524#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 12525#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 12526#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 12527#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 12528#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 12529#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 12530#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 12531#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 12532#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 12533#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 12534#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 12535#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 12536#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 12537#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 12538#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 12539#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 12540#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 12541#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 12542#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 12543#(<= |#Ultimate.C_memset_#t~loopctr5| 38)] [2018-02-02 11:03:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:56,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-02 11:03:56,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-02 11:03:56,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1946, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 11:03:56,220 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 61 states. [2018-02-02 11:03:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:57,312 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-02-02 11:03:57,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-02 11:03:57,313 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 72 [2018-02-02 11:03:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:57,313 INFO L225 Difference]: With dead ends: 76 [2018-02-02 11:03:57,313 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 11:03:57,313 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5138, Invalid=8904, Unknown=0, NotChecked=0, Total=14042 [2018-02-02 11:03:57,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 11:03:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-02 11:03:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 11:03:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-02-02 11:03:57,315 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-02-02 11:03:57,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:57,315 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-02-02 11:03:57,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-02 11:03:57,315 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-02-02 11:03:57,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 11:03:57,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:57,316 INFO L351 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:57,316 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:57,316 INFO L82 PathProgramCache]: Analyzing trace with hash 946572157, now seen corresponding path program 57 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:57,319 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:58,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:03:58,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-02 11:03:58,135 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:03:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:58,135 INFO L182 omatonBuilderFactory]: Interpolants [12928#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 12929#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 12930#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 12931#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 12932#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 12933#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 12934#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 12935#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 12936#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 12937#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 12938#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 12939#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 12940#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 12941#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 12942#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 12943#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 12944#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 12945#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 12946#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 12947#(<= |#Ultimate.C_memset_#t~loopctr5| 50), 12948#(<= |#Ultimate.C_memset_#t~loopctr5| 51), 12949#(<= |#Ultimate.C_memset_#t~loopctr5| 52), 12950#(<= |#Ultimate.C_memset_#t~loopctr5| 53), 12951#(<= |#Ultimate.C_memset_#t~loopctr5| 54), 12952#(<= |#Ultimate.C_memset_#t~loopctr5| 55), 12953#(<= |#Ultimate.C_memset_#t~loopctr5| 56), 12954#(<= |#Ultimate.C_memset_#t~loopctr5| 57), 12955#(not (= 80 |#Ultimate.C_memset_#amount|)), 12829#true, 12830#false, 12896#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 12897#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 12898#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 12899#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 12900#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 12901#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 12902#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 12903#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 12904#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 12905#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 12906#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 12907#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 12908#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 12909#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 12910#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 12911#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 12912#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 12913#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 12914#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 12915#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 12916#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 12917#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 12918#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 12919#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 12920#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 12921#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 12922#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 12923#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 12924#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 12925#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 12926#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 12927#(<= |#Ultimate.C_memset_#t~loopctr5| 30)] [2018-02-02 11:03:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:03:58,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-02 11:03:58,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-02 11:03:58,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=2009, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 11:03:58,136 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 62 states. [2018-02-02 11:03:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:03:59,308 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-02-02 11:03:59,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-02 11:03:59,309 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 73 [2018-02-02 11:03:59,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:03:59,309 INFO L225 Difference]: With dead ends: 77 [2018-02-02 11:03:59,309 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 11:03:59,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1766 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5315, Invalid=9205, Unknown=0, NotChecked=0, Total=14520 [2018-02-02 11:03:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 11:03:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-02 11:03:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 11:03:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-02-02 11:03:59,312 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-02-02 11:03:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:03:59,312 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-02-02 11:03:59,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-02 11:03:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-02-02 11:03:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 11:03:59,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:03:59,313 INFO L351 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:03:59,313 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:03:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1305311560, now seen corresponding path program 58 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:03:59,316 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:03:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:03:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:00,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:00,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:04:00,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-02 11:04:00,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:00,226 INFO L182 omatonBuilderFactory]: Interpolants [13312#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 13313#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 13314#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 13315#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 13316#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 13317#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 13318#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 13319#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 13320#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 13321#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 13322#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 13323#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 13324#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 13325#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 13326#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 13327#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 13328#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 13329#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 13330#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 13331#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 13332#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 13333#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 13334#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 13335#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 13336#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 13337#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 13338#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 13339#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 13340#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 13341#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 13342#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 13343#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 13344#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 13345#(<= |#Ultimate.C_memset_#t~loopctr5| 50), 13346#(<= |#Ultimate.C_memset_#t~loopctr5| 51), 13347#(<= |#Ultimate.C_memset_#t~loopctr5| 52), 13348#(<= |#Ultimate.C_memset_#t~loopctr5| 53), 13349#(<= |#Ultimate.C_memset_#t~loopctr5| 54), 13350#(<= |#Ultimate.C_memset_#t~loopctr5| 55), 13351#(<= |#Ultimate.C_memset_#t~loopctr5| 56), 13352#(<= |#Ultimate.C_memset_#t~loopctr5| 57), 13353#(<= |#Ultimate.C_memset_#t~loopctr5| 58), 13226#true, 13354#(not (= 80 |#Ultimate.C_memset_#amount|)), 13227#false, 13294#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 13295#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 13296#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 13297#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 13298#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 13299#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 13300#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 13301#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 13302#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 13303#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 13304#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 13305#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 13306#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 13307#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 13308#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 13309#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 13310#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 13311#(<= |#Ultimate.C_memset_#t~loopctr5| 16)] [2018-02-02 11:04:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:00,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-02 11:04:00,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-02 11:04:00,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=2073, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 11:04:00,227 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 63 states. [2018-02-02 11:04:01,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:01,394 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-02-02 11:04:01,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-02 11:04:01,395 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 74 [2018-02-02 11:04:01,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:01,395 INFO L225 Difference]: With dead ends: 78 [2018-02-02 11:04:01,395 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 11:04:01,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5495, Invalid=9511, Unknown=0, NotChecked=0, Total=15006 [2018-02-02 11:04:01,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 11:04:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-02 11:04:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 11:04:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-02-02 11:04:01,397 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-02-02 11:04:01,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:01,397 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-02-02 11:04:01,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-02 11:04:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-02-02 11:04:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 11:04:01,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:01,398 INFO L351 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:04:01,398 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:04:01,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1900737245, now seen corresponding path program 59 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:01,400 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:02,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:04:02,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-02-02 11:04:02,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:02,626 INFO L182 omatonBuilderFactory]: Interpolants [13698#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 13699#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 13700#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 13701#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 13702#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 13703#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 13704#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 13705#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 13706#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 13707#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 13708#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 13709#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 13710#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 13711#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 13712#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 13713#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 13714#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 13715#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 13716#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 13717#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 13718#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 13719#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 13720#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 13721#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 13722#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 13723#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 13724#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 13725#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 13726#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 13727#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 13728#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 13729#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 13730#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 13731#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 13732#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 13733#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 13734#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 13735#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 13736#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 13737#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 13738#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 13739#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 13740#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 13741#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 13742#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 13743#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 13744#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 13745#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 13746#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 13747#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 13748#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 13749#(<= |#Ultimate.C_memset_#t~loopctr5| 50), 13750#(<= |#Ultimate.C_memset_#t~loopctr5| 51), 13751#(<= |#Ultimate.C_memset_#t~loopctr5| 52), 13752#(<= |#Ultimate.C_memset_#t~loopctr5| 53), 13753#(<= |#Ultimate.C_memset_#t~loopctr5| 54), 13754#(<= |#Ultimate.C_memset_#t~loopctr5| 55), 13755#(<= |#Ultimate.C_memset_#t~loopctr5| 56), 13756#(<= |#Ultimate.C_memset_#t~loopctr5| 57), 13629#true, 13757#(<= |#Ultimate.C_memset_#t~loopctr5| 58), 13630#false, 13758#(<= |#Ultimate.C_memset_#t~loopctr5| 59), 13759#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:04:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:02,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-02 11:04:02,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-02 11:04:02,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2138, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 11:04:02,627 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 64 states. [2018-02-02 11:04:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:04,381 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-02-02 11:04:04,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-02 11:04:04,381 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 75 [2018-02-02 11:04:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:04,382 INFO L225 Difference]: With dead ends: 79 [2018-02-02 11:04:04,382 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 11:04:04,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1887 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=5678, Invalid=9822, Unknown=0, NotChecked=0, Total=15500 [2018-02-02 11:04:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 11:04:04,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-02 11:04:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 11:04:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-02-02 11:04:04,383 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-02-02 11:04:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:04,383 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-02-02 11:04:04,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-02 11:04:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-02-02 11:04:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 11:04:04,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:04,384 INFO L351 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:04:04,384 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:04:04,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1790964904, now seen corresponding path program 60 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:04,386 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:05,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:05,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:04:05,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-02-02 11:04:05,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:05,371 INFO L182 omatonBuilderFactory]: Interpolants [14108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 14109#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 14110#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 14111#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 14112#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 14113#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 14114#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 14115#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 14116#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 14117#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 14118#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 14119#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 14120#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 14121#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 14122#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 14123#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 14124#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 14125#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 14126#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 14127#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 14128#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 14129#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 14130#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 14131#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 14132#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 14133#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 14134#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 14135#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 14136#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 14137#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 14138#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 14139#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 14140#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 14141#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 14142#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 14143#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 14144#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 14145#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 14146#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 14147#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 14148#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 14149#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 14150#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 14151#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 14152#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 14153#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 14154#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 14155#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 14156#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 14157#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 14158#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 14159#(<= |#Ultimate.C_memset_#t~loopctr5| 50), 14160#(<= |#Ultimate.C_memset_#t~loopctr5| 51), 14161#(<= |#Ultimate.C_memset_#t~loopctr5| 52), 14162#(<= |#Ultimate.C_memset_#t~loopctr5| 53), 14163#(<= |#Ultimate.C_memset_#t~loopctr5| 54), 14164#(<= |#Ultimate.C_memset_#t~loopctr5| 55), 14165#(<= |#Ultimate.C_memset_#t~loopctr5| 56), 14038#true, 14166#(<= |#Ultimate.C_memset_#t~loopctr5| 57), 14039#false, 14167#(<= |#Ultimate.C_memset_#t~loopctr5| 58), 14168#(<= |#Ultimate.C_memset_#t~loopctr5| 59), 14169#(<= |#Ultimate.C_memset_#t~loopctr5| 60), 14170#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:04:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:05,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-02 11:04:05,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-02 11:04:05,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2204, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 11:04:05,372 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 65 states. [2018-02-02 11:04:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:06,772 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-02-02 11:04:06,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-02 11:04:06,772 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 76 [2018-02-02 11:04:06,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:06,773 INFO L225 Difference]: With dead ends: 80 [2018-02-02 11:04:06,773 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 11:04:06,773 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1949 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5864, Invalid=10138, Unknown=0, NotChecked=0, Total=16002 [2018-02-02 11:04:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 11:04:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-02 11:04:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 11:04:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-02-02 11:04:06,775 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-02-02 11:04:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:06,775 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-02-02 11:04:06,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-02 11:04:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-02-02 11:04:06,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 11:04:06,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:06,776 INFO L351 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:04:06,776 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:04:06,776 INFO L82 PathProgramCache]: Analyzing trace with hash -269614531, now seen corresponding path program 61 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:06,780 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:07,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:04:07,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-02-02 11:04:07,790 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:07,790 INFO L182 omatonBuilderFactory]: Interpolants [14524#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 14525#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 14526#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 14527#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 14528#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 14529#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 14530#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 14531#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 14532#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 14533#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 14534#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 14535#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 14536#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 14537#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 14538#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 14539#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 14540#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 14541#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 14542#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 14543#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 14544#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 14545#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 14546#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 14547#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 14548#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 14549#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 14550#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 14551#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 14552#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 14553#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 14554#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 14555#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 14556#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 14557#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 14558#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 14559#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 14560#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 14561#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 14562#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 14563#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 14564#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 14565#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 14566#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 14567#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 14568#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 14569#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 14570#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 14571#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 14572#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 14573#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 14574#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 14575#(<= |#Ultimate.C_memset_#t~loopctr5| 50), 14576#(<= |#Ultimate.C_memset_#t~loopctr5| 51), 14577#(<= |#Ultimate.C_memset_#t~loopctr5| 52), 14578#(<= |#Ultimate.C_memset_#t~loopctr5| 53), 14579#(<= |#Ultimate.C_memset_#t~loopctr5| 54), 14580#(<= |#Ultimate.C_memset_#t~loopctr5| 55), 14453#true, 14581#(<= |#Ultimate.C_memset_#t~loopctr5| 56), 14454#false, 14582#(<= |#Ultimate.C_memset_#t~loopctr5| 57), 14583#(<= |#Ultimate.C_memset_#t~loopctr5| 58), 14584#(<= |#Ultimate.C_memset_#t~loopctr5| 59), 14585#(<= |#Ultimate.C_memset_#t~loopctr5| 60), 14586#(<= |#Ultimate.C_memset_#t~loopctr5| 61), 14587#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:04:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:07,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-02 11:04:07,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-02 11:04:07,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2271, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 11:04:07,792 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 66 states. [2018-02-02 11:04:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:09,152 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-02-02 11:04:09,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-02 11:04:09,152 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 77 [2018-02-02 11:04:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:09,152 INFO L225 Difference]: With dead ends: 81 [2018-02-02 11:04:09,152 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 11:04:09,153 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2012 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=6053, Invalid=10459, Unknown=0, NotChecked=0, Total=16512 [2018-02-02 11:04:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 11:04:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-02-02 11:04:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 11:04:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-02-02 11:04:09,154 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-02-02 11:04:09,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:09,154 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-02-02 11:04:09,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-02 11:04:09,154 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-02-02 11:04:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 11:04:09,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:09,154 INFO L351 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:04:09,154 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:04:09,155 INFO L82 PathProgramCache]: Analyzing trace with hash -352393224, now seen corresponding path program 62 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:09,157 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:10,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:04:10,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-02-02 11:04:10,296 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:10,296 INFO L182 omatonBuilderFactory]: Interpolants [14976#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 14977#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 14978#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 14979#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 14980#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 14981#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 14982#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 14983#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 14984#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 14985#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 14986#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 14987#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 14988#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 14989#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 14990#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 14991#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 14992#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 14993#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 14994#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 14995#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 14996#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 14997#(<= |#Ultimate.C_memset_#t~loopctr5| 50), 14998#(<= |#Ultimate.C_memset_#t~loopctr5| 51), 14999#(<= |#Ultimate.C_memset_#t~loopctr5| 52), 15000#(<= |#Ultimate.C_memset_#t~loopctr5| 53), 15001#(<= |#Ultimate.C_memset_#t~loopctr5| 54), 14874#true, 15002#(<= |#Ultimate.C_memset_#t~loopctr5| 55), 14875#false, 15003#(<= |#Ultimate.C_memset_#t~loopctr5| 56), 15004#(<= |#Ultimate.C_memset_#t~loopctr5| 57), 15005#(<= |#Ultimate.C_memset_#t~loopctr5| 58), 15006#(<= |#Ultimate.C_memset_#t~loopctr5| 59), 15007#(<= |#Ultimate.C_memset_#t~loopctr5| 60), 15008#(<= |#Ultimate.C_memset_#t~loopctr5| 61), 15009#(<= |#Ultimate.C_memset_#t~loopctr5| 62), 15010#(not (= 80 |#Ultimate.C_memset_#amount|)), 14946#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 14947#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 14948#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 14949#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 14950#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 14951#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 14952#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 14953#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 14954#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 14955#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 14956#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 14957#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 14958#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 14959#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 14960#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 14961#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 14962#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 14963#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 14964#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 14965#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 14966#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 14967#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 14968#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 14969#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 14970#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 14971#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 14972#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 14973#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 14974#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 14975#(<= |#Ultimate.C_memset_#t~loopctr5| 28)] [2018-02-02 11:04:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:10,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-02 11:04:10,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-02 11:04:10,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2339, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 11:04:10,297 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 67 states. [2018-02-02 11:04:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:11,719 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-02-02 11:04:11,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-02 11:04:11,719 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 78 [2018-02-02 11:04:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:11,720 INFO L225 Difference]: With dead ends: 82 [2018-02-02 11:04:11,720 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 11:04:11,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2076 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=6245, Invalid=10785, Unknown=0, NotChecked=0, Total=17030 [2018-02-02 11:04:11,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 11:04:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-02 11:04:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 11:04:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-02-02 11:04:11,722 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-02-02 11:04:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:11,722 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-02-02 11:04:11,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-02 11:04:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-02-02 11:04:11,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 11:04:11,723 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:11,723 INFO L351 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:04:11,723 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:04:11,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1376434589, now seen corresponding path program 63 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:11,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:12,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:04:12,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-02-02 11:04:12,748 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:12,749 INFO L182 omatonBuilderFactory]: Interpolants [15374#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 15375#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 15376#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 15377#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 15378#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 15379#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 15380#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 15381#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 15382#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 15383#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 15384#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 15385#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 15386#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 15387#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 15388#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 15389#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 15390#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 15391#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 15392#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 15393#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 15394#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 15395#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 15396#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 15397#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 15398#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 15399#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 15400#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 15401#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 15402#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 15403#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 15404#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 15405#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 15406#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 15407#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 15408#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 15409#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 15410#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 15411#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 15412#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 15413#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 15414#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 15415#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 15416#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 15417#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 15418#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 15419#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 15420#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 15421#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 15422#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 15423#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 15424#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 15425#(<= |#Ultimate.C_memset_#t~loopctr5| 50), 15426#(<= |#Ultimate.C_memset_#t~loopctr5| 51), 15427#(<= |#Ultimate.C_memset_#t~loopctr5| 52), 15428#(<= |#Ultimate.C_memset_#t~loopctr5| 53), 15301#true, 15429#(<= |#Ultimate.C_memset_#t~loopctr5| 54), 15302#false, 15430#(<= |#Ultimate.C_memset_#t~loopctr5| 55), 15431#(<= |#Ultimate.C_memset_#t~loopctr5| 56), 15432#(<= |#Ultimate.C_memset_#t~loopctr5| 57), 15433#(<= |#Ultimate.C_memset_#t~loopctr5| 58), 15434#(<= |#Ultimate.C_memset_#t~loopctr5| 59), 15435#(<= |#Ultimate.C_memset_#t~loopctr5| 60), 15436#(<= |#Ultimate.C_memset_#t~loopctr5| 61), 15437#(<= |#Ultimate.C_memset_#t~loopctr5| 62), 15438#(<= |#Ultimate.C_memset_#t~loopctr5| 63), 15439#(not (= 80 |#Ultimate.C_memset_#amount|))] [2018-02-02 11:04:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:12,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-02 11:04:12,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-02 11:04:12,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2408, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 11:04:12,750 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 68 states. [2018-02-02 11:04:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:14,296 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-02-02 11:04:14,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-02 11:04:14,296 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 79 [2018-02-02 11:04:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:14,296 INFO L225 Difference]: With dead ends: 83 [2018-02-02 11:04:14,297 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 11:04:14,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2141 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=6440, Invalid=11116, Unknown=0, NotChecked=0, Total=17556 [2018-02-02 11:04:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 11:04:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-02 11:04:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 11:04:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-02-02 11:04:14,298 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-02-02 11:04:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:14,298 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-02-02 11:04:14,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-02 11:04:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-02-02 11:04:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 11:04:14,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:14,299 INFO L351 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:04:14,299 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:04:14,299 INFO L82 PathProgramCache]: Analyzing trace with hash -864478056, now seen corresponding path program 64 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:14,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:15,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:04:15,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-02-02 11:04:15,466 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:04:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:15,467 INFO L182 omatonBuilderFactory]: Interpolants [15872#(<= |#Ultimate.C_memset_#t~loopctr5| 63), 15873#(<= |#Ultimate.C_memset_#t~loopctr5| 64), 15874#(not (= 80 |#Ultimate.C_memset_#amount|)), 15808#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 15809#(= 0 |#Ultimate.C_memset_#t~loopctr5|), 15810#(= 1 |#Ultimate.C_memset_#t~loopctr5|), 15811#(<= |#Ultimate.C_memset_#t~loopctr5| 2), 15812#(<= |#Ultimate.C_memset_#t~loopctr5| 3), 15813#(<= |#Ultimate.C_memset_#t~loopctr5| 4), 15814#(<= |#Ultimate.C_memset_#t~loopctr5| 5), 15815#(<= |#Ultimate.C_memset_#t~loopctr5| 6), 15816#(<= |#Ultimate.C_memset_#t~loopctr5| 7), 15817#(<= |#Ultimate.C_memset_#t~loopctr5| 8), 15818#(<= |#Ultimate.C_memset_#t~loopctr5| 9), 15819#(<= |#Ultimate.C_memset_#t~loopctr5| 10), 15820#(<= |#Ultimate.C_memset_#t~loopctr5| 11), 15821#(<= |#Ultimate.C_memset_#t~loopctr5| 12), 15822#(<= |#Ultimate.C_memset_#t~loopctr5| 13), 15823#(<= |#Ultimate.C_memset_#t~loopctr5| 14), 15824#(<= |#Ultimate.C_memset_#t~loopctr5| 15), 15825#(<= |#Ultimate.C_memset_#t~loopctr5| 16), 15826#(<= |#Ultimate.C_memset_#t~loopctr5| 17), 15827#(<= |#Ultimate.C_memset_#t~loopctr5| 18), 15828#(<= |#Ultimate.C_memset_#t~loopctr5| 19), 15829#(<= |#Ultimate.C_memset_#t~loopctr5| 20), 15830#(<= |#Ultimate.C_memset_#t~loopctr5| 21), 15831#(<= |#Ultimate.C_memset_#t~loopctr5| 22), 15832#(<= |#Ultimate.C_memset_#t~loopctr5| 23), 15833#(<= |#Ultimate.C_memset_#t~loopctr5| 24), 15834#(<= |#Ultimate.C_memset_#t~loopctr5| 25), 15835#(<= |#Ultimate.C_memset_#t~loopctr5| 26), 15836#(<= |#Ultimate.C_memset_#t~loopctr5| 27), 15837#(<= |#Ultimate.C_memset_#t~loopctr5| 28), 15838#(<= |#Ultimate.C_memset_#t~loopctr5| 29), 15839#(<= |#Ultimate.C_memset_#t~loopctr5| 30), 15840#(<= |#Ultimate.C_memset_#t~loopctr5| 31), 15841#(<= |#Ultimate.C_memset_#t~loopctr5| 32), 15842#(<= |#Ultimate.C_memset_#t~loopctr5| 33), 15843#(<= |#Ultimate.C_memset_#t~loopctr5| 34), 15844#(<= |#Ultimate.C_memset_#t~loopctr5| 35), 15845#(<= |#Ultimate.C_memset_#t~loopctr5| 36), 15846#(<= |#Ultimate.C_memset_#t~loopctr5| 37), 15847#(<= |#Ultimate.C_memset_#t~loopctr5| 38), 15848#(<= |#Ultimate.C_memset_#t~loopctr5| 39), 15849#(<= |#Ultimate.C_memset_#t~loopctr5| 40), 15850#(<= |#Ultimate.C_memset_#t~loopctr5| 41), 15851#(<= |#Ultimate.C_memset_#t~loopctr5| 42), 15852#(<= |#Ultimate.C_memset_#t~loopctr5| 43), 15853#(<= |#Ultimate.C_memset_#t~loopctr5| 44), 15854#(<= |#Ultimate.C_memset_#t~loopctr5| 45), 15855#(<= |#Ultimate.C_memset_#t~loopctr5| 46), 15856#(<= |#Ultimate.C_memset_#t~loopctr5| 47), 15857#(<= |#Ultimate.C_memset_#t~loopctr5| 48), 15858#(<= |#Ultimate.C_memset_#t~loopctr5| 49), 15859#(<= |#Ultimate.C_memset_#t~loopctr5| 50), 15860#(<= |#Ultimate.C_memset_#t~loopctr5| 51), 15861#(<= |#Ultimate.C_memset_#t~loopctr5| 52), 15734#true, 15862#(<= |#Ultimate.C_memset_#t~loopctr5| 53), 15735#false, 15863#(<= |#Ultimate.C_memset_#t~loopctr5| 54), 15864#(<= |#Ultimate.C_memset_#t~loopctr5| 55), 15865#(<= |#Ultimate.C_memset_#t~loopctr5| 56), 15866#(<= |#Ultimate.C_memset_#t~loopctr5| 57), 15867#(<= |#Ultimate.C_memset_#t~loopctr5| 58), 15868#(<= |#Ultimate.C_memset_#t~loopctr5| 59), 15869#(<= |#Ultimate.C_memset_#t~loopctr5| 60), 15870#(<= |#Ultimate.C_memset_#t~loopctr5| 61), 15871#(<= |#Ultimate.C_memset_#t~loopctr5| 62)] [2018-02-02 11:04:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:04:15,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-02 11:04:15,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-02 11:04:15,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2478, Unknown=0, NotChecked=0, Total=4692 [2018-02-02 11:04:15,468 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 69 states. [2018-02-02 11:04:16,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:04:16,983 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-02-02 11:04:16,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-02 11:04:16,983 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 80 [2018-02-02 11:04:16,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:04:16,983 INFO L225 Difference]: With dead ends: 84 [2018-02-02 11:04:16,983 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 11:04:16,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2207 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=6638, Invalid=11452, Unknown=0, NotChecked=0, Total=18090 [2018-02-02 11:04:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 11:04:16,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-02 11:04:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 11:04:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-02-02 11:04:16,985 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-02-02 11:04:16,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:04:16,985 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-02-02 11:04:16,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-02 11:04:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-02-02 11:04:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 11:04:16,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:04:16,986 INFO L351 BasicCegarLoop]: trace histogram [65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:04:16,986 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 11:04:16,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1613293315, now seen corresponding path program 65 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:04:16,989 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:04:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:04:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-02-02 11:04:17,409 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 11:04:17,412 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 11:04:17,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 11:04:17 BoogieIcfgContainer [2018-02-02 11:04:17,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 11:04:17,413 INFO L168 Benchmark]: Toolchain (without parser) took 67613.76 ms. Allocated memory was 402.7 MB in the beginning and 1.1 GB in the end (delta: 703.6 MB). Free memory was 360.6 MB in the beginning and 895.6 MB in the end (delta: -535.0 MB). Peak memory consumption was 168.6 MB. Max. memory is 5.3 GB. [2018-02-02 11:04:17,414 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 11:04:17,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.16 ms. Allocated memory is still 402.7 MB. Free memory was 360.6 MB in the beginning and 352.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-02 11:04:17,414 INFO L168 Benchmark]: Boogie Preprocessor took 24.97 ms. Allocated memory is still 402.7 MB. Free memory was 352.6 MB in the beginning and 351.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 11:04:17,414 INFO L168 Benchmark]: RCFGBuilder took 123.07 ms. Allocated memory is still 402.7 MB. Free memory was 351.3 MB in the beginning and 338.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 11:04:17,414 INFO L168 Benchmark]: TraceAbstraction took 67317.55 ms. Allocated memory was 402.7 MB in the beginning and 1.1 GB in the end (delta: 703.6 MB). Free memory was 336.7 MB in the beginning and 895.6 MB in the end (delta: -558.8 MB). Peak memory consumption was 144.8 MB. Max. memory is 5.3 GB. [2018-02-02 11:04:17,415 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 145.16 ms. Allocated memory is still 402.7 MB. Free memory was 360.6 MB in the beginning and 352.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.97 ms. Allocated memory is still 402.7 MB. Free memory was 352.6 MB in the beginning and 351.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 123.07 ms. Allocated memory is still 402.7 MB. Free memory was 351.3 MB in the beginning and 338.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 67317.55 ms. Allocated memory was 402.7 MB in the beginning and 1.1 GB in the end (delta: 703.6 MB). Free memory was 336.7 MB in the beginning and 895.6 MB in the end (delta: -558.8 MB). Peak memory consumption was 144.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 65, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 38 known predicates. - TimeoutResultAtElement [Line: 25]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 25). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 65, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 38 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 65, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 38 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 3 error locations. TIMEOUT Result, 67.2s OverallTime, 68 OverallIterations, 65 TraceHistogramMax, 38.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 808 SDtfs, 599 SDslu, 16269 SDs, 0 SdLazy, 11520 SolverSat, 2431 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4822 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 4493 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 49855 ImplicationChecksByTransitivity, 55.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/45760 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 67 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 25.8s InterpolantComputationTime, 3134 NumberOfCodeBlocks, 3134 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 3067 ConstructedInterpolants, 2 QuantifiedInterpolants, 460248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 3 PerfectInterpolantSequences, 0/45760 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/memset_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_11-04-17-420.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memset_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_11-04-17-420.csv Completed graceful shutdown