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/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:04:52,261 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:04:52,263 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:04:52,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:04:52,287 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:04:52,288 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:04:52,290 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:04:52,292 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:04:52,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:04:52,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:04:52,296 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:04:52,303 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:04:52,304 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:04:52,305 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:04:52,306 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:04:52,311 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:04:52,313 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:04:52,317 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:04:52,318 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:04:52,319 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:04:52,323 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:04:52,323 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:04:52,324 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:04:52,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:04:52,328 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:04:52,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:04:52,329 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:04:52,330 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:04:52,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:04:52,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:04:52,334 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:04:52,334 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 09:04:52,348 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:04:52,348 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:04:52,350 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:04:52,350 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:04:52,350 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:04:52,350 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:04:52,351 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:04:52,351 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:04:52,351 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:04:52,352 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:04:52,352 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:04:52,352 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:04:52,352 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:04:52,352 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:04:52,352 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:04:52,353 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:04:52,353 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:04:52,353 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:04:52,353 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:04:52,353 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:04:52,353 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:04:52,354 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:04:52,354 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:04:52,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:04:52,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:04:52,355 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:04:52,356 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:04:52,356 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:04:52,356 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:04:52,356 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:04:52,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:04:52,356 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:04:52,357 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:04:52,357 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:04:52,411 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:04:52,427 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:04:52,432 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:04:52,434 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:04:52,434 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:04:52,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-01-31 09:04:52,661 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:04:52,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 09:04:52,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:04:52,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:04:52,678 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:04:52,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:04:52" (1/1) ... [2018-01-31 09:04:52,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6298bd67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:52, skipping insertion in model container [2018-01-31 09:04:52,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:04:52" (1/1) ... [2018-01-31 09:04:52,702 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:04:52,757 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:04:52,885 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:04:52,916 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:04:52,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:52 WrapperNode [2018-01-31 09:04:52,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:04:52,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:04:52,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:04:52,925 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:04:52,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:52" (1/1) ... [2018-01-31 09:04:52,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:52" (1/1) ... [2018-01-31 09:04:52,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:52" (1/1) ... [2018-01-31 09:04:52,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:52" (1/1) ... [2018-01-31 09:04:52,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:52" (1/1) ... [2018-01-31 09:04:52,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:52" (1/1) ... [2018-01-31 09:04:52,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:52" (1/1) ... [2018-01-31 09:04:52,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:04:52,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:04:52,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:04:52,971 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:04:52,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:52" (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 09:04:53,033 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:04:53,033 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:04:53,033 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 09:04:53,033 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:04:53,033 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:04:53,033 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:04:53,033 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:04:53,033 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:04:53,033 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:04:53,034 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:04:53,034 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:04:53,034 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:04:53,034 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 09:04:53,034 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:04:53,034 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:04:53,035 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:04:53,616 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:04:53,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:04:53 BoogieIcfgContainer [2018-01-31 09:04:53,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:04:53,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:04:53,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:04:53,622 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:04:53,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:04:52" (1/3) ... [2018-01-31 09:04:53,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75205710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:04:53, skipping insertion in model container [2018-01-31 09:04:53,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:52" (2/3) ... [2018-01-31 09:04:53,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75205710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:04:53, skipping insertion in model container [2018-01-31 09:04:53,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:04:53" (3/3) ... [2018-01-31 09:04:53,626 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-01-31 09:04:53,632 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:04:53,640 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-31 09:04:53,688 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:04:53,688 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:04:53,688 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:04:53,688 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:04:53,688 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:04:53,689 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:04:53,689 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:04:53,689 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:04:53,690 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:04:53,711 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-01-31 09:04:53,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-31 09:04:53,719 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:53,720 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:53,720 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:04:53,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1820134341, now seen corresponding path program 1 times [2018-01-31 09:04:53,729 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:53,730 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:53,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:53,787 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:53,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:53,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:53,912 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 09:04:53,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:53,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:04:53,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-31 09:04:53,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-31 09:04:53,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-31 09:04:53,937 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 2 states. [2018-01-31 09:04:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:53,977 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2018-01-31 09:04:53,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-31 09:04:53,978 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-31 09:04:53,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:53,992 INFO L225 Difference]: With dead ends: 140 [2018-01-31 09:04:53,992 INFO L226 Difference]: Without dead ends: 76 [2018-01-31 09:04:54,001 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-31 09:04:54,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-31 09:04:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-31 09:04:54,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 09:04:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-01-31 09:04:54,146 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 18 [2018-01-31 09:04:54,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:54,147 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-01-31 09:04:54,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-31 09:04:54,147 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-01-31 09:04:54,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 09:04:54,148 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:54,148 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] [2018-01-31 09:04:54,149 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:04:54,149 INFO L82 PathProgramCache]: Analyzing trace with hash -176739127, now seen corresponding path program 1 times [2018-01-31 09:04:54,149 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:54,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:54,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:54,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:54,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:54,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:54,304 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 09:04:54,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:54,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:04:54,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:04:54,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:04:54,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:04:54,307 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 5 states. [2018-01-31 09:04:54,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:54,815 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-31 09:04:54,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:04:54,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-31 09:04:54,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:54,818 INFO L225 Difference]: With dead ends: 76 [2018-01-31 09:04:54,818 INFO L226 Difference]: Without dead ends: 72 [2018-01-31 09:04:54,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:04:54,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-31 09:04:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-31 09:04:54,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-31 09:04:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-01-31 09:04:54,828 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 21 [2018-01-31 09:04:54,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:54,828 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-01-31 09:04:54,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:04:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-01-31 09:04:54,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 09:04:54,829 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:54,830 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] [2018-01-31 09:04:54,832 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:04:54,833 INFO L82 PathProgramCache]: Analyzing trace with hash -176739126, now seen corresponding path program 1 times [2018-01-31 09:04:54,833 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:54,833 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:54,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:54,834 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:54,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:54,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:55,057 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 09:04:55,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:55,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:04:55,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:04:55,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:04:55,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:04:55,111 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 6 states. [2018-01-31 09:04:55,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:55,828 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2018-01-31 09:04:55,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:04:55,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-31 09:04:55,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:55,831 INFO L225 Difference]: With dead ends: 133 [2018-01-31 09:04:55,831 INFO L226 Difference]: Without dead ends: 132 [2018-01-31 09:04:55,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:04:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-31 09:04:55,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 83. [2018-01-31 09:04:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 09:04:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-31 09:04:55,842 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 21 [2018-01-31 09:04:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:55,843 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-31 09:04:55,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:04:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-31 09:04:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 09:04:55,844 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:55,844 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:55,845 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:04:55,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1916522015, now seen corresponding path program 1 times [2018-01-31 09:04:55,845 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:55,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:55,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:55,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:55,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:55,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:55,945 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 09:04:55,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:55,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:04:55,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:04:55,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:04:55,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:04:55,947 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 4 states. [2018-01-31 09:04:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:55,995 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-01-31 09:04:55,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:04:55,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-31 09:04:55,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:55,996 INFO L225 Difference]: With dead ends: 83 [2018-01-31 09:04:55,996 INFO L226 Difference]: Without dead ends: 80 [2018-01-31 09:04:55,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:04:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-31 09:04:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-31 09:04:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-31 09:04:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-01-31 09:04:56,007 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 28 [2018-01-31 09:04:56,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:56,008 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-01-31 09:04:56,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:04:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-01-31 09:04:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 09:04:56,009 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:56,010 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:56,010 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:04:56,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1916522016, now seen corresponding path program 1 times [2018-01-31 09:04:56,010 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:56,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:56,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:56,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:56,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:56,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:56,218 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 09:04:56,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:56,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:04:56,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:04:56,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:04:56,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:04:56,219 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 7 states. [2018-01-31 09:04:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:56,469 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2018-01-31 09:04:56,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:04:56,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-31 09:04:56,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:56,476 INFO L225 Difference]: With dead ends: 170 [2018-01-31 09:04:56,476 INFO L226 Difference]: Without dead ends: 137 [2018-01-31 09:04:56,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:04:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-31 09:04:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 111. [2018-01-31 09:04:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-31 09:04:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2018-01-31 09:04:56,496 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 28 [2018-01-31 09:04:56,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:56,499 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2018-01-31 09:04:56,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:04:56,499 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2018-01-31 09:04:56,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 09:04:56,500 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:56,500 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] [2018-01-31 09:04:56,500 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:04:56,500 INFO L82 PathProgramCache]: Analyzing trace with hash -226141911, now seen corresponding path program 1 times [2018-01-31 09:04:56,501 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:56,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:56,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:56,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:56,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:56,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:04:56,825 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:56,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:04:56,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:04:56,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:04:56,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:04:56,827 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 8 states. [2018-01-31 09:04:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:57,321 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2018-01-31 09:04:57,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:04:57,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-31 09:04:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:57,323 INFO L225 Difference]: With dead ends: 127 [2018-01-31 09:04:57,323 INFO L226 Difference]: Without dead ends: 126 [2018-01-31 09:04:57,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:04:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-31 09:04:57,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2018-01-31 09:04:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-31 09:04:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2018-01-31 09:04:57,337 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 28 [2018-01-31 09:04:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:57,337 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2018-01-31 09:04:57,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:04:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2018-01-31 09:04:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:04:57,338 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:57,339 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:57,339 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:04:57,339 INFO L82 PathProgramCache]: Analyzing trace with hash 901425558, now seen corresponding path program 1 times [2018-01-31 09:04:57,339 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:57,339 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:57,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:57,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:57,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:57,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:04:57,414 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:04:57,414 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 09:04:57,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:57,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:04:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:04:57,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:04:57,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-01-31 09:04:57,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:04:57,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:04:57,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:04:57,605 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 9 states. [2018-01-31 09:04:57,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:57,865 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2018-01-31 09:04:57,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:04:57,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-31 09:04:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:57,869 INFO L225 Difference]: With dead ends: 156 [2018-01-31 09:04:57,869 INFO L226 Difference]: Without dead ends: 119 [2018-01-31 09:04:57,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-01-31 09:04:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-31 09:04:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2018-01-31 09:04:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-31 09:04:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-01-31 09:04:57,889 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 34 [2018-01-31 09:04:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:57,890 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-01-31 09:04:57,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:04:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-01-31 09:04:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 09:04:57,891 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:57,891 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:57,891 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:04:57,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1984706335, now seen corresponding path program 1 times [2018-01-31 09:04:57,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:57,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:57,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:57,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:57,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:57,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:04:58,254 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:58,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:04:58,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:04:58,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:04:58,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:04:58,255 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 9 states. [2018-01-31 09:04:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:58,483 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-01-31 09:04:58,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:04:58,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-31 09:04:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:58,484 INFO L225 Difference]: With dead ends: 161 [2018-01-31 09:04:58,484 INFO L226 Difference]: Without dead ends: 128 [2018-01-31 09:04:58,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:04:58,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-31 09:04:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 99. [2018-01-31 09:04:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 09:04:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-01-31 09:04:58,495 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 35 [2018-01-31 09:04:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:58,495 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-01-31 09:04:58,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:04:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-01-31 09:04:58,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 09:04:58,497 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:58,497 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:58,497 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:04:58,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1461534442, now seen corresponding path program 1 times [2018-01-31 09:04:58,498 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:58,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:58,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:58,499 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:58,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:58,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:58,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 09:04:58,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:58,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:04:58,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:04:58,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:04:58,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:04:58,691 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 9 states. [2018-01-31 09:04:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:59,088 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2018-01-31 09:04:59,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:04:59,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-01-31 09:04:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:59,089 INFO L225 Difference]: With dead ends: 125 [2018-01-31 09:04:59,089 INFO L226 Difference]: Without dead ends: 121 [2018-01-31 09:04:59,090 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:04:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-31 09:04:59,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 100. [2018-01-31 09:04:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-31 09:04:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2018-01-31 09:04:59,099 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 39 [2018-01-31 09:04:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:59,099 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2018-01-31 09:04:59,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:04:59,099 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2018-01-31 09:04:59,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 09:04:59,101 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:59,101 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:59,101 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:04:59,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1937072529, now seen corresponding path program 1 times [2018-01-31 09:04:59,101 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:59,102 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:59,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:59,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:59,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:59,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 09:04:59,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:59,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:04:59,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:04:59,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:04:59,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:04:59,336 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 4 states. [2018-01-31 09:04:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:59,408 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-01-31 09:04:59,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:04:59,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-31 09:04:59,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:59,410 INFO L225 Difference]: With dead ends: 121 [2018-01-31 09:04:59,411 INFO L226 Difference]: Without dead ends: 120 [2018-01-31 09:04:59,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:04:59,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-31 09:04:59,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2018-01-31 09:04:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-31 09:04:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-01-31 09:04:59,420 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 40 [2018-01-31 09:04:59,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:59,420 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-01-31 09:04:59,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:04:59,420 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-01-31 09:04:59,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-31 09:04:59,422 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:59,422 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:59,422 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:04:59,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1331810199, now seen corresponding path program 1 times [2018-01-31 09:04:59,423 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:59,423 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:59,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:59,424 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:59,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:59,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:04:59,716 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:04:59,716 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 09:04:59,723 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:59,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:04:59,792 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 8 treesize of output 7 [2018-01-31 09:04:59,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:04:59,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:04:59,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-31 09:04:59,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 15 [2018-01-31 09:04:59,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:04:59,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 09:04:59,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-01-31 09:05:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:00,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:05:00,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-01-31 09:05:00,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 09:05:00,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 09:05:00,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:05:00,089 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 15 states. [2018-01-31 09:05:00,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:00,790 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-01-31 09:05:00,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 09:05:00,790 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-01-31 09:05:00,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:00,791 INFO L225 Difference]: With dead ends: 165 [2018-01-31 09:05:00,791 INFO L226 Difference]: Without dead ends: 132 [2018-01-31 09:05:00,792 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-01-31 09:05:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-31 09:05:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2018-01-31 09:05:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-31 09:05:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2018-01-31 09:05:00,801 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 41 [2018-01-31 09:05:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:00,801 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2018-01-31 09:05:00,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 09:05:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-01-31 09:05:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 09:05:00,803 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:00,803 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:00,803 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:00,803 INFO L82 PathProgramCache]: Analyzing trace with hash 387514716, now seen corresponding path program 1 times [2018-01-31 09:05:00,803 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:00,803 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:00,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:00,804 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:00,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:00,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:01,365 WARN L146 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 10 DAG size of output 7 [2018-01-31 09:05:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 09:05:01,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:01,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:05:01,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:05:01,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:05:01,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:05:01,455 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 8 states. [2018-01-31 09:05:01,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:01,610 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2018-01-31 09:05:01,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:05:01,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-31 09:05:01,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:01,612 INFO L225 Difference]: With dead ends: 107 [2018-01-31 09:05:01,612 INFO L226 Difference]: Without dead ends: 106 [2018-01-31 09:05:01,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:05:01,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-31 09:05:01,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-31 09:05:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-31 09:05:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2018-01-31 09:05:01,619 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 45 [2018-01-31 09:05:01,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:01,620 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2018-01-31 09:05:01,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:05:01,620 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2018-01-31 09:05:01,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 09:05:01,621 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:01,621 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:01,621 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:01,622 INFO L82 PathProgramCache]: Analyzing trace with hash 387514717, now seen corresponding path program 1 times [2018-01-31 09:05:01,622 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:01,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:01,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:01,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:01,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:01,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 09:05:02,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:02,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 09:05:02,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:05:02,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:05:02,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:05:02,039 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand 10 states. [2018-01-31 09:05:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:02,358 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-01-31 09:05:02,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:05:02,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-31 09:05:02,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:02,359 INFO L225 Difference]: With dead ends: 106 [2018-01-31 09:05:02,359 INFO L226 Difference]: Without dead ends: 104 [2018-01-31 09:05:02,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-01-31 09:05:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-31 09:05:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-31 09:05:02,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-31 09:05:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2018-01-31 09:05:02,367 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 45 [2018-01-31 09:05:02,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:02,368 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2018-01-31 09:05:02,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:05:02,368 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-01-31 09:05:02,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 09:05:02,369 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:02,369 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:02,369 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:02,370 INFO L82 PathProgramCache]: Analyzing trace with hash 377971666, now seen corresponding path program 1 times [2018-01-31 09:05:02,370 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:02,370 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:02,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:02,371 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:02,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:02,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 09:05:03,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:03,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 09:05:03,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:05:03,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:05:03,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:05:03,237 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand 10 states. [2018-01-31 09:05:03,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:03,806 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-01-31 09:05:03,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 09:05:03,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-31 09:05:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:03,807 INFO L225 Difference]: With dead ends: 120 [2018-01-31 09:05:03,807 INFO L226 Difference]: Without dead ends: 115 [2018-01-31 09:05:03,808 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-01-31 09:05:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-31 09:05:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2018-01-31 09:05:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-31 09:05:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions. [2018-01-31 09:05:03,817 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 45 [2018-01-31 09:05:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:03,817 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions. [2018-01-31 09:05:03,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:05:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2018-01-31 09:05:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 09:05:03,818 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:03,819 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:03,819 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:03,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1260510115, now seen corresponding path program 1 times [2018-01-31 09:05:03,819 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:03,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:03,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:03,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:03,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:03,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 09:05:04,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:04,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:05:04,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:05:04,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:05:04,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:05:04,116 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand 9 states. [2018-01-31 09:05:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:04,515 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-01-31 09:05:04,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:05:04,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-01-31 09:05:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:04,516 INFO L225 Difference]: With dead ends: 105 [2018-01-31 09:05:04,516 INFO L226 Difference]: Without dead ends: 70 [2018-01-31 09:05:04,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:05:04,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-31 09:05:04,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-31 09:05:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-31 09:05:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-01-31 09:05:04,523 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 47 [2018-01-31 09:05:04,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:04,523 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-01-31 09:05:04,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:05:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-01-31 09:05:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 09:05:04,524 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:04,524 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:04,524 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:04,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1683917363, now seen corresponding path program 2 times [2018-01-31 09:05:04,524 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:04,525 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:04,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:04,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:04,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:04,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:04,743 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 09:05:04,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:05:04,743 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:05:04,750 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:05:04,766 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:05:04,771 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:05:04,771 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:05:04,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:05:04,856 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:04,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:05:04,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-01-31 09:05:04,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 09:05:04,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 09:05:04,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:05:04,882 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 15 states. [2018-01-31 09:05:05,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:05,160 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2018-01-31 09:05:05,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 09:05:05,177 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-01-31 09:05:05,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:05,178 INFO L225 Difference]: With dead ends: 161 [2018-01-31 09:05:05,178 INFO L226 Difference]: Without dead ends: 132 [2018-01-31 09:05:05,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-01-31 09:05:05,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-31 09:05:05,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-31 09:05:05,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-31 09:05:05,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-31 09:05:05,187 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 47 [2018-01-31 09:05:05,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:05,188 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-31 09:05:05,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 09:05:05,188 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-31 09:05:05,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-31 09:05:05,188 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:05,189 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:05,189 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:05,189 INFO L82 PathProgramCache]: Analyzing trace with hash -365721621, now seen corresponding path program 1 times [2018-01-31 09:05:05,189 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:05,189 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:05,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:05,190 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:05:05,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:05,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-31 09:05:05,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:05,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:05:05,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:05:05,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:05:05,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:05:05,420 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 9 states. [2018-01-31 09:05:05,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:05,675 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2018-01-31 09:05:05,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:05:05,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-01-31 09:05:05,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:05,677 INFO L225 Difference]: With dead ends: 121 [2018-01-31 09:05:05,677 INFO L226 Difference]: Without dead ends: 120 [2018-01-31 09:05:05,678 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:05:05,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-31 09:05:05,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2018-01-31 09:05:05,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 09:05:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2018-01-31 09:05:05,690 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 50 [2018-01-31 09:05:05,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:05,691 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2018-01-31 09:05:05,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:05:05,691 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-01-31 09:05:05,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 09:05:05,692 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:05,692 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:05,692 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:05,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1998969196, now seen corresponding path program 3 times [2018-01-31 09:05:05,692 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:05,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:05,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:05,693 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:05,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:05,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:06,224 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:05:06,224 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 09:05:06,229 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:05:06,243 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:05:06,247 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:05:06,248 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:05:06,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:05:06,260 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 09:05:06,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:06,361 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 8 treesize of output 7 [2018-01-31 09:05:06,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:06,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:06,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-31 09:05:06,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:06,402 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 16 treesize of output 19 [2018-01-31 09:05:06,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:06,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:06,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:06,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 09:05:06,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:06,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:05:06,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-31 09:05:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-31 09:05:06,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:05:06,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 21 [2018-01-31 09:05:06,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 09:05:06,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 09:05:06,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-01-31 09:05:06,673 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand 22 states. [2018-01-31 09:05:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:09,156 INFO L93 Difference]: Finished difference Result 163 states and 168 transitions. [2018-01-31 09:05:09,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-31 09:05:09,156 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-01-31 09:05:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:09,157 INFO L225 Difference]: With dead ends: 163 [2018-01-31 09:05:09,157 INFO L226 Difference]: Without dead ends: 139 [2018-01-31 09:05:09,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=535, Invalid=2327, Unknown=0, NotChecked=0, Total=2862 [2018-01-31 09:05:09,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-31 09:05:09,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 120. [2018-01-31 09:05:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-31 09:05:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2018-01-31 09:05:09,169 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 54 [2018-01-31 09:05:09,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:09,169 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2018-01-31 09:05:09,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 09:05:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2018-01-31 09:05:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 09:05:09,170 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:09,170 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:09,170 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:09,171 INFO L82 PathProgramCache]: Analyzing trace with hash 253281953, now seen corresponding path program 1 times [2018-01-31 09:05:09,171 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:09,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:09,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:09,172 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:05:09,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:09,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-31 09:05:09,893 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:05:09,893 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) [2018-01-31 09:05:09,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:05:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:09,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:05:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-31 09:05:10,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:05:10,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-01-31 09:05:10,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 09:05:10,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 09:05:10,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-31 09:05:10,005 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand 11 states. [2018-01-31 09:05:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:10,166 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2018-01-31 09:05:10,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:05:10,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-01-31 09:05:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:10,201 INFO L225 Difference]: With dead ends: 151 [2018-01-31 09:05:10,201 INFO L226 Difference]: Without dead ends: 132 [2018-01-31 09:05:10,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-01-31 09:05:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-31 09:05:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 119. [2018-01-31 09:05:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-31 09:05:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2018-01-31 09:05:10,212 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 56 [2018-01-31 09:05:10,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:10,213 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2018-01-31 09:05:10,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 09:05:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-01-31 09:05:10,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-31 09:05:10,213 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:10,214 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:10,214 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:10,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1409227191, now seen corresponding path program 1 times [2018-01-31 09:05:10,214 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:10,214 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:10,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:10,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:10,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:10,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:10,952 WARN L146 SmtUtils]: Spent 361ms on a formula simplification. DAG size of input: 20 DAG size of output 15 [2018-01-31 09:05:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 09:05:11,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:11,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:05:11,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:05:11,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:05:11,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:05:11,024 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand 7 states. [2018-01-31 09:05:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:11,152 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-01-31 09:05:11,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:05:11,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-01-31 09:05:11,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:11,153 INFO L225 Difference]: With dead ends: 119 [2018-01-31 09:05:11,153 INFO L226 Difference]: Without dead ends: 118 [2018-01-31 09:05:11,153 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:05:11,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-31 09:05:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-01-31 09:05:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-31 09:05:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2018-01-31 09:05:11,166 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 58 [2018-01-31 09:05:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:11,166 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2018-01-31 09:05:11,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:05:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2018-01-31 09:05:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-31 09:05:11,167 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:11,167 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:11,167 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:11,167 INFO L82 PathProgramCache]: Analyzing trace with hash -736369936, now seen corresponding path program 1 times [2018-01-31 09:05:11,168 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:11,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:11,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:11,169 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:11,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:11,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-31 09:05:11,543 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:05:11,543 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 09:05:11,550 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:11,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:05:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-31 09:05:11,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:05:11,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 18 [2018-01-31 09:05:11,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 09:05:11,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 09:05:11,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-01-31 09:05:11,749 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand 19 states. [2018-01-31 09:05:12,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:12,779 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-01-31 09:05:12,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-31 09:05:12,780 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-01-31 09:05:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:12,782 INFO L225 Difference]: With dead ends: 129 [2018-01-31 09:05:12,782 INFO L226 Difference]: Without dead ends: 128 [2018-01-31 09:05:12,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=346, Invalid=1460, Unknown=0, NotChecked=0, Total=1806 [2018-01-31 09:05:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-31 09:05:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2018-01-31 09:05:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-31 09:05:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2018-01-31 09:05:12,792 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 59 [2018-01-31 09:05:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:12,792 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2018-01-31 09:05:12,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 09:05:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2018-01-31 09:05:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-31 09:05:12,793 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:12,793 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:12,793 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:12,793 INFO L82 PathProgramCache]: Analyzing trace with hash -951990287, now seen corresponding path program 1 times [2018-01-31 09:05:12,793 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:12,793 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:12,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:12,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:12,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:12,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:13,979 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:13,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:05:13,979 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 09:05:13,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:14,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:05:14,035 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 09:05:14,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-31 09:05:14,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:14,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:14,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 09:05:14,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-31 09:05:14,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 09:05:14,215 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 8 treesize of output 7 [2018-01-31 09:05:14,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-31 09:05:14,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-31 09:05:14,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-01-31 09:05:14,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-01-31 09:05:14,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2018-01-31 09:05:14,541 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-01-31 09:05:14,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 22 treesize of output 30 [2018-01-31 09:05:14,544 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,548 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-01-31 09:05:14,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:14,562 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 14 treesize of output 19 [2018-01-31 09:05:14,562 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,569 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-31 09:05:14,586 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:70, output treesize:50 [2018-01-31 09:05:14,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2018-01-31 09:05:14,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:14,808 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:05:14,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:14,809 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:05:14,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 81 [2018-01-31 09:05:14,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 12 [2018-01-31 09:05:14,824 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:14,831 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:88, output treesize:15 [2018-01-31 09:05:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:14,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:05:14,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 38 [2018-01-31 09:05:14,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-31 09:05:14,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-31 09:05:14,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1258, Unknown=21, NotChecked=0, Total=1406 [2018-01-31 09:05:14,887 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand 38 states. [2018-01-31 09:05:19,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:19,271 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2018-01-31 09:05:19,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-31 09:05:19,272 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 64 [2018-01-31 09:05:19,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:19,273 INFO L225 Difference]: With dead ends: 130 [2018-01-31 09:05:19,273 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 09:05:19,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=476, Invalid=3888, Unknown=58, NotChecked=0, Total=4422 [2018-01-31 09:05:19,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 09:05:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-01-31 09:05:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-31 09:05:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-01-31 09:05:19,284 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 64 [2018-01-31 09:05:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:19,284 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-01-31 09:05:19,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-31 09:05:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-01-31 09:05:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 09:05:19,285 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:19,285 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:19,285 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:19,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1241565140, now seen corresponding path program 2 times [2018-01-31 09:05:19,286 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:19,286 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:19,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:19,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:19,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:19,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-31 09:05:19,927 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:05:19,927 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 09:05:19,933 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:05:19,946 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:05:19,953 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:05:19,955 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:05:19,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:05:19,983 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 8 treesize of output 7 [2018-01-31 09:05:19,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:19,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:19,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 09:05:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-01-31 09:05:20,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:05:20,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 20 [2018-01-31 09:05:20,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 09:05:20,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 09:05:20,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-01-31 09:05:20,118 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 21 states. [2018-01-31 09:05:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:21,023 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-01-31 09:05:21,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 09:05:21,024 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-01-31 09:05:21,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:21,024 INFO L225 Difference]: With dead ends: 95 [2018-01-31 09:05:21,024 INFO L226 Difference]: Without dead ends: 84 [2018-01-31 09:05:21,025 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=1345, Unknown=0, NotChecked=0, Total=1560 [2018-01-31 09:05:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-31 09:05:21,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-31 09:05:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 09:05:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-01-31 09:05:21,034 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 69 [2018-01-31 09:05:21,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:21,034 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-01-31 09:05:21,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 09:05:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-01-31 09:05:21,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-31 09:05:21,035 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:21,035 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 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 09:05:21,035 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:21,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1032811122, now seen corresponding path program 2 times [2018-01-31 09:05:21,035 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:21,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:21,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:21,037 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:05:21,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:21,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:22,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:05:22,366 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 09:05:22,373 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:05:22,389 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:05:22,397 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:05:22,399 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:05:22,403 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:05:22,576 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 09:05:22,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:22,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:22,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:05:22,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:22,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:22,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 09:05:22,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:22,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:22,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-31 09:05:22,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 09:05:22,771 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 8 treesize of output 7 [2018-01-31 09:05:22,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:22,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:22,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:22,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-31 09:05:22,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-31 09:05:22,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-01-31 09:05:22,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:22,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:22,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:22,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-01-31 09:05:23,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-01-31 09:05:23,770 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-01-31 09:05:23,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2018-01-31 09:05:23,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2018-01-31 09:05:23,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:23,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:23,793 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:23,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-01-31 09:05:23,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:23,812 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-01-31 09:05:23,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:23,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:23,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-31 09:05:23,816 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:23,981 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:24,173 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:24,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:24,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-31 09:05:24,297 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:98, output treesize:79 [2018-01-31 09:05:24,587 WARN L143 SmtUtils]: Spent 144ms on a formula simplification that was a NOOP. DAG size: 55 [2018-01-31 09:05:24,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 94 [2018-01-31 09:05:24,597 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:24,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:24,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:24,599 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:24,600 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:24,600 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:05:24,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:24,608 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:05:24,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 168 [2018-01-31 09:05:24,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:24,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 19 [2018-01-31 09:05:24,634 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:24,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:24,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:24,644 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:129, output treesize:10 [2018-01-31 09:05:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 13 proven. 13 refuted. 21 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:24,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:05:24,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 56 [2018-01-31 09:05:24,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-31 09:05:24,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-31 09:05:24,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2776, Unknown=51, NotChecked=0, Total=3080 [2018-01-31 09:05:24,727 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 56 states. [2018-01-31 09:05:31,120 WARN L146 SmtUtils]: Spent 316ms on a formula simplification. DAG size of input: 80 DAG size of output 53 [2018-01-31 09:05:31,757 WARN L146 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 82 DAG size of output 74 [2018-01-31 09:05:32,381 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 78 DAG size of output 57 [2018-01-31 09:05:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:34,040 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-01-31 09:05:34,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-01-31 09:05:34,040 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 83 [2018-01-31 09:05:34,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:34,042 INFO L225 Difference]: With dead ends: 170 [2018-01-31 09:05:34,042 INFO L226 Difference]: Without dead ends: 154 [2018-01-31 09:05:34,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4334 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1283, Invalid=14517, Unknown=202, NotChecked=0, Total=16002 [2018-01-31 09:05:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-31 09:05:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2018-01-31 09:05:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-31 09:05:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-01-31 09:05:34,066 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 83 [2018-01-31 09:05:34,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:34,066 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-01-31 09:05:34,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-01-31 09:05:34,067 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-01-31 09:05:34,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-31 09:05:34,069 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:34,069 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:34,069 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:34,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1359615464, now seen corresponding path program 3 times [2018-01-31 09:05:34,069 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:34,070 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:34,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:34,070 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:05:34,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:34,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-31 09:05:35,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:05:35,281 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 09:05:35,287 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:05:35,304 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:05:35,309 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:05:35,313 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:05:35,318 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:05:35,319 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:05:35,321 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:05:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-31 09:05:35,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:05:35,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2018-01-31 09:05:35,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 09:05:35,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 09:05:35,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:05:35,403 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 18 states. [2018-01-31 09:05:35,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:35,734 INFO L93 Difference]: Finished difference Result 217 states and 223 transitions. [2018-01-31 09:05:35,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 09:05:35,734 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 89 [2018-01-31 09:05:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:35,735 INFO L225 Difference]: With dead ends: 217 [2018-01-31 09:05:35,735 INFO L226 Difference]: Without dead ends: 131 [2018-01-31 09:05:35,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=158, Invalid=898, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 09:05:35,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-31 09:05:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 104. [2018-01-31 09:05:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-31 09:05:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2018-01-31 09:05:35,752 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 89 [2018-01-31 09:05:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:35,753 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2018-01-31 09:05:35,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 09:05:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-01-31 09:05:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-01-31 09:05:35,753 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:35,754 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:35,754 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:35,754 INFO L82 PathProgramCache]: Analyzing trace with hash 71567515, now seen corresponding path program 4 times [2018-01-31 09:05:35,754 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:35,754 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:35,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:35,755 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:05:35,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:35,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-31 09:05:36,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:05:36,607 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 09:05:36,615 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 09:05:36,640 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:05:36,643 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:05:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-31 09:05:36,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:05:36,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2018-01-31 09:05:36,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 09:05:36,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 09:05:36,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-01-31 09:05:36,787 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand 26 states. [2018-01-31 09:05:37,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:37,201 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2018-01-31 09:05:37,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-31 09:05:37,202 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 96 [2018-01-31 09:05:37,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:37,202 INFO L225 Difference]: With dead ends: 134 [2018-01-31 09:05:37,203 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 09:05:37,203 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=1719, Unknown=0, NotChecked=0, Total=2070 [2018-01-31 09:05:37,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 09:05:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 97. [2018-01-31 09:05:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-31 09:05:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-01-31 09:05:37,217 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 96 [2018-01-31 09:05:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:37,218 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-01-31 09:05:37,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 09:05:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-01-31 09:05:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-01-31 09:05:37,219 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:37,219 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:37,219 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:37,219 INFO L82 PathProgramCache]: Analyzing trace with hash 956728007, now seen corresponding path program 5 times [2018-01-31 09:05:37,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:37,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:37,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:37,220 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:05:37,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:37,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-31 09:05:37,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:05:37,736 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 09:05:37,742 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 09:05:37,752 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:05:37,756 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:05:37,760 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:05:37,773 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:05:37,775 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:05:37,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:05:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 24 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-31 09:05:37,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:05:37,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-01-31 09:05:37,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 09:05:37,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 09:05:37,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-01-31 09:05:37,870 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 22 states. [2018-01-31 09:05:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:38,069 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2018-01-31 09:05:38,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 09:05:38,069 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 96 [2018-01-31 09:05:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:38,070 INFO L225 Difference]: With dead ends: 137 [2018-01-31 09:05:38,070 INFO L226 Difference]: Without dead ends: 106 [2018-01-31 09:05:38,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=922, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 09:05:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-31 09:05:38,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-01-31 09:05:38,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-31 09:05:38,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-01-31 09:05:38,085 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 96 [2018-01-31 09:05:38,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:38,086 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-01-31 09:05:38,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 09:05:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-01-31 09:05:38,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-31 09:05:38,087 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:38,088 INFO L351 BasicCegarLoop]: trace histogram [5, 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, 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 09:05:38,088 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:05:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1604998831, now seen corresponding path program 6 times [2018-01-31 09:05:38,088 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:38,088 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:38,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:38,089 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:05:38,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:38,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:39,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:05:39,959 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 09:05:39,964 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 09:05:39,981 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:05:39,996 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:05:40,000 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:05:40,005 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:05:40,011 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:05:40,013 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:05:40,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:05:40,018 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 09:05:40,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:40,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:40,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 09:05:40,076 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:40,076 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:40,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 09:05:40,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:40,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:40,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-31 09:05:40,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 09:05:40,214 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 8 treesize of output 7 [2018-01-31 09:05:40,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:40,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:40,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:40,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-31 09:05:40,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-31 09:05:40,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-01-31 09:05:40,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:40,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:40,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:40,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-01-31 09:05:43,197 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 62 DAG size of output 54 [2018-01-31 09:05:43,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 70 [2018-01-31 09:05:43,215 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-01-31 09:05:43,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2018-01-31 09:05:43,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2018-01-31 09:05:43,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2018-01-31 09:05:43,241 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:43,251 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:43,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:43,271 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:43,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-01-31 09:05:43,296 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,297 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2018-01-31 09:05:43,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 52 [2018-01-31 09:05:43,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,307 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,307 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,309 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-01-31 09:05:43,311 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:43,324 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:43,332 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:43,345 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:43,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:43,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-01-31 09:05:43,381 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:124, output treesize:106 [2018-01-31 09:05:43,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 111 [2018-01-31 09:05:43,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,645 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:05:43,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,647 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,649 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,649 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:05:43,650 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:05:43,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 203 [2018-01-31 09:05:43,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:43,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 11 [2018-01-31 09:05:43,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 09:05:43,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:43,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:05:43,741 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:160, output treesize:10 [2018-01-31 09:05:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 29 refuted. 39 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-31 09:05:43,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:05:43,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 29] total 63 [2018-01-31 09:05:43,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-01-31 09:05:43,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-01-31 09:05:43,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3629, Unknown=85, NotChecked=0, Total=3906 [2018-01-31 09:05:43,863 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 63 states. [2018-01-31 09:05:50,670 WARN L146 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 83 DAG size of output 55 [2018-01-31 09:05:50,930 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 83 DAG size of output 56 [2018-01-31 09:05:52,678 WARN L146 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 89 DAG size of output 62 [2018-01-31 09:05:53,800 WARN L146 SmtUtils]: Spent 353ms on a formula simplification. DAG size of input: 97 DAG size of output 73 [2018-01-31 09:05:54,051 WARN L146 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 76 DAG size of output 59 [2018-01-31 09:05:54,597 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 76 DAG size of output 62 [2018-01-31 09:05:56,333 WARN L146 SmtUtils]: Spent 613ms on a formula simplification. DAG size of input: 112 DAG size of output 76 [2018-01-31 09:06:01,583 WARN L146 SmtUtils]: Spent 1837ms on a formula simplification. DAG size of input: 116 DAG size of output 80 [2018-01-31 09:06:02,547 WARN L146 SmtUtils]: Spent 273ms on a formula simplification. DAG size of input: 40 DAG size of output 38 [2018-01-31 09:06:07,130 WARN L146 SmtUtils]: Spent 737ms on a formula simplification. DAG size of input: 117 DAG size of output 76 [2018-01-31 09:06:08,036 WARN L146 SmtUtils]: Spent 506ms on a formula simplification. DAG size of input: 82 DAG size of output 68 [2018-01-31 09:06:09,001 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 105 DAG size of output 64 [2018-01-31 09:06:12,118 WARN L146 SmtUtils]: Spent 648ms on a formula simplification. DAG size of input: 100 DAG size of output 85 [2018-01-31 09:06:13,578 WARN L146 SmtUtils]: Spent 272ms on a formula simplification. DAG size of input: 122 DAG size of output 66 [2018-01-31 09:06:16,470 WARN L143 SmtUtils]: Spent 222ms on a formula simplification that was a NOOP. DAG size: 61 [2018-01-31 09:06:17,509 WARN L143 SmtUtils]: Spent 138ms on a formula simplification that was a NOOP. DAG size: 71 [2018-01-31 09:06:25,628 WARN L146 SmtUtils]: Spent 4853ms on a formula simplification. DAG size of input: 113 DAG size of output 85 [2018-01-31 09:06:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:06:27,253 INFO L93 Difference]: Finished difference Result 264 states and 273 transitions. [2018-01-31 09:06:27,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-01-31 09:06:27,254 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 102 [2018-01-31 09:06:27,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:06:27,255 INFO L225 Difference]: With dead ends: 264 [2018-01-31 09:06:27,255 INFO L226 Difference]: Without dead ends: 145 [2018-01-31 09:06:27,260 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10382 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=1793, Invalid=32264, Unknown=725, NotChecked=0, Total=34782 [2018-01-31 09:06:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-31 09:06:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 123. [2018-01-31 09:06:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-31 09:06:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2018-01-31 09:06:27,275 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 102 [2018-01-31 09:06:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:06:27,275 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2018-01-31 09:06:27,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-01-31 09:06:27,276 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2018-01-31 09:06:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-31 09:06:27,276 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:06:27,276 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:06:27,277 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:06:27,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1942351588, now seen corresponding path program 7 times [2018-01-31 09:06:27,277 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:06:27,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:06:27,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:06:27,278 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:06:27,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:06:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:06:27,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:06:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 27 proven. 67 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-31 09:06:28,111 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:06:28,111 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 09:06:28,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:06:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:06:28,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:06:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 54 proven. 24 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-31 09:06:28,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:06:28,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-01-31 09:06:28,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-31 09:06:28,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-31 09:06:28,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 09:06:28,352 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand 34 states. [2018-01-31 09:06:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:06:28,932 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-01-31 09:06:28,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-31 09:06:28,932 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 115 [2018-01-31 09:06:28,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:06:28,933 INFO L225 Difference]: With dead ends: 159 [2018-01-31 09:06:28,933 INFO L226 Difference]: Without dead ends: 149 [2018-01-31 09:06:28,933 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=575, Invalid=3085, Unknown=0, NotChecked=0, Total=3660 [2018-01-31 09:06:28,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-31 09:06:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 116. [2018-01-31 09:06:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 09:06:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-01-31 09:06:28,950 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 115 [2018-01-31 09:06:28,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:06:28,951 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-01-31 09:06:28,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-31 09:06:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-01-31 09:06:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-31 09:06:28,952 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:06:28,952 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:06:28,952 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:06:28,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2001418824, now seen corresponding path program 8 times [2018-01-31 09:06:28,952 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:06:28,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:06:28,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:06:28,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:06:28,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:06:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:06:28,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:06:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 32 proven. 56 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-31 09:06:29,330 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:06:29,330 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 09:06:29,335 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:06:29,351 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:06:29,362 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:06:29,364 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:06:29,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:06:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 54 proven. 44 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-31 09:06:29,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:06:29,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-01-31 09:06:29,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-31 09:06:29,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-31 09:06:29,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2018-01-31 09:06:29,637 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 37 states. [2018-01-31 09:06:30,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:06:30,053 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-01-31 09:06:30,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-31 09:06:30,053 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 115 [2018-01-31 09:06:30,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:06:30,054 INFO L225 Difference]: With dead ends: 165 [2018-01-31 09:06:30,054 INFO L226 Difference]: Without dead ends: 128 [2018-01-31 09:06:30,057 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=485, Invalid=2595, Unknown=0, NotChecked=0, Total=3080 [2018-01-31 09:06:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-31 09:06:30,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-01-31 09:06:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-31 09:06:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-01-31 09:06:30,079 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 115 [2018-01-31 09:06:30,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:06:30,079 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-01-31 09:06:30,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-31 09:06:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-01-31 09:06:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-01-31 09:06:30,080 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:06:30,081 INFO L351 BasicCegarLoop]: trace histogram [6, 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, 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 09:06:30,081 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:06:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1314288366, now seen corresponding path program 9 times [2018-01-31 09:06:30,081 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:06:30,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:06:30,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:06:30,084 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:06:30,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:06:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:06:30,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:06:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:06:32,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:06:32,859 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 09:06:32,866 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:06:32,882 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:06:32,888 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:06:32,892 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:06:32,900 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:06:32,910 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:06:32,918 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:06:32,919 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:06:32,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:06:33,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:06:33,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:06:33,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:33,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:06:33,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:06:33,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:06:33,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 09:06:33,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:06:33,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:33,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-31 09:06:33,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 09:06:33,565 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 8 treesize of output 7 [2018-01-31 09:06:33,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:06:33,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:33,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:33,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-31 09:06:33,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-31 09:06:33,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-01-31 09:06:33,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:06:33,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:33,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:33,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-01-31 09:06:39,143 WARN L146 SmtUtils]: Spent 423ms on a formula simplification. DAG size of input: 78 DAG size of output 69 [2018-01-31 09:06:39,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 88 [2018-01-31 09:06:39,211 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-01-31 09:06:39,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2018-01-31 09:06:39,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 54 [2018-01-31 09:06:39,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 56 [2018-01-31 09:06:39,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 63 [2018-01-31 09:06:39,323 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-31 09:06:39,349 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:39,375 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:39,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:39,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:39,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 98 [2018-01-31 09:06:39,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:06:39,489 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 49 [2018-01-31 09:06:39,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:06:39,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:06:39,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 70 [2018-01-31 09:06:39,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:06:39,502 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:06:39,504 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:06:39,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 80 [2018-01-31 09:06:39,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:06:39,653 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:06:39,698 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:06:39,699 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:06:39,701 INFO L303 Elim1Store]: Index analysis took 195 ms [2018-01-31 09:06:39,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2018-01-31 09:06:39,702 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-31 09:06:39,718 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:39,731 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:39,742 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:39,762 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:39,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:39,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-01-31 09:06:39,817 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 12 variables, input treesize:157, output treesize:140 [2018-01-31 09:06:40,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 128 [2018-01-31 09:06:40,235 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:06:40,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:06:40,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:06:40,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:06:40,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 151 [2018-01-31 09:06:40,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:06:40,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 18 [2018-01-31 09:06:40,305 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 09:06:40,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:40,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:06:40,317 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:182, output treesize:7 [2018-01-31 09:06:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 54 proven. 25 refuted. 89 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:06:40,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:06:40,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 80 [2018-01-31 09:06:40,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-01-31 09:06:40,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-01-31 09:06:40,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=5676, Unknown=205, NotChecked=0, Total=6320 [2018-01-31 09:06:40,511 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 80 states. [2018-01-31 09:06:48,930 WARN L146 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 80 DAG size of output 64 [2018-01-31 09:06:49,797 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 80 DAG size of output 64 [2018-01-31 09:06:50,604 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 76 DAG size of output 60 [2018-01-31 09:06:53,866 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 67 DAG size of output 59 [2018-01-31 09:06:54,323 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 67 DAG size of output 59 [2018-01-31 09:07:00,778 WARN L146 SmtUtils]: Spent 845ms on a formula simplification. DAG size of input: 105 DAG size of output 83 [2018-01-31 09:07:13,253 WARN L146 SmtUtils]: Spent 1724ms on a formula simplification. DAG size of input: 105 DAG size of output 83 Received shutdown request... [2018-01-31 09:07:16,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-01-31 09:07:16,798 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 09:07:16,804 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 09:07:16,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:07:16 BoogieIcfgContainer [2018-01-31 09:07:16,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:07:16,808 INFO L168 Benchmark]: Toolchain (without parser) took 144146.66 ms. Allocated memory was 302.5 MB in the beginning and 755.5 MB in the end (delta: 453.0 MB). Free memory was 261.2 MB in the beginning and 489.3 MB in the end (delta: -228.1 MB). Peak memory consumption was 224.9 MB. Max. memory is 5.3 GB. [2018-01-31 09:07:16,809 INFO L168 Benchmark]: CDTParser took 1.14 ms. Allocated memory is still 302.5 MB. Free memory is still 267.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:07:16,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.59 ms. Allocated memory is still 302.5 MB. Free memory was 261.2 MB in the beginning and 251.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:07:16,810 INFO L168 Benchmark]: Boogie Preprocessor took 45.72 ms. Allocated memory is still 302.5 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:07:16,815 INFO L168 Benchmark]: RCFGBuilder took 646.20 ms. Allocated memory is still 302.5 MB. Free memory was 249.3 MB in the beginning and 226.3 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. [2018-01-31 09:07:16,815 INFO L168 Benchmark]: TraceAbstraction took 143189.82 ms. Allocated memory was 302.5 MB in the beginning and 755.5 MB in the end (delta: 453.0 MB). Free memory was 226.3 MB in the beginning and 489.3 MB in the end (delta: -262.9 MB). Peak memory consumption was 190.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:07:16,817 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14 ms. Allocated memory is still 302.5 MB. Free memory is still 267.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 252.59 ms. Allocated memory is still 302.5 MB. Free memory was 261.2 MB in the beginning and 251.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.72 ms. Allocated memory is still 302.5 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 646.20 ms. Allocated memory is still 302.5 MB. Free memory was 249.3 MB in the beginning and 226.3 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 143189.82 ms. Allocated memory was 302.5 MB in the beginning and 755.5 MB in the end (delta: 453.0 MB). Free memory was 226.3 MB in the beginning and 489.3 MB in the end (delta: -262.9 MB). Peak memory consumption was 190.0 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 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 90 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 167 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 79 locations, 19 error locations. TIMEOUT Result, 143.1s OverallTime, 31 OverallIterations, 6 TraceHistogramMax, 105.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1670 SDtfs, 5236 SDslu, 12184 SDs, 0 SdLazy, 14262 SolverSat, 1321 SolverUnsat, 2069 SolverUnknown, 0 SolverNotchecked, 40.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2203 GetRequests, 1078 SyntacticMatches, 37 SemanticMatches, 1087 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26954 ImplicationChecksByTransitivity, 91.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=24, 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: 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 421 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 34.6s InterpolantComputationTime, 3030 NumberOfCodeBlocks, 3009 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 2983 ConstructedInterpolants, 218 QuantifiedInterpolants, 2690252 SizeOfPredicates, 213 NumberOfNonLiveVariables, 3542 ConjunctsInSsa, 339 ConjunctsInUnsatCore, 47 InterpolantComputations, 16 PerfectInterpolantSequences, 990/1968 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/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_09-07-16-826.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-07-16-826.csv Completed graceful shutdown