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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:39:01,164 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:39:01,166 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:39:01,190 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:39:01,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:39:01,192 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:39:01,193 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:39:01,196 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:39:01,198 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:39:01,199 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:39:01,211 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:39:01,211 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:39:01,212 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:39:01,213 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:39:01,214 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:39:01,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:39:01,222 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:39:01,224 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:39:01,225 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:39:01,229 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:39:01,231 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:39:01,232 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:39:01,232 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:39:01,237 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:39:01,238 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:39:01,239 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:39:01,239 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:39:01,240 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:39:01,240 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:39:01,243 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:39:01,244 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:39:01,244 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:39:01,259 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:39:01,259 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:39:01,260 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:39:01,260 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:39:01,260 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:39:01,261 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:39:01,261 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:39:01,261 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:39:01,262 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:39:01,262 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:39:01,267 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:39:01,267 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:39:01,268 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:39:01,268 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:39:01,268 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:39:01,268 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:39:01,268 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:39:01,268 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:39:01,269 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:39:01,269 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:39:01,269 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:39:01,269 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:39:01,269 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:39:01,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:39:01,270 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:39:01,270 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:39:01,270 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:39:01,270 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:39:01,270 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:39:01,271 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:39:01,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:39:01,271 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:39:01,272 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:39:01,273 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:39:01,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:39:01,335 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:39:01,341 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:39:01,342 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:39:01,343 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:39:01,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-01-31 08:39:01,501 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:39:01,511 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:39:01,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:39:01,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:39:01,519 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:39:01,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:39:01" (1/1) ... [2018-01-31 08:39:01,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a99aa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:01, skipping insertion in model container [2018-01-31 08:39:01,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:39:01" (1/1) ... [2018-01-31 08:39:01,543 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:39:01,559 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:39:01,694 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:39:01,715 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:39:01,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:01 WrapperNode [2018-01-31 08:39:01,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:39:01,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:39:01,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:39:01,727 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:39:01,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:01" (1/1) ... [2018-01-31 08:39:01,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:01" (1/1) ... [2018-01-31 08:39:01,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:01" (1/1) ... [2018-01-31 08:39:01,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:01" (1/1) ... [2018-01-31 08:39:01,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:01" (1/1) ... [2018-01-31 08:39:01,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:01" (1/1) ... [2018-01-31 08:39:01,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:01" (1/1) ... [2018-01-31 08:39:01,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:39:01,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:39:01,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:39:01,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:39:01,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:01" (1/1) ... No working directory specified, using /storage/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-01-31 08:39:01,841 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:39:01,841 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:39:01,842 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 08:39:01,842 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:39:01,842 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:39:01,842 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:39:01,842 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:39:01,842 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:39:01,843 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:39:01,843 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 08:39:01,843 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:39:01,843 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:39:01,843 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:39:02,407 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:39:02,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:39:02 BoogieIcfgContainer [2018-01-31 08:39:02,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:39:02,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:39:02,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:39:02,412 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:39:02,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:39:01" (1/3) ... [2018-01-31 08:39:02,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ab53f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:39:02, skipping insertion in model container [2018-01-31 08:39:02,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:01" (2/3) ... [2018-01-31 08:39:02,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ab53f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:39:02, skipping insertion in model container [2018-01-31 08:39:02,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:39:02" (3/3) ... [2018-01-31 08:39:02,416 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-01-31 08:39:02,425 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:39:02,430 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-31 08:39:02,473 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:39:02,474 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:39:02,474 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:39:02,474 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:39:02,474 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:39:02,474 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:39:02,475 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:39:02,475 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:39:02,475 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:39:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-31 08:39:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-31 08:39:02,518 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:02,519 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:02,520 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:02,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1628091867, now seen corresponding path program 1 times [2018-01-31 08:39:02,529 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:02,530 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:02,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:02,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:02,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:02,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:02,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:02,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:39:02,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:39:02,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:39:02,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:39:02,871 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-01-31 08:39:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:02,989 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2018-01-31 08:39:02,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:39:02,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-31 08:39:02,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:03,000 INFO L225 Difference]: With dead ends: 133 [2018-01-31 08:39:03,000 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 08:39:03,004 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:39:03,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 08:39:03,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-01-31 08:39:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-31 08:39:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-01-31 08:39:03,140 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 13 [2018-01-31 08:39:03,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:03,140 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-01-31 08:39:03,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:39:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-01-31 08:39:03,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 08:39:03,144 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:03,144 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:03,144 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:03,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1198271325, now seen corresponding path program 1 times [2018-01-31 08:39:03,145 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:03,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:03,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:03,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:03,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:03,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:03,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:03,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:39:03,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:39:03,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:39:03,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:39:03,571 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 7 states. [2018-01-31 08:39:03,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:03,907 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2018-01-31 08:39:03,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:39:03,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-01-31 08:39:03,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:03,912 INFO L225 Difference]: With dead ends: 172 [2018-01-31 08:39:03,912 INFO L226 Difference]: Without dead ends: 121 [2018-01-31 08:39:03,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:39:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-31 08:39:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2018-01-31 08:39:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 08:39:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-01-31 08:39:03,926 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 22 [2018-01-31 08:39:03,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:03,928 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-01-31 08:39:03,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:39:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-01-31 08:39:03,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:39:03,929 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:03,930 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:03,930 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:03,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1508294640, now seen corresponding path program 1 times [2018-01-31 08:39:03,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:03,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:03,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:03,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:03,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:03,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:04,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:04,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:39:04,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:39:04,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:39:04,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:39:04,021 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 5 states. [2018-01-31 08:39:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:04,101 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-01-31 08:39:04,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:39:04,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-31 08:39:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:04,102 INFO L225 Difference]: With dead ends: 88 [2018-01-31 08:39:04,103 INFO L226 Difference]: Without dead ends: 87 [2018-01-31 08:39:04,103 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:39:04,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-31 08:39:04,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-31 08:39:04,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-31 08:39:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-01-31 08:39:04,114 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 23 [2018-01-31 08:39:04,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:04,114 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-01-31 08:39:04,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:39:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-01-31 08:39:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:39:04,115 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:04,115 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:04,115 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:04,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1508294641, now seen corresponding path program 1 times [2018-01-31 08:39:04,116 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:04,116 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:04,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:04,117 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:04,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:04,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:04,537 WARN L146 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 15 DAG size of output 11 [2018-01-31 08:39:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:04,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:04,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:39:04,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:39:04,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:39:04,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:39:04,540 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 6 states. [2018-01-31 08:39:04,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:04,759 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-01-31 08:39:04,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:39:04,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-31 08:39:04,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:04,763 INFO L225 Difference]: With dead ends: 101 [2018-01-31 08:39:04,763 INFO L226 Difference]: Without dead ends: 100 [2018-01-31 08:39:04,763 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:39:04,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-31 08:39:04,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2018-01-31 08:39:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-31 08:39:04,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-01-31 08:39:04,777 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 23 [2018-01-31 08:39:04,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:04,777 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-01-31 08:39:04,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:39:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-01-31 08:39:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 08:39:04,778 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:04,779 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:04,779 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:04,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1757973218, now seen corresponding path program 1 times [2018-01-31 08:39:04,779 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:04,779 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:04,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:04,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:04,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:04,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:04,854 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:04,854 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:04,868 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:04,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:04,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:04,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-31 08:39:04,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:39:04,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:39:04,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:39:04,938 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 5 states. [2018-01-31 08:39:05,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:05,077 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2018-01-31 08:39:05,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:39:05,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-31 08:39:05,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:05,079 INFO L225 Difference]: With dead ends: 126 [2018-01-31 08:39:05,079 INFO L226 Difference]: Without dead ends: 125 [2018-01-31 08:39:05,079 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:39:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-31 08:39:05,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2018-01-31 08:39:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-31 08:39:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-01-31 08:39:05,102 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 31 [2018-01-31 08:39:05,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:05,102 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-01-31 08:39:05,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:39:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-01-31 08:39:05,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 08:39:05,103 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:05,103 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:05,104 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:05,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1337405038, now seen corresponding path program 1 times [2018-01-31 08:39:05,104 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:05,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:05,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:05,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:05,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:05,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:05,480 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 15 DAG size of output 11 [2018-01-31 08:39:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:05,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:05,539 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:05,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:05,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:05,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:39:05,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:05,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:05,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:05,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:05,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-31 08:39:05,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:39:05,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:39:05,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:39:05,760 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 8 states. [2018-01-31 08:39:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:06,339 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-01-31 08:39:06,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:39:06,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-31 08:39:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:06,341 INFO L225 Difference]: With dead ends: 125 [2018-01-31 08:39:06,341 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 08:39:06,341 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:39:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 08:39:06,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2018-01-31 08:39:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-31 08:39:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2018-01-31 08:39:06,353 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 32 [2018-01-31 08:39:06,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:06,354 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2018-01-31 08:39:06,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:39:06,354 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2018-01-31 08:39:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:39:06,355 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:06,355 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:06,356 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:06,356 INFO L82 PathProgramCache]: Analyzing trace with hash 127101827, now seen corresponding path program 2 times [2018-01-31 08:39:06,356 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:06,356 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:06,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:06,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:06,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:06,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:06,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:06,523 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-31 08:39:06,548 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:06,564 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:06,570 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:06,570 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:06,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:06,709 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:06,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:39:06,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-01-31 08:39:06,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:39:06,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:39:06,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:39:06,730 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand 18 states. [2018-01-31 08:39:07,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:07,033 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2018-01-31 08:39:07,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:39:07,033 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-01-31 08:39:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:07,034 INFO L225 Difference]: With dead ends: 193 [2018-01-31 08:39:07,034 INFO L226 Difference]: Without dead ends: 118 [2018-01-31 08:39:07,035 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:39:07,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-31 08:39:07,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 105. [2018-01-31 08:39:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-31 08:39:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-31 08:39:07,048 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 40 [2018-01-31 08:39:07,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:07,048 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-31 08:39:07,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:39:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-31 08:39:07,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 08:39:07,050 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:07,054 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:07,054 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:07,054 INFO L82 PathProgramCache]: Analyzing trace with hash 650265267, now seen corresponding path program 1 times [2018-01-31 08:39:07,054 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:07,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:07,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:07,056 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:07,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:07,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:39:07,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:07,226 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:07,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:07,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:07,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:07,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2018-01-31 08:39:07,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:39:07,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:39:07,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:39:07,436 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 12 states. [2018-01-31 08:39:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:07,671 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2018-01-31 08:39:07,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:39:07,671 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-01-31 08:39:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:07,673 INFO L225 Difference]: With dead ends: 206 [2018-01-31 08:39:07,673 INFO L226 Difference]: Without dead ends: 140 [2018-01-31 08:39:07,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:39:07,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-31 08:39:07,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 118. [2018-01-31 08:39:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-31 08:39:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-31 08:39:07,684 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 42 [2018-01-31 08:39:07,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:07,685 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-31 08:39:07,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:39:07,685 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-31 08:39:07,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-31 08:39:07,688 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:07,688 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:07,688 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:07,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1935939050, now seen corresponding path program 1 times [2018-01-31 08:39:07,688 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:07,688 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:07,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:07,689 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:07,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:07,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:07,853 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 48 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-31 08:39:07,853 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:07,853 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:07,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:07,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 48 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-31 08:39:07,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:07,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-31 08:39:07,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:39:07,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:39:07,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:39:07,954 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 7 states. [2018-01-31 08:39:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:08,078 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-01-31 08:39:08,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:39:08,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2018-01-31 08:39:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:08,081 INFO L225 Difference]: With dead ends: 139 [2018-01-31 08:39:08,081 INFO L226 Difference]: Without dead ends: 138 [2018-01-31 08:39:08,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:39:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-31 08:39:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 126. [2018-01-31 08:39:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-31 08:39:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2018-01-31 08:39:08,092 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 78 [2018-01-31 08:39:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:08,092 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2018-01-31 08:39:08,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:39:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2018-01-31 08:39:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-31 08:39:08,094 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:08,095 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:08,095 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:08,095 INFO L82 PathProgramCache]: Analyzing trace with hash 115431646, now seen corresponding path program 1 times [2018-01-31 08:39:08,095 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:08,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:08,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:08,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:08,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:08,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:09,018 WARN L146 SmtUtils]: Spent 296ms on a formula simplification. DAG size of input: 17 DAG size of output 12 [2018-01-31 08:39:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-31 08:39:09,419 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:09,419 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:09,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:09,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:09,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:39:09,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:09,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:09,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 55 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-31 08:39:09,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:09,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2018-01-31 08:39:09,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:39:09,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:39:09,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:39:09,985 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 22 states. [2018-01-31 08:39:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:11,139 INFO L93 Difference]: Finished difference Result 197 states and 207 transitions. [2018-01-31 08:39:11,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-31 08:39:11,140 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 79 [2018-01-31 08:39:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:11,141 INFO L225 Difference]: With dead ends: 197 [2018-01-31 08:39:11,142 INFO L226 Difference]: Without dead ends: 189 [2018-01-31 08:39:11,143 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=385, Invalid=1777, Unknown=0, NotChecked=0, Total=2162 [2018-01-31 08:39:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-31 08:39:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 152. [2018-01-31 08:39:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-31 08:39:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2018-01-31 08:39:11,157 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 79 [2018-01-31 08:39:11,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:11,157 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2018-01-31 08:39:11,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:39:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2018-01-31 08:39:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-31 08:39:11,159 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:11,159 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:11,159 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:11,160 INFO L82 PathProgramCache]: Analyzing trace with hash -310174977, now seen corresponding path program 2 times [2018-01-31 08:39:11,160 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:11,160 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:11,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:11,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:11,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:11,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-01-31 08:39:11,690 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:11,690 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:11,703 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:39:11,711 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:11,721 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:11,723 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:11,727 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 68 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:39:11,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:11,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 17 [2018-01-31 08:39:11,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:39:11,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:39:11,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:39:11,888 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand 17 states. [2018-01-31 08:39:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:12,445 INFO L93 Difference]: Finished difference Result 269 states and 283 transitions. [2018-01-31 08:39:12,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-31 08:39:12,445 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2018-01-31 08:39:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:12,447 INFO L225 Difference]: With dead ends: 269 [2018-01-31 08:39:12,447 INFO L226 Difference]: Without dead ends: 185 [2018-01-31 08:39:12,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 08:39:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-31 08:39:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 160. [2018-01-31 08:39:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-31 08:39:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 164 transitions. [2018-01-31 08:39:12,461 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 164 transitions. Word has length 89 [2018-01-31 08:39:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:12,461 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 164 transitions. [2018-01-31 08:39:12,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:39:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2018-01-31 08:39:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-31 08:39:12,463 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:12,463 INFO L351 BasicCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:12,464 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:12,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1033388843, now seen corresponding path program 1 times [2018-01-31 08:39:12,464 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:12,464 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:12,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:12,469 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:12,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:12,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-31 08:39:12,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:12,585 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:12,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:12,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-31 08:39:12,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:12,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-31 08:39:12,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:39:12,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:39:12,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:39:12,702 INFO L87 Difference]: Start difference. First operand 160 states and 164 transitions. Second operand 9 states. [2018-01-31 08:39:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:12,803 INFO L93 Difference]: Finished difference Result 203 states and 210 transitions. [2018-01-31 08:39:12,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:39:12,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2018-01-31 08:39:12,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:12,805 INFO L225 Difference]: With dead ends: 203 [2018-01-31 08:39:12,805 INFO L226 Difference]: Without dead ends: 183 [2018-01-31 08:39:12,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:39:12,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-31 08:39:12,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2018-01-31 08:39:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-31 08:39:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 172 transitions. [2018-01-31 08:39:12,817 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 172 transitions. Word has length 106 [2018-01-31 08:39:12,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:12,817 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 172 transitions. [2018-01-31 08:39:12,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:39:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2018-01-31 08:39:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-01-31 08:39:12,819 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:12,819 INFO L351 BasicCegarLoop]: trace histogram [11, 9, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:12,819 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:12,820 INFO L82 PathProgramCache]: Analyzing trace with hash -2126374397, now seen corresponding path program 2 times [2018-01-31 08:39:12,820 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:12,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:12,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:12,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:12,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:12,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 166 proven. 36 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-01-31 08:39:13,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:13,008 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:13,013 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:39:13,025 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:13,042 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:13,044 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:13,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 166 proven. 36 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-01-31 08:39:13,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:13,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-01-31 08:39:13,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:39:13,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:39:13,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:39:13,094 INFO L87 Difference]: Start difference. First operand 168 states and 172 transitions. Second operand 9 states. [2018-01-31 08:39:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:13,308 INFO L93 Difference]: Finished difference Result 204 states and 210 transitions. [2018-01-31 08:39:13,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:39:13,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2018-01-31 08:39:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:13,347 INFO L225 Difference]: With dead ends: 204 [2018-01-31 08:39:13,347 INFO L226 Difference]: Without dead ends: 203 [2018-01-31 08:39:13,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:39:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-31 08:39:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2018-01-31 08:39:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-31 08:39:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 181 transitions. [2018-01-31 08:39:13,356 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 181 transitions. Word has length 134 [2018-01-31 08:39:13,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:13,357 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 181 transitions. [2018-01-31 08:39:13,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:39:13,357 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 181 transitions. [2018-01-31 08:39:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-01-31 08:39:13,358 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:13,358 INFO L351 BasicCegarLoop]: trace histogram [11, 9, 9, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:13,358 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:13,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1493096815, now seen corresponding path program 2 times [2018-01-31 08:39:13,359 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:13,359 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:13,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:13,360 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:13,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:13,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:14,029 WARN L146 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 13 DAG size of output 9 [2018-01-31 08:39:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 181 proven. 39 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-01-31 08:39:14,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:14,218 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:14,223 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:39:14,235 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:14,252 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:14,265 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:14,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:14,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:39:14,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:14,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:14,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 181 proven. 39 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-01-31 08:39:14,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:14,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 12 [2018-01-31 08:39:14,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:39:14,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:39:14,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:39:14,647 INFO L87 Difference]: Start difference. First operand 176 states and 181 transitions. Second operand 13 states. [2018-01-31 08:39:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:15,046 INFO L93 Difference]: Finished difference Result 203 states and 209 transitions. [2018-01-31 08:39:15,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:39:15,047 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 135 [2018-01-31 08:39:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:15,048 INFO L225 Difference]: With dead ends: 203 [2018-01-31 08:39:15,048 INFO L226 Difference]: Without dead ends: 202 [2018-01-31 08:39:15,048 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:39:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-31 08:39:15,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 177. [2018-01-31 08:39:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-31 08:39:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 182 transitions. [2018-01-31 08:39:15,057 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 182 transitions. Word has length 135 [2018-01-31 08:39:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:15,057 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 182 transitions. [2018-01-31 08:39:15,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:39:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 182 transitions. [2018-01-31 08:39:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-01-31 08:39:15,059 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:15,059 INFO L351 BasicCegarLoop]: trace histogram [12, 10, 9, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:15,060 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:15,060 INFO L82 PathProgramCache]: Analyzing trace with hash -354266750, now seen corresponding path program 3 times [2018-01-31 08:39:15,060 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:15,060 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:15,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:15,061 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:15,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:15,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 247 proven. 45 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-01-31 08:39:15,371 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:15,371 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:15,376 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:39:15,388 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:15,392 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:15,400 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:15,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 229 proven. 27 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-01-31 08:39:15,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:15,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 26 [2018-01-31 08:39:15,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-31 08:39:15,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-31 08:39:15,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:39:15,574 INFO L87 Difference]: Start difference. First operand 177 states and 182 transitions. Second operand 27 states. [2018-01-31 08:39:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:16,185 INFO L93 Difference]: Finished difference Result 239 states and 248 transitions. [2018-01-31 08:39:16,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-31 08:39:16,185 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 143 [2018-01-31 08:39:16,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:16,187 INFO L225 Difference]: With dead ends: 239 [2018-01-31 08:39:16,187 INFO L226 Difference]: Without dead ends: 238 [2018-01-31 08:39:16,188 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=494, Invalid=2158, Unknown=0, NotChecked=0, Total=2652 [2018-01-31 08:39:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-31 08:39:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 176. [2018-01-31 08:39:16,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-31 08:39:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 181 transitions. [2018-01-31 08:39:16,201 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 181 transitions. Word has length 143 [2018-01-31 08:39:16,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:16,201 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 181 transitions. [2018-01-31 08:39:16,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-31 08:39:16,201 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 181 transitions. [2018-01-31 08:39:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-01-31 08:39:16,203 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:16,203 INFO L351 BasicCegarLoop]: trace histogram [12, 10, 10, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:16,203 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:16,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1902632690, now seen corresponding path program 3 times [2018-01-31 08:39:16,203 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:16,204 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:16,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:16,204 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:16,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:16,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 275 proven. 26 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-01-31 08:39:16,653 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:16,653 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:16,660 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:39:16,672 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:16,677 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:16,682 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:16,683 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:16,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:16,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:39:16,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:16,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:16,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 253 proven. 26 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-31 08:39:17,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:17,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2018-01-31 08:39:17,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-31 08:39:17,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-31 08:39:17,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:39:17,033 INFO L87 Difference]: Start difference. First operand 176 states and 181 transitions. Second operand 31 states. [2018-01-31 08:39:17,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:17,720 INFO L93 Difference]: Finished difference Result 238 states and 246 transitions. [2018-01-31 08:39:17,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:39:17,721 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 144 [2018-01-31 08:39:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:17,722 INFO L225 Difference]: With dead ends: 238 [2018-01-31 08:39:17,722 INFO L226 Difference]: Without dead ends: 237 [2018-01-31 08:39:17,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=421, Invalid=1741, Unknown=0, NotChecked=0, Total=2162 [2018-01-31 08:39:17,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-01-31 08:39:17,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 215. [2018-01-31 08:39:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-31 08:39:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 221 transitions. [2018-01-31 08:39:17,735 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 221 transitions. Word has length 144 [2018-01-31 08:39:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:17,736 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 221 transitions. [2018-01-31 08:39:17,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-31 08:39:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 221 transitions. [2018-01-31 08:39:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-01-31 08:39:17,737 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:17,737 INFO L351 BasicCegarLoop]: trace histogram [11, 8, 8, 8, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:17,737 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:17,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1502561417, now seen corresponding path program 2 times [2018-01-31 08:39:17,738 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:17,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:17,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:17,739 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:17,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:17,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-01-31 08:39:18,044 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:18,044 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:18,048 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:39:18,059 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:18,060 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:18,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:18,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:39:18,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-31 08:39:18,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:18,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:39:18,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-31 08:39:18,244 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:39:18,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-31 08:39:18,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:18,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:39:18,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-31 08:39:18,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:39:18,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-31 08:39:18,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:18,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:39:18,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-31 08:39:18,339 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~3.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_~#mask~3.base| 0)) (= 0 (select |c_old(#valid)| |main_~#mask~3.base|)))) is different from true [2018-01-31 08:39:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-01-31 08:39:18,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:39:18,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2018-01-31 08:39:18,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:39:18,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:39:18,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2018-01-31 08:39:18,389 INFO L87 Difference]: Start difference. First operand 215 states and 221 transitions. Second operand 13 states. [2018-01-31 08:39:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:18,895 INFO L93 Difference]: Finished difference Result 257 states and 268 transitions. [2018-01-31 08:39:18,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:39:18,896 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 153 [2018-01-31 08:39:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:18,897 INFO L225 Difference]: With dead ends: 257 [2018-01-31 08:39:18,897 INFO L226 Difference]: Without dead ends: 225 [2018-01-31 08:39:18,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 146 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=442, Unknown=1, NotChecked=46, Total=650 [2018-01-31 08:39:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-31 08:39:18,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 215. [2018-01-31 08:39:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-31 08:39:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 220 transitions. [2018-01-31 08:39:18,915 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 220 transitions. Word has length 153 [2018-01-31 08:39:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:18,916 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 220 transitions. [2018-01-31 08:39:18,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:39:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 220 transitions. [2018-01-31 08:39:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-01-31 08:39:18,917 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:18,918 INFO L351 BasicCegarLoop]: trace histogram [16, 13, 13, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:18,918 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:18,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1737507266, now seen corresponding path program 4 times [2018-01-31 08:39:18,918 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:18,918 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:18,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:18,919 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:18,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:18,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 365 proven. 79 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-01-31 08:39:19,379 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:19,379 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:19,384 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:39:19,418 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:19,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 580 proven. 33 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-01-31 08:39:19,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:19,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-01-31 08:39:19,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-31 08:39:19,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-31 08:39:19,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:39:19,653 INFO L87 Difference]: Start difference. First operand 215 states and 220 transitions. Second operand 31 states. [2018-01-31 08:39:21,505 WARN L146 SmtUtils]: Spent 426ms on a formula simplification. DAG size of input: 35 DAG size of output 30 [2018-01-31 08:39:22,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:22,897 INFO L93 Difference]: Finished difference Result 402 states and 415 transitions. [2018-01-31 08:39:22,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-01-31 08:39:22,897 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 191 [2018-01-31 08:39:22,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:22,898 INFO L225 Difference]: With dead ends: 402 [2018-01-31 08:39:22,898 INFO L226 Difference]: Without dead ends: 314 [2018-01-31 08:39:22,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2310 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1075, Invalid=6065, Unknown=0, NotChecked=0, Total=7140 [2018-01-31 08:39:22,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-01-31 08:39:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 272. [2018-01-31 08:39:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-01-31 08:39:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 277 transitions. [2018-01-31 08:39:22,922 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 277 transitions. Word has length 191 [2018-01-31 08:39:22,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:22,923 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 277 transitions. [2018-01-31 08:39:22,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-31 08:39:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 277 transitions. [2018-01-31 08:39:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-01-31 08:39:22,924 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:22,925 INFO L351 BasicCegarLoop]: trace histogram [17, 13, 13, 13, 13, 13, 13, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:22,925 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:22,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1940595211, now seen corresponding path program 1 times [2018-01-31 08:39:22,925 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:22,925 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:22,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:22,926 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:22,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:22,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 934 trivial. 0 not checked. [2018-01-31 08:39:23,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:23,222 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:23,227 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:23,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 458 proven. 62 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2018-01-31 08:39:23,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:23,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 20] total 23 [2018-01-31 08:39:23,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-31 08:39:23,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-31 08:39:23,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-01-31 08:39:23,473 INFO L87 Difference]: Start difference. First operand 272 states and 277 transitions. Second operand 23 states. [2018-01-31 08:39:24,436 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 8 DAG size of output 6 [2018-01-31 08:39:24,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:24,713 INFO L93 Difference]: Finished difference Result 436 states and 449 transitions. [2018-01-31 08:39:24,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-31 08:39:24,713 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 220 [2018-01-31 08:39:24,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:24,714 INFO L225 Difference]: With dead ends: 436 [2018-01-31 08:39:24,715 INFO L226 Difference]: Without dead ends: 359 [2018-01-31 08:39:24,716 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=420, Invalid=2232, Unknown=0, NotChecked=0, Total=2652 [2018-01-31 08:39:24,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-01-31 08:39:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 295. [2018-01-31 08:39:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-01-31 08:39:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 300 transitions. [2018-01-31 08:39:24,740 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 300 transitions. Word has length 220 [2018-01-31 08:39:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:24,740 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 300 transitions. [2018-01-31 08:39:24,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-31 08:39:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 300 transitions. [2018-01-31 08:39:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-01-31 08:39:24,742 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:24,742 INFO L351 BasicCegarLoop]: trace histogram [18, 14, 14, 14, 14, 14, 14, 14, 14, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:24,742 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:24,742 INFO L82 PathProgramCache]: Analyzing trace with hash 111205615, now seen corresponding path program 2 times [2018-01-31 08:39:24,743 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:24,743 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:24,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:24,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:24,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:24,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2018-01-31 08:39:25,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:25,073 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:25,078 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:39:25,092 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:25,118 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:25,121 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:25,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2018-01-31 08:39:25,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:25,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 17 [2018-01-31 08:39:25,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:39:25,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:39:25,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:39:25,232 INFO L87 Difference]: Start difference. First operand 295 states and 300 transitions. Second operand 17 states. [2018-01-31 08:39:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:25,453 INFO L93 Difference]: Finished difference Result 331 states and 339 transitions. [2018-01-31 08:39:25,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 08:39:25,453 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 236 [2018-01-31 08:39:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:25,456 INFO L225 Difference]: With dead ends: 331 [2018-01-31 08:39:25,456 INFO L226 Difference]: Without dead ends: 291 [2018-01-31 08:39:25,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:39:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-01-31 08:39:25,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 276. [2018-01-31 08:39:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-01-31 08:39:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 280 transitions. [2018-01-31 08:39:25,475 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 280 transitions. Word has length 236 [2018-01-31 08:39:25,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:25,476 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 280 transitions. [2018-01-31 08:39:25,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:39:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 280 transitions. [2018-01-31 08:39:25,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-01-31 08:39:25,478 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:25,478 INFO L351 BasicCegarLoop]: trace histogram [23, 19, 19, 18, 18, 18, 18, 18, 18, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:25,478 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:25,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1686521775, now seen corresponding path program 5 times [2018-01-31 08:39:25,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:25,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:25,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:25,479 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:25,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:25,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:26,184 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 13 DAG size of output 9 [2018-01-31 08:39:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1757 backedges. 620 proven. 70 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-01-31 08:39:26,431 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:26,431 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:26,436 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:39:26,454 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:26,460 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:26,472 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:26,480 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:26,487 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:26,493 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:26,500 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:26,502 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:26,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:26,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:39:26,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:26,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:26,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1757 backedges. 620 proven. 70 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-01-31 08:39:27,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:27,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-01-31 08:39:27,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-31 08:39:27,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-31 08:39:27,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-01-31 08:39:27,034 INFO L87 Difference]: Start difference. First operand 276 states and 280 transitions. Second operand 23 states. [2018-01-31 08:39:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:27,433 INFO L93 Difference]: Finished difference Result 337 states and 344 transitions. [2018-01-31 08:39:27,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:39:27,434 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 265 [2018-01-31 08:39:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:27,435 INFO L225 Difference]: With dead ends: 337 [2018-01-31 08:39:27,436 INFO L226 Difference]: Without dead ends: 336 [2018-01-31 08:39:27,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 249 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=287, Invalid=1045, Unknown=0, NotChecked=0, Total=1332 [2018-01-31 08:39:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-01-31 08:39:27,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 278. [2018-01-31 08:39:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-01-31 08:39:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 282 transitions. [2018-01-31 08:39:27,458 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 282 transitions. Word has length 265 [2018-01-31 08:39:27,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:27,458 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 282 transitions. [2018-01-31 08:39:27,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-31 08:39:27,459 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 282 transitions. [2018-01-31 08:39:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-01-31 08:39:27,460 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:27,460 INFO L351 BasicCegarLoop]: trace histogram [24, 20, 20, 19, 19, 19, 19, 19, 19, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:27,461 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:27,461 INFO L82 PathProgramCache]: Analyzing trace with hash -736672462, now seen corresponding path program 6 times [2018-01-31 08:39:27,461 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:27,461 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:27,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:27,461 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:27,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:27,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:28,118 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 11 [2018-01-31 08:39:28,749 WARN L143 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-31 08:39:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1931 backedges. 784 proven. 86 refuted. 0 times theorem prover too weak. 1061 trivial. 0 not checked. [2018-01-31 08:39:29,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:29,410 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:29,417 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 08:39:29,436 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:29,441 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:29,446 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:29,452 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:29,458 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:29,467 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:29,475 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:29,477 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:29,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:29,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:39:29,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:29,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:29,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1931 backedges. 1035 proven. 370 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-01-31 08:39:30,613 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:30,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 43 [2018-01-31 08:39:30,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-31 08:39:30,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-31 08:39:30,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1659, Unknown=0, NotChecked=0, Total=1892 [2018-01-31 08:39:30,615 INFO L87 Difference]: Start difference. First operand 278 states and 282 transitions. Second operand 44 states. [2018-01-31 08:39:33,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:33,463 INFO L93 Difference]: Finished difference Result 450 states and 463 transitions. [2018-01-31 08:39:33,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-01-31 08:39:33,465 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 274 [2018-01-31 08:39:33,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:33,467 INFO L225 Difference]: With dead ends: 450 [2018-01-31 08:39:33,467 INFO L226 Difference]: Without dead ends: 449 [2018-01-31 08:39:33,470 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 243 SyntacticMatches, 6 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3881 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2013, Invalid=9117, Unknown=0, NotChecked=0, Total=11130 [2018-01-31 08:39:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-01-31 08:39:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 365. [2018-01-31 08:39:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-01-31 08:39:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 372 transitions. [2018-01-31 08:39:33,500 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 372 transitions. Word has length 274 [2018-01-31 08:39:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:33,501 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 372 transitions. [2018-01-31 08:39:33,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-31 08:39:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 372 transitions. [2018-01-31 08:39:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-01-31 08:39:33,504 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:33,505 INFO L351 BasicCegarLoop]: trace histogram [31, 26, 26, 25, 25, 25, 25, 25, 25, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:33,505 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:33,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1047066373, now seen corresponding path program 7 times [2018-01-31 08:39:33,505 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:33,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:33,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:33,506 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:33,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:33,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:34,465 WARN L146 SmtUtils]: Spent 246ms on a formula simplification. DAG size of input: 14 DAG size of output 9 [2018-01-31 08:39:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3305 backedges. 1065 proven. 110 refuted. 0 times theorem prover too weak. 2130 trivial. 0 not checked. [2018-01-31 08:39:34,775 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:34,775 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:34,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:34,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:34,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:39:34,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:34,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:34,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3305 backedges. 1065 proven. 110 refuted. 0 times theorem prover too weak. 2130 trivial. 0 not checked. [2018-01-31 08:39:35,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:35,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2018-01-31 08:39:35,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-31 08:39:35,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-31 08:39:35,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:39:35,628 INFO L87 Difference]: Start difference. First operand 365 states and 372 transitions. Second operand 27 states. [2018-01-31 08:39:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:36,382 INFO L93 Difference]: Finished difference Result 468 states and 481 transitions. [2018-01-31 08:39:36,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:39:36,382 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 348 [2018-01-31 08:39:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:36,385 INFO L225 Difference]: With dead ends: 468 [2018-01-31 08:39:36,386 INFO L226 Difference]: Without dead ends: 467 [2018-01-31 08:39:36,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 328 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=356, Invalid=1536, Unknown=0, NotChecked=0, Total=1892 [2018-01-31 08:39:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-01-31 08:39:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 367. [2018-01-31 08:39:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-01-31 08:39:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 374 transitions. [2018-01-31 08:39:36,415 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 374 transitions. Word has length 348 [2018-01-31 08:39:36,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:36,416 INFO L432 AbstractCegarLoop]: Abstraction has 367 states and 374 transitions. [2018-01-31 08:39:36,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-31 08:39:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 374 transitions. [2018-01-31 08:39:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-01-31 08:39:36,418 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:36,419 INFO L351 BasicCegarLoop]: trace histogram [32, 27, 27, 26, 26, 26, 26, 26, 26, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:36,419 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:36,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1693363970, now seen corresponding path program 8 times [2018-01-31 08:39:36,419 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:36,419 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:36,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:36,420 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:36,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:36,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3544 backedges. 1292 proven. 132 refuted. 0 times theorem prover too weak. 2120 trivial. 0 not checked. [2018-01-31 08:39:37,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:37,797 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:37,803 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:39:37,828 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:37,887 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:37,897 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:37,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:37,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:39:37,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:37,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:37,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3544 backedges. 1255 proven. 159 refuted. 0 times theorem prover too weak. 2130 trivial. 0 not checked. [2018-01-31 08:39:39,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:39,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-01-31 08:39:39,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-31 08:39:39,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-31 08:39:39,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1161, Unknown=0, NotChecked=0, Total=1332 [2018-01-31 08:39:39,430 INFO L87 Difference]: Start difference. First operand 367 states and 374 transitions. Second operand 37 states. [2018-01-31 08:39:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:41,293 INFO L93 Difference]: Finished difference Result 738 states and 767 transitions. [2018-01-31 08:39:41,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-01-31 08:39:41,293 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 357 [2018-01-31 08:39:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:41,297 INFO L225 Difference]: With dead ends: 738 [2018-01-31 08:39:41,297 INFO L226 Difference]: Without dead ends: 737 [2018-01-31 08:39:41,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 333 SyntacticMatches, 9 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1036, Invalid=7894, Unknown=0, NotChecked=0, Total=8930 [2018-01-31 08:39:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-01-31 08:39:41,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 463. [2018-01-31 08:39:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-01-31 08:39:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 475 transitions. [2018-01-31 08:39:41,338 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 475 transitions. Word has length 357 [2018-01-31 08:39:41,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:41,339 INFO L432 AbstractCegarLoop]: Abstraction has 463 states and 475 transitions. [2018-01-31 08:39:41,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-31 08:39:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 475 transitions. [2018-01-31 08:39:41,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-01-31 08:39:41,342 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:41,343 INFO L351 BasicCegarLoop]: trace histogram [39, 33, 33, 32, 32, 32, 32, 32, 32, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:41,343 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:41,343 INFO L82 PathProgramCache]: Analyzing trace with hash -412827049, now seen corresponding path program 9 times [2018-01-31 08:39:41,343 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:41,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:41,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:41,344 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:41,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:41,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5342 backedges. 1801 proven. 217 refuted. 0 times theorem prover too weak. 3324 trivial. 0 not checked. [2018-01-31 08:39:42,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:42,529 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:42,534 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:39:42,557 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:42,574 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:42,589 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:42,608 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:42,625 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:42,648 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:42,676 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:42,689 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:42,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:42,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:39:42,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:42,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:42,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5342 backedges. 1845 proven. 188 refuted. 0 times theorem prover too weak. 3309 trivial. 0 not checked. [2018-01-31 08:39:43,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:43,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 42 [2018-01-31 08:39:43,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-31 08:39:43,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-31 08:39:43,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1583, Unknown=0, NotChecked=0, Total=1806 [2018-01-31 08:39:43,848 INFO L87 Difference]: Start difference. First operand 463 states and 475 transitions. Second operand 43 states. [2018-01-31 08:39:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:46,680 INFO L93 Difference]: Finished difference Result 939 states and 984 transitions. [2018-01-31 08:39:46,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-01-31 08:39:46,680 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 431 [2018-01-31 08:39:46,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:46,686 INFO L225 Difference]: With dead ends: 939 [2018-01-31 08:39:46,686 INFO L226 Difference]: Without dead ends: 938 [2018-01-31 08:39:46,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 399 SyntacticMatches, 11 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5321 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2039, Invalid=11767, Unknown=0, NotChecked=0, Total=13806 [2018-01-31 08:39:46,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-01-31 08:39:46,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 559. [2018-01-31 08:39:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-01-31 08:39:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 576 transitions. [2018-01-31 08:39:46,730 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 576 transitions. Word has length 431 [2018-01-31 08:39:46,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:46,731 INFO L432 AbstractCegarLoop]: Abstraction has 559 states and 576 transitions. [2018-01-31 08:39:46,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-31 08:39:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 576 transitions. [2018-01-31 08:39:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-01-31 08:39:46,735 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:46,736 INFO L351 BasicCegarLoop]: trace histogram [46, 39, 39, 38, 38, 38, 38, 38, 38, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:46,736 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2015714974, now seen corresponding path program 10 times [2018-01-31 08:39:46,736 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:46,736 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:46,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:46,737 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:46,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:46,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7508 backedges. 4089 proven. 1017 refuted. 0 times theorem prover too weak. 2402 trivial. 0 not checked. [2018-01-31 08:39:47,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:47,873 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:47,878 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:39:47,960 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:47,967 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7508 backedges. 4664 proven. 100 refuted. 0 times theorem prover too weak. 2744 trivial. 0 not checked. [2018-01-31 08:39:48,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:48,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24] total 46 [2018-01-31 08:39:48,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-31 08:39:48,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-31 08:39:48,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1846, Unknown=0, NotChecked=0, Total=2070 [2018-01-31 08:39:48,453 INFO L87 Difference]: Start difference. First operand 559 states and 576 transitions. Second operand 46 states. [2018-01-31 08:39:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:49,919 INFO L93 Difference]: Finished difference Result 1137 states and 1176 transitions. [2018-01-31 08:39:49,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-01-31 08:39:49,920 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 505 [2018-01-31 08:39:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:49,922 INFO L225 Difference]: With dead ends: 1137 [2018-01-31 08:39:49,923 INFO L226 Difference]: Without dead ends: 708 [2018-01-31 08:39:49,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2335 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1099, Invalid=7273, Unknown=0, NotChecked=0, Total=8372 [2018-01-31 08:39:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-01-31 08:39:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 647. [2018-01-31 08:39:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-01-31 08:39:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 663 transitions. [2018-01-31 08:39:49,990 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 663 transitions. Word has length 505 [2018-01-31 08:39:49,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:49,990 INFO L432 AbstractCegarLoop]: Abstraction has 647 states and 663 transitions. [2018-01-31 08:39:49,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-31 08:39:49,990 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 663 transitions. [2018-01-31 08:39:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-01-31 08:39:49,994 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:49,995 INFO L351 BasicCegarLoop]: trace histogram [48, 41, 41, 40, 40, 40, 40, 40, 40, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:49,995 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:49,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2003422024, now seen corresponding path program 11 times [2018-01-31 08:39:49,995 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:49,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:49,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:49,996 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:49,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:50,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8237 backedges. 2751 proven. 254 refuted. 0 times theorem prover too weak. 5232 trivial. 0 not checked. [2018-01-31 08:39:51,532 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:51,533 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:51,538 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:39:51,563 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:51,572 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:51,583 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:51,595 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:51,606 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:51,618 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:51,628 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:51,639 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:51,641 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:51,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8237 backedges. 5020 proven. 698 refuted. 0 times theorem prover too weak. 2519 trivial. 0 not checked. [2018-01-31 08:39:52,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:52,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 33] total 60 [2018-01-31 08:39:52,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-31 08:39:52,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-31 08:39:52,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=3263, Unknown=0, NotChecked=0, Total=3540 [2018-01-31 08:39:52,499 INFO L87 Difference]: Start difference. First operand 647 states and 663 transitions. Second operand 60 states. [2018-01-31 08:39:56,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:56,458 INFO L93 Difference]: Finished difference Result 972 states and 999 transitions. [2018-01-31 08:39:56,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-01-31 08:39:56,459 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 523 [2018-01-31 08:39:56,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:56,461 INFO L225 Difference]: With dead ends: 972 [2018-01-31 08:39:56,462 INFO L226 Difference]: Without dead ends: 791 [2018-01-31 08:39:56,465 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9176 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3059, Invalid=21433, Unknown=0, NotChecked=0, Total=24492 [2018-01-31 08:39:56,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-01-31 08:39:56,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 748. [2018-01-31 08:39:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-01-31 08:39:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 764 transitions. [2018-01-31 08:39:56,528 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 764 transitions. Word has length 523 [2018-01-31 08:39:56,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:56,528 INFO L432 AbstractCegarLoop]: Abstraction has 748 states and 764 transitions. [2018-01-31 08:39:56,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-01-31 08:39:56,529 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 764 transitions. [2018-01-31 08:39:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2018-01-31 08:39:56,533 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:56,534 INFO L351 BasicCegarLoop]: trace histogram [58, 50, 50, 49, 49, 49, 49, 49, 49, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:56,534 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash -555408110, now seen corresponding path program 12 times [2018-01-31 08:39:56,534 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:56,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:56,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:56,536 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:56,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:56,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:57,719 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 13 DAG size of output 9 [2018-01-31 08:39:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12212 backedges. 3300 proven. 284 refuted. 0 times theorem prover too weak. 8628 trivial. 0 not checked. [2018-01-31 08:39:58,332 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:58,332 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:58,337 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 08:39:58,362 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:58,369 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:58,375 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:58,384 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:58,392 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:58,405 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:58,415 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:58,429 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:58,442 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:58,457 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:58,478 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:39:58,481 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:58,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12212 backedges. 7312 proven. 203 refuted. 0 times theorem prover too weak. 4697 trivial. 0 not checked. [2018-01-31 08:39:59,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:59,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 32] total 52 [2018-01-31 08:39:59,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-31 08:39:59,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-31 08:39:59,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2434, Unknown=0, NotChecked=0, Total=2652 [2018-01-31 08:39:59,838 INFO L87 Difference]: Start difference. First operand 748 states and 764 transitions. Second operand 52 states. [2018-01-31 08:40:02,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:02,068 INFO L93 Difference]: Finished difference Result 1218 states and 1264 transitions. [2018-01-31 08:40:02,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-31 08:40:02,069 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 624 [2018-01-31 08:40:02,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:02,072 INFO L225 Difference]: With dead ends: 1218 [2018-01-31 08:40:02,072 INFO L226 Difference]: Without dead ends: 1031 [2018-01-31 08:40:02,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3028 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1007, Invalid=9705, Unknown=0, NotChecked=0, Total=10712 [2018-01-31 08:40:02,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2018-01-31 08:40:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 775. [2018-01-31 08:40:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2018-01-31 08:40:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 791 transitions. [2018-01-31 08:40:02,148 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 791 transitions. Word has length 624 [2018-01-31 08:40:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:02,149 INFO L432 AbstractCegarLoop]: Abstraction has 775 states and 791 transitions. [2018-01-31 08:40:02,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-31 08:40:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 791 transitions. [2018-01-31 08:40:02,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2018-01-31 08:40:02,157 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:02,157 INFO L351 BasicCegarLoop]: trace histogram [61, 53, 53, 52, 52, 52, 52, 52, 52, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:02,157 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:02,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1500438281, now seen corresponding path program 13 times [2018-01-31 08:40:02,158 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:02,158 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:02,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:02,159 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:40:02,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:02,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:03,677 WARN L146 SmtUtils]: Spent 260ms on a formula simplification. DAG size of input: 14 DAG size of output 9 [2018-01-31 08:40:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 13622 backedges. 3855 proven. 360 refuted. 0 times theorem prover too weak. 9407 trivial. 0 not checked. [2018-01-31 08:40:04,674 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:04,675 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-31 08:40:04,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:40:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:04,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 13622 backedges. 6925 proven. 268 refuted. 0 times theorem prover too weak. 6429 trivial. 0 not checked. [2018-01-31 08:40:06,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:06,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 36] total 59 [2018-01-31 08:40:06,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-01-31 08:40:06,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-01-31 08:40:06,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=3090, Unknown=0, NotChecked=0, Total=3422 [2018-01-31 08:40:06,455 INFO L87 Difference]: Start difference. First operand 775 states and 791 transitions. Second operand 59 states. [2018-01-31 08:40:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:08,717 INFO L93 Difference]: Finished difference Result 1231 states and 1283 transitions. [2018-01-31 08:40:08,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-01-31 08:40:08,717 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 651 [2018-01-31 08:40:08,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:08,720 INFO L225 Difference]: With dead ends: 1231 [2018-01-31 08:40:08,720 INFO L226 Difference]: Without dead ends: 1121 [2018-01-31 08:40:08,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4745 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1851, Invalid=11955, Unknown=0, NotChecked=0, Total=13806 [2018-01-31 08:40:08,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-01-31 08:40:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 793. [2018-01-31 08:40:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-01-31 08:40:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 809 transitions. [2018-01-31 08:40:08,799 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 809 transitions. Word has length 651 [2018-01-31 08:40:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:08,799 INFO L432 AbstractCegarLoop]: Abstraction has 793 states and 809 transitions. [2018-01-31 08:40:08,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-01-31 08:40:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 809 transitions. [2018-01-31 08:40:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2018-01-31 08:40:08,805 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:08,805 INFO L351 BasicCegarLoop]: trace histogram [63, 55, 55, 54, 54, 54, 54, 54, 54, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:08,806 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:08,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1994254033, now seen corresponding path program 14 times [2018-01-31 08:40:08,806 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:08,806 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:08,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:08,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:40:08,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:08,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 14607 backedges. 5011 proven. 2220 refuted. 0 times theorem prover too weak. 7376 trivial. 0 not checked. [2018-01-31 08:40:11,551 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:11,552 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:40:11,557 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:40:11,584 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:11,658 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:11,668 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:40:11,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14607 backedges. 4797 proven. 312 refuted. 0 times theorem prover too weak. 9498 trivial. 0 not checked. [2018-01-31 08:40:12,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:12,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 42] total 78 [2018-01-31 08:40:12,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-01-31 08:40:12,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-01-31 08:40:12,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=5537, Unknown=0, NotChecked=0, Total=6006 [2018-01-31 08:40:12,858 INFO L87 Difference]: Start difference. First operand 793 states and 809 transitions. Second operand 78 states. [2018-01-31 08:40:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:18,574 INFO L93 Difference]: Finished difference Result 1819 states and 1886 transitions. [2018-01-31 08:40:18,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-01-31 08:40:18,577 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 669 [2018-01-31 08:40:18,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:18,582 INFO L225 Difference]: With dead ends: 1819 [2018-01-31 08:40:18,582 INFO L226 Difference]: Without dead ends: 1190 [2018-01-31 08:40:18,589 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12608 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4347, Invalid=34265, Unknown=0, NotChecked=0, Total=38612 [2018-01-31 08:40:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2018-01-31 08:40:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1110. [2018-01-31 08:40:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2018-01-31 08:40:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1143 transitions. [2018-01-31 08:40:18,702 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1143 transitions. Word has length 669 [2018-01-31 08:40:18,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:18,703 INFO L432 AbstractCegarLoop]: Abstraction has 1110 states and 1143 transitions. [2018-01-31 08:40:18,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-01-31 08:40:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1143 transitions. [2018-01-31 08:40:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 771 [2018-01-31 08:40:18,710 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:18,710 INFO L351 BasicCegarLoop]: trace histogram [73, 64, 64, 63, 63, 63, 63, 63, 63, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:18,710 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash 669636959, now seen corresponding path program 15 times [2018-01-31 08:40:18,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:18,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:18,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:18,712 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:40:18,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:18,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 19782 backedges. 5433 proven. 416 refuted. 0 times theorem prover too weak. 13933 trivial. 0 not checked. [2018-01-31 08:40:21,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:21,416 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:40:21,423 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:40:21,462 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:21,480 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:21,486 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:21,494 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:21,503 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:21,514 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:21,527 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:21,544 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:21,562 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:21,585 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:21,589 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:40:21,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:21,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:40:21,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:40:21,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:40:21,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:40:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 19782 backedges. 5290 proven. 416 refuted. 0 times theorem prover too weak. 14076 trivial. 0 not checked. [2018-01-31 08:40:23,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:23,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 60 [2018-01-31 08:40:23,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-01-31 08:40:23,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-01-31 08:40:23,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=3122, Unknown=0, NotChecked=0, Total=3660 [2018-01-31 08:40:23,999 INFO L87 Difference]: Start difference. First operand 1110 states and 1143 transitions. Second operand 61 states. [2018-01-31 08:40:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:25,011 INFO L93 Difference]: Finished difference Result 1228 states and 1263 transitions. [2018-01-31 08:40:25,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-31 08:40:25,012 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 770 [2018-01-31 08:40:25,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:25,018 INFO L225 Difference]: With dead ends: 1228 [2018-01-31 08:40:25,018 INFO L226 Difference]: Without dead ends: 1227 [2018-01-31 08:40:25,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 725 SyntacticMatches, 17 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4355 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1485, Invalid=7445, Unknown=0, NotChecked=0, Total=8930 [2018-01-31 08:40:25,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2018-01-31 08:40:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1211. [2018-01-31 08:40:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-01-31 08:40:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1245 transitions. [2018-01-31 08:40:25,136 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1245 transitions. Word has length 770 [2018-01-31 08:40:25,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:25,137 INFO L432 AbstractCegarLoop]: Abstraction has 1211 states and 1245 transitions. [2018-01-31 08:40:25,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-01-31 08:40:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1245 transitions. [2018-01-31 08:40:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2018-01-31 08:40:25,146 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:25,146 INFO L351 BasicCegarLoop]: trace histogram [83, 73, 73, 72, 72, 72, 72, 72, 72, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:25,146 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:25,147 INFO L82 PathProgramCache]: Analyzing trace with hash -862619759, now seen corresponding path program 16 times [2018-01-31 08:40:25,147 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:25,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:25,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:25,148 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:40:25,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:25,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 25742 backedges. 6098 proven. 445 refuted. 0 times theorem prover too weak. 19199 trivial. 0 not checked. [2018-01-31 08:40:27,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:27,972 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:40:27,977 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:40:28,114 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:40:28,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:29,253 INFO L134 CoverageAnalysis]: Checked inductivity of 25742 backedges. 14216 proven. 342 refuted. 0 times theorem prover too weak. 11184 trivial. 0 not checked. [2018-01-31 08:40:29,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:29,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 40] total 64 [2018-01-31 08:40:29,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-01-31 08:40:29,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-01-31 08:40:29,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=3722, Unknown=0, NotChecked=0, Total=4032 [2018-01-31 08:40:29,275 INFO L87 Difference]: Start difference. First operand 1211 states and 1245 transitions. Second operand 64 states. [2018-01-31 08:40:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:32,655 INFO L93 Difference]: Finished difference Result 1549 states and 1598 transitions. [2018-01-31 08:40:32,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-31 08:40:32,656 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 871 [2018-01-31 08:40:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:32,661 INFO L225 Difference]: With dead ends: 1549 [2018-01-31 08:40:32,662 INFO L226 Difference]: Without dead ends: 1326 [2018-01-31 08:40:32,665 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4969 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1477, Invalid=15293, Unknown=0, NotChecked=0, Total=16770 [2018-01-31 08:40:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-01-31 08:40:32,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1229. [2018-01-31 08:40:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2018-01-31 08:40:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1262 transitions. [2018-01-31 08:40:32,755 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1262 transitions. Word has length 871 [2018-01-31 08:40:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:32,755 INFO L432 AbstractCegarLoop]: Abstraction has 1229 states and 1262 transitions. [2018-01-31 08:40:32,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-01-31 08:40:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1262 transitions. [2018-01-31 08:40:32,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2018-01-31 08:40:32,765 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:32,765 INFO L351 BasicCegarLoop]: trace histogram [86, 76, 76, 75, 75, 75, 75, 75, 75, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:32,765 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:32,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2088188952, now seen corresponding path program 17 times [2018-01-31 08:40:32,766 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:32,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:32,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:32,767 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:40:32,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:32,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 27785 backedges. 10498 proven. 2462 refuted. 0 times theorem prover too weak. 14825 trivial. 0 not checked. [2018-01-31 08:40:36,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:36,677 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:40:36,683 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:40:36,717 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:36,719 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:36,728 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:36,740 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:36,753 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:36,768 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:36,784 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:36,800 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:36,817 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:36,835 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:36,853 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:36,870 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:36,890 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:36,910 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:36,913 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:40:36,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 27785 backedges. 12382 proven. 1784 refuted. 0 times theorem prover too weak. 13619 trivial. 0 not checked. [2018-01-31 08:40:39,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:39,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 49] total 87 [2018-01-31 08:40:39,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-01-31 08:40:39,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-01-31 08:40:39,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=6838, Unknown=0, NotChecked=0, Total=7482 [2018-01-31 08:40:39,846 INFO L87 Difference]: Start difference. First operand 1229 states and 1262 transitions. Second operand 87 states. [2018-01-31 08:40:45,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:45,815 INFO L93 Difference]: Finished difference Result 1581 states and 1628 transitions. [2018-01-31 08:40:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-01-31 08:40:45,817 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 898 [2018-01-31 08:40:45,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:45,823 INFO L225 Difference]: With dead ends: 1581 [2018-01-31 08:40:45,823 INFO L226 Difference]: Without dead ends: 1450 [2018-01-31 08:40:45,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1086 GetRequests, 866 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17361 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=5981, Invalid=43081, Unknown=0, NotChecked=0, Total=49062 [2018-01-31 08:40:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2018-01-31 08:40:45,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1357. [2018-01-31 08:40:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2018-01-31 08:40:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1390 transitions. [2018-01-31 08:40:45,950 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1390 transitions. Word has length 898 [2018-01-31 08:40:45,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:45,950 INFO L432 AbstractCegarLoop]: Abstraction has 1357 states and 1390 transitions. [2018-01-31 08:40:45,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-01-31 08:40:45,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1390 transitions. [2018-01-31 08:40:45,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1027 [2018-01-31 08:40:45,964 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:45,965 INFO L351 BasicCegarLoop]: trace histogram [99, 88, 88, 87, 87, 87, 87, 87, 87, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:45,965 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:45,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1001749371, now seen corresponding path program 18 times [2018-01-31 08:40:45,966 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:45,966 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:45,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:45,967 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:40:45,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:46,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:49,998 INFO L134 CoverageAnalysis]: Checked inductivity of 37152 backedges. 12971 proven. 2850 refuted. 0 times theorem prover too weak. 21331 trivial. 0 not checked. [2018-01-31 08:40:49,998 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:49,998 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:40:50,004 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 08:40:50,042 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,047 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,051 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,053 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,059 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,062 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,068 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,075 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,083 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,089 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,099 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,113 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,129 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,145 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,163 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,190 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,218 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,260 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,370 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:50,376 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:40:50,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 37152 backedges. 17784 proven. 3325 refuted. 0 times theorem prover too weak. 16043 trivial. 0 not checked. [2018-01-31 08:40:53,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:53,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 53] total 89 [2018-01-31 08:40:53,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-01-31 08:40:53,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-01-31 08:40:53,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=7122, Unknown=0, NotChecked=0, Total=7832 [2018-01-31 08:40:53,526 INFO L87 Difference]: Start difference. First operand 1357 states and 1390 transitions. Second operand 89 states. [2018-01-31 08:41:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:00,736 INFO L93 Difference]: Finished difference Result 3322 states and 3447 transitions. [2018-01-31 08:41:00,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-01-31 08:41:00,770 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1026 [2018-01-31 08:41:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:00,776 INFO L225 Difference]: With dead ends: 3322 [2018-01-31 08:41:00,776 INFO L226 Difference]: Without dead ends: 1619 [2018-01-31 08:41:00,785 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1214 GetRequests, 979 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18937 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=6433, Invalid=49499, Unknown=0, NotChecked=0, Total=55932 [2018-01-31 08:41:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2018-01-31 08:41:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1466. [2018-01-31 08:41:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-01-31 08:41:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1495 transitions. [2018-01-31 08:41:00,907 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1495 transitions. Word has length 1026 [2018-01-31 08:41:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:00,910 INFO L432 AbstractCegarLoop]: Abstraction has 1466 states and 1495 transitions. [2018-01-31 08:41:00,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-01-31 08:41:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1495 transitions. [2018-01-31 08:41:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1045 [2018-01-31 08:41:00,921 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:00,921 INFO L351 BasicCegarLoop]: trace histogram [101, 90, 90, 89, 89, 89, 89, 89, 89, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:00,921 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:00,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1325850219, now seen corresponding path program 19 times [2018-01-31 08:41:00,922 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:00,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:00,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:00,923 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:41:00,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:01,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:03,638 WARN L146 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 13 DAG size of output 9 [2018-01-31 08:41:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 38779 backedges. 8353 proven. 539 refuted. 0 times theorem prover too weak. 29887 trivial. 0 not checked. [2018-01-31 08:41:04,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:04,986 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:41:04,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:05,162 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 38779 backedges. 21621 proven. 497 refuted. 0 times theorem prover too weak. 16661 trivial. 0 not checked. [2018-01-31 08:41:06,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:06,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 46] total 72 [2018-01-31 08:41:06,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-01-31 08:41:06,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-01-31 08:41:06,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=4723, Unknown=0, NotChecked=0, Total=5112 [2018-01-31 08:41:06,639 INFO L87 Difference]: Start difference. First operand 1466 states and 1495 transitions. Second operand 72 states. [2018-01-31 08:41:07,285 WARN L143 SmtUtils]: Spent 117ms on a formula simplification that was a NOOP. DAG size: 13 Received shutdown request... [2018-01-31 08:41:07,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:41:07,467 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:41:07,473 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:41:07,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:41:07 BoogieIcfgContainer [2018-01-31 08:41:07,474 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:41:07,475 INFO L168 Benchmark]: Toolchain (without parser) took 125973.29 ms. Allocated memory was 307.8 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 268.5 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 831.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:41:07,476 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 307.8 MB. Free memory is still 273.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:41:07,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.95 ms. Allocated memory is still 307.8 MB. Free memory was 267.5 MB in the beginning and 259.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:41:07,476 INFO L168 Benchmark]: Boogie Preprocessor took 36.36 ms. Allocated memory is still 307.8 MB. Free memory was 259.5 MB in the beginning and 257.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:41:07,477 INFO L168 Benchmark]: RCFGBuilder took 644.84 ms. Allocated memory is still 307.8 MB. Free memory was 257.5 MB in the beginning and 240.4 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:41:07,482 INFO L168 Benchmark]: TraceAbstraction took 125064.46 ms. Allocated memory was 307.8 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 240.4 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 803.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:41:07,484 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 307.8 MB. Free memory is still 273.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.95 ms. Allocated memory is still 307.8 MB. Free memory was 267.5 MB in the beginning and 259.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.36 ms. Allocated memory is still 307.8 MB. Free memory was 259.5 MB in the beginning and 257.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 644.84 ms. Allocated memory is still 307.8 MB. Free memory was 257.5 MB in the beginning and 240.4 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 125064.46 ms. Allocated memory was 307.8 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 240.4 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 803.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (1466states) and interpolant automaton (currently 15 states, 72 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 83 known predicates. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (1466states) and interpolant automaton (currently 15 states, 72 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (1466states) and interpolant automaton (currently 15 states, 72 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 83 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (1466states) and interpolant automaton (currently 15 states, 72 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 83 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (1466states) and interpolant automaton (currently 15 states, 72 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 83 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (1466states) and interpolant automaton (currently 15 states, 72 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 83 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 6 error locations. TIMEOUT Result, 125.0s OverallTime, 35 OverallIterations, 101 TraceHistogramMax, 54.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2035 SDtfs, 14681 SDslu, 26135 SDs, 0 SdLazy, 32056 SolverSat, 2470 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12911 GetRequests, 10532 SyntacticMatches, 86 SemanticMatches, 2292 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 98555 ImplicationChecksByTransitivity, 69.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1466occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 2508 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 59.8s InterpolantComputationTime, 22299 NumberOfCodeBlocks, 21639 NumberOfCodeBlocksAsserted, 151 NumberOfCheckSat, 22233 ConstructedInterpolants, 1906 QuantifiedInterpolants, 46510333 SizeOfPredicates, 537 NumberOfNonLiveVariables, 19319 ConjunctsInSsa, 766 ConjunctsInUnsatCore, 66 InterpolantComputations, 6 PerfectInterpolantSequences, 431971/452986 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-41-07-496.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-41-07-496.csv Completed graceful shutdown