java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:03:09,303 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:03:09,305 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:03:09,316 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:03:09,317 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:03:09,317 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:03:09,318 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:03:09,319 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:03:09,321 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:03:09,322 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:03:09,323 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:03:09,323 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:03:09,324 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:03:09,325 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:03:09,325 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:03:09,327 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:03:09,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:03:09,330 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:03:09,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:03:09,333 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:03:09,335 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:03:09,335 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:03:09,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:03:09,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:03:09,337 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:03:09,338 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:03:09,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:03:09,339 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:03:09,339 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:03:09,339 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:03:09,340 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:03:09,340 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 19:03:09,349 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:03:09,350 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:03:09,351 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:03:09,351 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:03:09,351 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:03:09,351 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:03:09,351 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:03:09,351 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:03:09,351 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:03:09,351 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:03:09,352 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:03:09,352 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:03:09,352 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:03:09,352 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:03:09,352 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:03:09,352 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:03:09,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:03:09,352 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:03:09,352 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:03:09,352 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:03:09,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:03:09,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:03:09,353 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 19:03:09,353 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 19:03:09,353 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 19:03:09,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:03:09,390 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:03:09,393 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:03:09,394 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:03:09,395 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:03:09,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-02-02 19:03:09,515 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:03:09,516 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:03:09,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:03:09,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:03:09,522 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:03:09,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:03:09" (1/1) ... [2018-02-02 19:03:09,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c6a4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:03:09, skipping insertion in model container [2018-02-02 19:03:09,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:03:09" (1/1) ... [2018-02-02 19:03:09,536 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:03:09,564 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:03:09,655 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:03:09,669 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:03:09,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:03:09 WrapperNode [2018-02-02 19:03:09,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:03:09,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:03:09,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:03:09,677 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:03:09,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:03:09" (1/1) ... [2018-02-02 19:03:09,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:03:09" (1/1) ... [2018-02-02 19:03:09,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:03:09" (1/1) ... [2018-02-02 19:03:09,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:03:09" (1/1) ... [2018-02-02 19:03:09,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:03:09" (1/1) ... [2018-02-02 19:03:09,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:03:09" (1/1) ... [2018-02-02 19:03:09,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:03:09" (1/1) ... [2018-02-02 19:03:09,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:03:09,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:03:09,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:03:09,702 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:03:09,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:03:09" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:03:09,742 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:03:09,743 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:03:09,743 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 19:03:09,743 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:03:09,743 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 19:03:09,743 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 19:03:09,743 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:03:09,743 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:03:09,744 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:03:09,744 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 19:03:09,744 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 19:03:09,744 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:03:09,744 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 19:03:09,744 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:03:09,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:03:09,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:03:09,927 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:03:09,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:03:09 BoogieIcfgContainer [2018-02-02 19:03:09,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:03:09,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:03:09,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:03:09,931 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:03:09,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:03:09" (1/3) ... [2018-02-02 19:03:09,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1772bf8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:03:09, skipping insertion in model container [2018-02-02 19:03:09,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:03:09" (2/3) ... [2018-02-02 19:03:09,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1772bf8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:03:09, skipping insertion in model container [2018-02-02 19:03:09,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:03:09" (3/3) ... [2018-02-02 19:03:09,933 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-02-02 19:03:09,940 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:03:09,944 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-02 19:03:09,975 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:03:09,975 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:03:09,975 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 19:03:09,975 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 19:03:09,975 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:03:09,975 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:03:09,975 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:03:09,976 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:03:09,976 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:03:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-02-02 19:03:09,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 19:03:09,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:09,998 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:03:09,998 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-02-02 19:03:10,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1159416495, now seen corresponding path program 1 times [2018-02-02 19:03:10,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:10,004 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:10,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:10,048 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:10,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:10,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:10,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:10,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:03:10,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 19:03:10,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 19:03:10,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 19:03:10,146 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-02-02 19:03:10,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:10,160 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-02-02 19:03:10,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 19:03:10,161 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-02-02 19:03:10,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:10,168 INFO L225 Difference]: With dead ends: 59 [2018-02-02 19:03:10,168 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 19:03:10,169 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-02-02 19:03:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 19:03:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 19:03:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 19:03:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-02 19:03:10,246 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 12 [2018-02-02 19:03:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:10,247 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-02 19:03:10,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 19:03:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-02 19:03:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 19:03:10,247 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:10,247 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:03:10,247 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-02-02 19:03:10,248 INFO L82 PathProgramCache]: Analyzing trace with hash 91943959, now seen corresponding path program 1 times [2018-02-02 19:03:10,248 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:10,248 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:10,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:10,249 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:10,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:10,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:10,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:10,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:03:10,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:03:10,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:03:10,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:03:10,314 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 4 states. [2018-02-02 19:03:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:10,415 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-02 19:03:10,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:03:10,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 19:03:10,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:10,417 INFO L225 Difference]: With dead ends: 55 [2018-02-02 19:03:10,417 INFO L226 Difference]: Without dead ends: 55 [2018-02-02 19:03:10,418 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:03:10,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-02 19:03:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-02 19:03:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 19:03:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-02-02 19:03:10,422 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 14 [2018-02-02 19:03:10,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:10,423 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-02-02 19:03:10,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:03:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-02-02 19:03:10,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 19:03:10,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:10,423 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:03:10,423 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-02-02 19:03:10,423 INFO L82 PathProgramCache]: Analyzing trace with hash 91943960, now seen corresponding path program 1 times [2018-02-02 19:03:10,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:10,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:10,424 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:10,424 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:10,424 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:10,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:10,488 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:10,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:03:10,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:03:10,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:03:10,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:03:10,489 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2018-02-02 19:03:10,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:10,586 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-02-02 19:03:10,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:03:10,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 19:03:10,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:10,588 INFO L225 Difference]: With dead ends: 54 [2018-02-02 19:03:10,588 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 19:03:10,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:03:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 19:03:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 19:03:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 19:03:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-02-02 19:03:10,592 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 14 [2018-02-02 19:03:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:10,593 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-02-02 19:03:10,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:03:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-02-02 19:03:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 19:03:10,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:10,594 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] [2018-02-02 19:03:10,594 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-02-02 19:03:10,594 INFO L82 PathProgramCache]: Analyzing trace with hash -255124515, now seen corresponding path program 1 times [2018-02-02 19:03:10,594 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:10,594 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:10,595 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:10,595 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:10,595 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:10,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:10,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:10,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:03:10,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:03:10,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:03:10,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:03:10,666 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2018-02-02 19:03:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:10,734 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-02-02 19:03:10,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:03:10,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-02 19:03:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:10,737 INFO L225 Difference]: With dead ends: 51 [2018-02-02 19:03:10,737 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 19:03:10,738 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:03:10,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 19:03:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 19:03:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 19:03:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-02-02 19:03:10,741 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 20 [2018-02-02 19:03:10,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:10,741 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-02-02 19:03:10,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:03:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-02-02 19:03:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 19:03:10,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:10,741 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] [2018-02-02 19:03:10,741 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-02-02 19:03:10,741 INFO L82 PathProgramCache]: Analyzing trace with hash -255124514, now seen corresponding path program 1 times [2018-02-02 19:03:10,742 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:10,742 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:10,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:10,743 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:10,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:10,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:10,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:10,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:03:10,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:03:10,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:03:10,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:03:10,831 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 7 states. [2018-02-02 19:03:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:10,893 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-02-02 19:03:10,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:03:10,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-02 19:03:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:10,895 INFO L225 Difference]: With dead ends: 61 [2018-02-02 19:03:10,895 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 19:03:10,896 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:03:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 19:03:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-02-02 19:03:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 19:03:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-02 19:03:10,898 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 20 [2018-02-02 19:03:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:10,898 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-02 19:03:10,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:03:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-02 19:03:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 19:03:10,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:10,899 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] [2018-02-02 19:03:10,899 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-02-02 19:03:10,899 INFO L82 PathProgramCache]: Analyzing trace with hash 468265909, now seen corresponding path program 1 times [2018-02-02 19:03:10,899 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:10,899 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:10,899 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:10,899 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:10,900 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:10,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:10,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:10,952 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:03:10,963 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:10,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:11,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:03:11,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-02 19:03:11,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:03:11,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:03:11,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:03:11,056 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 9 states. [2018-02-02 19:03:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:11,186 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-02 19:03:11,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:03:11,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-02 19:03:11,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:11,188 INFO L225 Difference]: With dead ends: 92 [2018-02-02 19:03:11,188 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 19:03:11,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:03:11,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 19:03:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2018-02-02 19:03:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 19:03:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-02-02 19:03:11,193 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-02-02 19:03:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:11,193 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-02-02 19:03:11,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:03:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-02-02 19:03:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 19:03:11,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:11,194 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] [2018-02-02 19:03:11,195 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-02-02 19:03:11,195 INFO L82 PathProgramCache]: Analyzing trace with hash -504403376, now seen corresponding path program 1 times [2018-02-02 19:03:11,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:11,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:11,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:11,196 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:11,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:11,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:11,358 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:11,358 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:03:11,370 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:11,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:11,419 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-02-02 19:03:11,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:11,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:11,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-02 19:03:11,445 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-02-02 19:03:11,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:11,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:03:11,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-02-02 19:03:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:11,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:03:11,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-02-02 19:03:11,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:03:11,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:03:11,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:03:11,593 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 13 states. [2018-02-02 19:03:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:11,945 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-02-02 19:03:11,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:03:11,946 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-02 19:03:11,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:11,947 INFO L225 Difference]: With dead ends: 111 [2018-02-02 19:03:11,947 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 19:03:11,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:03:11,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 19:03:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2018-02-02 19:03:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 19:03:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-02-02 19:03:11,952 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 27 [2018-02-02 19:03:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:11,952 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-02-02 19:03:11,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:03:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-02-02 19:03:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 19:03:11,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:11,953 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:03:11,953 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-02-02 19:03:11,954 INFO L82 PathProgramCache]: Analyzing trace with hash 616992647, now seen corresponding path program 1 times [2018-02-02 19:03:11,954 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:11,954 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:11,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:11,955 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:11,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:11,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 19:03:11,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:11,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:03:11,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:03:11,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:03:11,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:03:11,993 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 4 states. [2018-02-02 19:03:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:12,026 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-02-02 19:03:12,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:03:12,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-02 19:03:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:12,027 INFO L225 Difference]: With dead ends: 77 [2018-02-02 19:03:12,027 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 19:03:12,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:03:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 19:03:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-02 19:03:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 19:03:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-02-02 19:03:12,031 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 29 [2018-02-02 19:03:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:12,032 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-02-02 19:03:12,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:03:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-02-02 19:03:12,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 19:03:12,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:12,032 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:03:12,032 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-02-02 19:03:12,033 INFO L82 PathProgramCache]: Analyzing trace with hash 616992648, now seen corresponding path program 1 times [2018-02-02 19:03:12,033 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:12,033 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:12,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:12,033 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:12,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:12,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 19:03:12,119 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:12,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:03:12,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:03:12,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:03:12,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:03:12,119 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 7 states. [2018-02-02 19:03:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:12,192 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-02-02 19:03:12,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:03:12,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-02 19:03:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:12,193 INFO L225 Difference]: With dead ends: 76 [2018-02-02 19:03:12,193 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 19:03:12,193 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:03:12,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 19:03:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-02 19:03:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 19:03:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-02-02 19:03:12,196 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 29 [2018-02-02 19:03:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:12,197 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-02-02 19:03:12,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:03:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-02-02 19:03:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 19:03:12,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:12,198 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] [2018-02-02 19:03:12,198 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-02-02 19:03:12,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1946902913, now seen corresponding path program 1 times [2018-02-02 19:03:12,198 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:12,198 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:12,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:12,199 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:12,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:12,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 19:03:12,230 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:12,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:03:12,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:03:12,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:03:12,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:03:12,231 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 4 states. [2018-02-02 19:03:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:12,285 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-02-02 19:03:12,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:03:12,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-02 19:03:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:12,286 INFO L225 Difference]: With dead ends: 90 [2018-02-02 19:03:12,286 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 19:03:12,287 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:03:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 19:03:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2018-02-02 19:03:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 19:03:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-02-02 19:03:12,290 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 30 [2018-02-02 19:03:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:12,295 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-02-02 19:03:12,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:03:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-02-02 19:03:12,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 19:03:12,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:12,296 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:03:12,296 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-02-02 19:03:12,297 INFO L82 PathProgramCache]: Analyzing trace with hash 746385703, now seen corresponding path program 2 times [2018-02-02 19:03:12,297 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:12,297 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:12,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:12,298 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:12,298 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:12,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:12,378 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:12,378 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:03:12,387 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:03:12,408 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:03:12,408 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:03:12,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:12,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:03:12,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-02-02 19:03:12,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:03:12,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:03:12,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:03:12,473 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 12 states. [2018-02-02 19:03:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:12,631 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2018-02-02 19:03:12,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:03:12,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-02-02 19:03:12,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:12,631 INFO L225 Difference]: With dead ends: 136 [2018-02-02 19:03:12,632 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 19:03:12,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-02-02 19:03:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 19:03:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 108. [2018-02-02 19:03:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 19:03:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-02-02 19:03:12,636 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 31 [2018-02-02 19:03:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:12,636 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-02-02 19:03:12,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:03:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-02-02 19:03:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 19:03:12,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:12,637 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] [2018-02-02 19:03:12,637 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-02-02 19:03:12,638 INFO L82 PathProgramCache]: Analyzing trace with hash 946337879, now seen corresponding path program 1 times [2018-02-02 19:03:12,638 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:12,638 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:12,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:12,639 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:03:12,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:12,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 19:03:12,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:12,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:03:12,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:03:12,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:03:12,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:03:12,681 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 6 states. [2018-02-02 19:03:12,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:12,707 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-02-02 19:03:12,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:03:12,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-02 19:03:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:12,708 INFO L225 Difference]: With dead ends: 107 [2018-02-02 19:03:12,708 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 19:03:12,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:03:12,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 19:03:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-02-02 19:03:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 19:03:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-02-02 19:03:12,711 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 33 [2018-02-02 19:03:12,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:12,711 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-02-02 19:03:12,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:03:12,711 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-02-02 19:03:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 19:03:12,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:12,711 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] [2018-02-02 19:03:12,711 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-02-02 19:03:12,712 INFO L82 PathProgramCache]: Analyzing trace with hash 946337880, now seen corresponding path program 1 times [2018-02-02 19:03:12,712 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:12,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:12,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:12,712 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:12,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:12,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 19:03:12,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:12,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:03:12,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:03:12,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:03:12,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:03:12,769 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 8 states. [2018-02-02 19:03:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:12,933 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-02-02 19:03:12,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:03:12,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-02 19:03:12,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:12,934 INFO L225 Difference]: With dead ends: 105 [2018-02-02 19:03:12,934 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 19:03:12,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:03:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 19:03:12,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-02-02 19:03:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 19:03:12,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-02-02 19:03:12,938 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 33 [2018-02-02 19:03:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:12,938 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-02-02 19:03:12,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:03:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-02-02 19:03:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 19:03:12,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:12,944 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] [2018-02-02 19:03:12,944 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-02-02 19:03:12,944 INFO L82 PathProgramCache]: Analyzing trace with hash 946329935, now seen corresponding path program 1 times [2018-02-02 19:03:12,944 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:12,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:12,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:12,945 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:12,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:12,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:13,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:13,233 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:03:13,241 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:13,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:13,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 15 [2018-02-02 19:03:13,307 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 15 treesize of output 3 [2018-02-02 19:03:13,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:13,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:13,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:13,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-02 19:03:13,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 19:03:13,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:03:13,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 16 [2018-02-02 19:03:13,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:03:13,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:03:13,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:03:13,352 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 16 states. [2018-02-02 19:03:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:13,655 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-02-02 19:03:13,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:03:13,656 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-02-02 19:03:13,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:13,657 INFO L225 Difference]: With dead ends: 113 [2018-02-02 19:03:13,657 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 19:03:13,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:03:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 19:03:13,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2018-02-02 19:03:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 19:03:13,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-02-02 19:03:13,659 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 33 [2018-02-02 19:03:13,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:13,660 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-02-02 19:03:13,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:03:13,660 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-02-02 19:03:13,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:03:13,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:13,660 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 19:03:13,660 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-02-02 19:03:13,661 INFO L82 PathProgramCache]: Analyzing trace with hash 529142380, now seen corresponding path program 1 times [2018-02-02 19:03:13,661 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:13,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:13,661 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:13,661 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:13,661 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:13,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 19:03:13,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:13,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:03:13,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:03:13,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:03:13,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:03:13,785 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 9 states. [2018-02-02 19:03:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:13,881 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2018-02-02 19:03:13,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:03:13,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-02 19:03:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:13,882 INFO L225 Difference]: With dead ends: 113 [2018-02-02 19:03:13,882 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 19:03:13,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:03:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 19:03:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-02-02 19:03:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 19:03:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-02-02 19:03:13,886 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 34 [2018-02-02 19:03:13,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:13,886 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-02-02 19:03:13,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:03:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-02-02 19:03:13,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:03:13,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:13,887 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:03:13,887 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-02-02 19:03:13,887 INFO L82 PathProgramCache]: Analyzing trace with hash 569056812, now seen corresponding path program 3 times [2018-02-02 19:03:13,887 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:13,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:13,888 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:13,888 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:13,888 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:13,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 19:03:13,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:13,963 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:03:13,972 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 19:03:13,997 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-02 19:03:13,997 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:03:13,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:14,007 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-02-02 19:03:14,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:14,013 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-02-02 19:03:14,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:14,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:14,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-02 19:03:14,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:14,040 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-02-02 19:03:14,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:14,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:14,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:14,052 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-02-02 19:03:14,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:14,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:14,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-02 19:03:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 19:03:14,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:03:14,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-02-02 19:03:14,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:03:14,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:03:14,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:03:14,208 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 14 states. [2018-02-02 19:03:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:14,526 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-02-02 19:03:14,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:03:14,526 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-02 19:03:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:14,527 INFO L225 Difference]: With dead ends: 107 [2018-02-02 19:03:14,527 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 19:03:14,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:03:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 19:03:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-02-02 19:03:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 19:03:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-02-02 19:03:14,531 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 34 [2018-02-02 19:03:14,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:14,531 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-02-02 19:03:14,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:03:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-02-02 19:03:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 19:03:14,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:14,532 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] [2018-02-02 19:03:14,532 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-02-02 19:03:14,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1102363112, now seen corresponding path program 1 times [2018-02-02 19:03:14,532 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:14,533 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:14,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:14,533 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:03:14,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:14,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 19:03:14,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:14,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:03:14,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:03:14,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:03:14,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:03:14,713 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 9 states. [2018-02-02 19:03:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:14,876 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-02-02 19:03:14,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:03:14,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-02 19:03:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:14,877 INFO L225 Difference]: With dead ends: 104 [2018-02-02 19:03:14,877 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 19:03:14,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:03:14,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 19:03:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-02 19:03:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 19:03:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-02-02 19:03:14,880 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 35 [2018-02-02 19:03:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:14,880 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-02-02 19:03:14,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:03:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-02-02 19:03:14,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 19:03:14,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:14,881 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 19:03:14,881 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-02-02 19:03:14,881 INFO L82 PathProgramCache]: Analyzing trace with hash 984721596, now seen corresponding path program 1 times [2018-02-02 19:03:14,881 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:14,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:14,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:14,882 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:14,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:14,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 19:03:14,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:14,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:03:14,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:03:14,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:03:14,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:03:14,954 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 9 states. [2018-02-02 19:03:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:15,015 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-02-02 19:03:15,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:03:15,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-02 19:03:15,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:15,015 INFO L225 Difference]: With dead ends: 77 [2018-02-02 19:03:15,016 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 19:03:15,016 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:03:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 19:03:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-02 19:03:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 19:03:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-02-02 19:03:15,017 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 41 [2018-02-02 19:03:15,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:15,017 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-02-02 19:03:15,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:03:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-02-02 19:03:15,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 19:03:15,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:15,018 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 19:03:15,018 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-02-02 19:03:15,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1657687266, now seen corresponding path program 1 times [2018-02-02 19:03:15,018 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:15,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:15,019 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:15,019 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:15,019 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:15,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 19:03:15,061 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:15,061 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:03:15,067 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:15,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 19:03:15,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:03:15,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-02-02 19:03:15,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:03:15,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:03:15,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:03:15,119 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 11 states. [2018-02-02 19:03:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:15,225 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2018-02-02 19:03:15,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:03:15,226 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 19:03:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:15,226 INFO L225 Difference]: With dead ends: 102 [2018-02-02 19:03:15,226 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 19:03:15,227 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=106, Invalid=134, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:03:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 19:03:15,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2018-02-02 19:03:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 19:03:15,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-02-02 19:03:15,228 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 41 [2018-02-02 19:03:15,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:15,229 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-02-02 19:03:15,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:03:15,229 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-02-02 19:03:15,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 19:03:15,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:15,229 INFO L351 BasicCegarLoop]: trace histogram [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-02-02 19:03:15,229 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-02-02 19:03:15,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1214448692, now seen corresponding path program 1 times [2018-02-02 19:03:15,230 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:15,230 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:15,230 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:15,230 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:15,230 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:15,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:15,648 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:15,648 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:03:15,653 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:15,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:15,694 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-02-02 19:03:15,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:15,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:15,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-02 19:03:15,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:15,742 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:15,742 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-02-02 19:03:15,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:15,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:15,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-02 19:03:15,801 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-02-02 19:03:15,803 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-02-02 19:03:15,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:15,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:15,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:15,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-02 19:03:15,839 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-02-02 19:03:15,840 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-02-02 19:03:15,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:15,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:15,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:15,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-02-02 19:03:16,106 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-02-02 19:03:16,108 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-02-02 19:03:16,112 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-02-02 19:03:16,112 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:16,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:16,126 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-02-02 19:03:16,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:16,128 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-02-02 19:03:16,128 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:16,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:16,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:16,150 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-02-02 19:03:16,150 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:70, output treesize:50 [2018-02-02 19:03:16,234 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-02-02 19:03:16,236 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:03:16,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:16,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:16,237 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:03:16,238 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-02-02 19:03:16,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:16,248 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 52 treesize of output 10 [2018-02-02 19:03:16,248 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:16,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:16,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:16,254 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:88, output treesize:13 [2018-02-02 19:03:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:16,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:03:16,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 34 [2018-02-02 19:03:16,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 19:03:16,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 19:03:16,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1003, Unknown=19, NotChecked=0, Total=1122 [2018-02-02 19:03:16,298 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 34 states. [2018-02-02 19:03:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:17,843 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-02 19:03:17,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 19:03:17,843 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 44 [2018-02-02 19:03:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:17,843 INFO L225 Difference]: With dead ends: 95 [2018-02-02 19:03:17,843 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 19:03:17,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=397, Invalid=2971, Unknown=54, NotChecked=0, Total=3422 [2018-02-02 19:03:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 19:03:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-02-02 19:03:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 19:03:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-02-02 19:03:17,846 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 44 [2018-02-02 19:03:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:17,846 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-02-02 19:03:17,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 19:03:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-02-02 19:03:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 19:03:17,846 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:17,847 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:03:17,847 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-02-02 19:03:17,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1501091225, now seen corresponding path program 2 times [2018-02-02 19:03:17,847 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:17,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:17,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:17,848 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:17,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:17,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 19:03:17,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:17,959 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:03:17,968 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:03:17,984 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:03:17,984 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:03:17,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:18,003 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-02-02 19:03:18,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:18,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:03:18,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-02 19:03:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 19:03:18,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:03:18,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-02-02 19:03:18,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:03:18,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:03:18,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:03:18,109 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 15 states. [2018-02-02 19:03:18,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:18,335 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-02-02 19:03:18,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:03:18,336 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 19:03:18,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:18,336 INFO L225 Difference]: With dead ends: 58 [2018-02-02 19:03:18,336 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 19:03:18,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-02-02 19:03:18,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 19:03:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-02-02 19:03:18,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 19:03:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-02-02 19:03:18,338 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 45 [2018-02-02 19:03:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:18,338 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-02-02 19:03:18,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:03:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-02-02 19:03:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 19:03:18,339 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:18,339 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 19:03:18,339 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-02-02 19:03:18,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693807, now seen corresponding path program 2 times [2018-02-02 19:03:18,339 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:18,340 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:18,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:18,340 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:03:18,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:18,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:19,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:19,029 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:03:19,034 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:03:19,049 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:03:19,049 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:03:19,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:19,055 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-02-02 19:03:19,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-02 19:03:19,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:19,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:19,100 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-02-02 19:03:19,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-02 19:03:19,143 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-02-02 19:03:19,144 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-02-02 19:03:19,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-02 19:03:19,175 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-02-02 19:03:19,176 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-02-02 19:03:19,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-02-02 19:03:19,642 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 50 treesize of output 54 [2018-02-02 19:03:19,644 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-02-02 19:03:19,647 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-02-02 19:03:19,655 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-02-02 19:03:19,656 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,677 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 57 treesize of output 56 [2018-02-02 19:03:19,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:19,680 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 19 treesize of output 25 [2018-02-02 19:03:19,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:19,683 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:19,683 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 21 treesize of output 40 [2018-02-02 19:03:19,684 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,690 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,698 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-02 19:03:19,723 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:89, output treesize:70 [2018-02-02 19:03:19,826 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 109 treesize of output 83 [2018-02-02 19:03:19,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:19,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:19,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:19,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:19,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:19,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:19,834 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:03:19,834 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:03:19,835 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 79 treesize of output 144 [2018-02-02 19:03:19,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,848 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 65 treesize of output 14 [2018-02-02 19:03:19,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:19,853 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:116, output treesize:17 [2018-02-02 19:03:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 25 refuted. 10 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:19,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:03:19,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21] total 42 [2018-02-02 19:03:19,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 19:03:19,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 19:03:19,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1544, Unknown=47, NotChecked=0, Total=1722 [2018-02-02 19:03:19,902 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 42 states. [2018-02-02 19:03:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:22,449 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-02-02 19:03:22,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 19:03:22,450 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 55 [2018-02-02 19:03:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:22,451 INFO L225 Difference]: With dead ends: 125 [2018-02-02 19:03:22,451 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 19:03:22,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1331 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=576, Invalid=5462, Unknown=124, NotChecked=0, Total=6162 [2018-02-02 19:03:22,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 19:03:22,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2018-02-02 19:03:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 19:03:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-02-02 19:03:22,458 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 55 [2018-02-02 19:03:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:22,459 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-02-02 19:03:22,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 19:03:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-02-02 19:03:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 19:03:22,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:22,461 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-02-02 19:03:22,461 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-02-02 19:03:22,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1655485324, now seen corresponding path program 3 times [2018-02-02 19:03:22,461 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:22,461 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:22,462 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:22,462 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:03:22,462 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:22,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 19:03:22,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:22,507 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:03:22,512 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 19:03:22,530 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-02 19:03:22,531 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:03:22,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 19:03:22,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:03:22,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2018-02-02 19:03:22,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:03:22,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:03:22,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:03:22,569 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 14 states. [2018-02-02 19:03:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:22,731 INFO L93 Difference]: Finished difference Result 165 states and 172 transitions. [2018-02-02 19:03:22,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 19:03:22,732 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-02-02 19:03:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:22,732 INFO L225 Difference]: With dead ends: 165 [2018-02-02 19:03:22,732 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 19:03:22,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=202, Invalid=448, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:03:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 19:03:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 115. [2018-02-02 19:03:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 19:03:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-02 19:03:22,736 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 58 [2018-02-02 19:03:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:22,737 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-02 19:03:22,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:03:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-02 19:03:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 19:03:22,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:22,737 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-02-02 19:03:22,738 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-02-02 19:03:22,738 INFO L82 PathProgramCache]: Analyzing trace with hash 189933853, now seen corresponding path program 4 times [2018-02-02 19:03:22,738 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:22,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:22,738 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:22,739 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:03:22,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:22,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 23 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 19:03:22,890 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:22,890 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:03:22,897 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 19:03:22,921 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 19:03:22,921 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:03:22,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 28 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 19:03:23,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:03:23,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-02-02 19:03:23,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:03:23,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:03:23,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:03:23,039 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 19 states. [2018-02-02 19:03:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:23,377 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2018-02-02 19:03:23,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 19:03:23,377 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2018-02-02 19:03:23,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:23,378 INFO L225 Difference]: With dead ends: 131 [2018-02-02 19:03:23,378 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 19:03:23,378 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 19:03:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 19:03:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2018-02-02 19:03:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 19:03:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-02-02 19:03:23,380 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 63 [2018-02-02 19:03:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:23,380 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-02-02 19:03:23,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:03:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-02-02 19:03:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 19:03:23,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:23,381 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 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] [2018-02-02 19:03:23,381 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-02-02 19:03:23,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1456637332, now seen corresponding path program 5 times [2018-02-02 19:03:23,382 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:23,382 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:23,382 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:23,382 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:03:23,382 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:23,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:24,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:24,349 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:03:24,354 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 19:03:24,382 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-02 19:03:24,383 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:03:24,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:24,394 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-02-02 19:03:24,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:24,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:24,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-02 19:03:24,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:24,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:24,444 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-02-02 19:03:24,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:24,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:24,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-02 19:03:24,493 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-02-02 19:03:24,494 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-02-02 19:03:24,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:24,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:24,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:03:24,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-02-02 19:03:24,535 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-02-02 19:03:24,537 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-02-02 19:03:24,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:24,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:24,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:24,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-02-02 19:03:25,343 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 54 treesize of output 58 [2018-02-02 19:03:25,345 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 25 treesize of output 28 [2018-02-02 19:03:25,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,347 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 36 [2018-02-02 19:03:25,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,352 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-02-02 19:03:25,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,360 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-02-02 19:03:25,360 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:25,369 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:25,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:25,382 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:25,396 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 65 treesize of output 64 [2018-02-02 19:03:25,404 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 24 treesize of output 37 [2018-02-02 19:03:25,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 45 [2018-02-02 19:03:25,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,418 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,419 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 64 [2018-02-02 19:03:25,420 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:25,430 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:25,436 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:25,447 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:25,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:25,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 19:03:25,475 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:103, output treesize:88 [2018-02-02 19:03:25,645 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 129 treesize of output 95 [2018-02-02 19:03:25,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2018-02-02 19:03:25,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:25,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,666 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:03:25,667 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:03:25,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:25,668 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 55 treesize of output 91 [2018-02-02 19:03:25,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:25,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:25,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:03:25,682 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:145, output treesize:20 [2018-02-02 19:03:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:25,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:03:25,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 50 [2018-02-02 19:03:25,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 19:03:25,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 19:03:25,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2218, Unknown=44, NotChecked=0, Total=2450 [2018-02-02 19:03:25,749 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 50 states. [2018-02-02 19:03:29,150 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 116 DAG size of output 63 [2018-02-02 19:03:29,625 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 105 DAG size of output 50 [2018-02-02 19:03:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:31,779 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2018-02-02 19:03:31,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-02 19:03:31,779 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-02-02 19:03:31,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:31,779 INFO L225 Difference]: With dead ends: 166 [2018-02-02 19:03:31,779 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 19:03:31,781 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3482 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1367, Invalid=10943, Unknown=122, NotChecked=0, Total=12432 [2018-02-02 19:03:31,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 19:03:31,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2018-02-02 19:03:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 19:03:31,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2018-02-02 19:03:31,784 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 66 [2018-02-02 19:03:31,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:31,784 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2018-02-02 19:03:31,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-02 19:03:31,784 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-02-02 19:03:31,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 19:03:31,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:31,785 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 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] [2018-02-02 19:03:31,785 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-02-02 19:03:31,785 INFO L82 PathProgramCache]: Analyzing trace with hash -590785937, now seen corresponding path program 6 times [2018-02-02 19:03:31,785 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:31,786 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:31,786 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:31,786 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:03:31,786 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:31,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:31,875 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 32 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 19:03:31,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:31,876 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:03:31,881 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 19:03:31,906 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-02-02 19:03:31,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:03:31,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-02 19:03:31,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:03:31,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2018-02-02 19:03:31,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 19:03:32,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 19:03:32,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:03:32,020 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand 17 states. [2018-02-02 19:03:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:32,191 INFO L93 Difference]: Finished difference Result 155 states and 161 transitions. [2018-02-02 19:03:32,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:03:32,192 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2018-02-02 19:03:32,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:32,192 INFO L225 Difference]: With dead ends: 155 [2018-02-02 19:03:32,192 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 19:03:32,193 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2018-02-02 19:03:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 19:03:32,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 75. [2018-02-02 19:03:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 19:03:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-02-02 19:03:32,194 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 69 [2018-02-02 19:03:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:32,194 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-02-02 19:03:32,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 19:03:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-02-02 19:03:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 19:03:32,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:32,195 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2018-02-02 19:03:32,195 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-02-02 19:03:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash 593728948, now seen corresponding path program 7 times [2018-02-02 19:03:32,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:32,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:32,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:32,196 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:03:32,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:32,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 35 proven. 33 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-02 19:03:32,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:32,279 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:03:32,284 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:32,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 50 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-02 19:03:32,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:03:32,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2018-02-02 19:03:32,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:03:32,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:03:32,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:03:32,393 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 19 states. [2018-02-02 19:03:32,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:32,605 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-02-02 19:03:32,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 19:03:32,605 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 74 [2018-02-02 19:03:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:32,605 INFO L225 Difference]: With dead ends: 104 [2018-02-02 19:03:32,606 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 19:03:32,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2018-02-02 19:03:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 19:03:32,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-02 19:03:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 19:03:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-02-02 19:03:32,607 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 74 [2018-02-02 19:03:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:32,607 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-02-02 19:03:32,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:03:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-02-02 19:03:32,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 19:03:32,608 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:32,608 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 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] [2018-02-02 19:03:32,608 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-02-02 19:03:32,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1302767729, now seen corresponding path program 8 times [2018-02-02 19:03:32,608 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:32,608 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:32,608 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:32,609 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:32,609 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:32,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:33,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:33,627 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:03:33,632 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:03:33,648 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:03:33,649 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:03:33,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:33,719 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-02-02 19:03:33,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:33,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:33,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 19:03:33,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:33,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:33,761 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-02-02 19:03:33,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:33,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:33,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-02 19:03:33,807 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-02-02 19:03:33,808 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-02-02 19:03:33,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:33,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:33,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:33,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-02 19:03:33,839 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-02-02 19:03:33,840 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-02-02 19:03:33,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:33,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:33,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:33,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-02-02 19:03:36,271 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 73 DAG size of output 64 [2018-02-02 19:03:36,300 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 80 treesize of output 84 [2018-02-02 19:03:36,303 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-02-02 19:03:36,308 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-02-02 19:03:36,320 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-02-02 19:03:36,332 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-02-02 19:03:36,349 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-02-02 19:03:36,349 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:36,360 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:36,371 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:36,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:36,393 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:36,418 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 95 treesize of output 94 [2018-02-02 19:03:36,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:36,420 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 35 treesize of output 41 [2018-02-02 19:03:36,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:36,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:36,425 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 37 treesize of output 59 [2018-02-02 19:03:36,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:36,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:36,430 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:36,430 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:36,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:36,432 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 89 [2018-02-02 19:03:36,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:36,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:36,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:36,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:36,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:36,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:36,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:36,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 123 [2018-02-02 19:03:36,442 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:36,456 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:36,465 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:36,472 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:36,484 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:36,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:36,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2018-02-02 19:03:36,524 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 11 variables, input treesize:148, output treesize:131 [2018-02-02 19:03:36,957 WARN L143 SmtUtils]: Spent 347ms on a formula simplification that was a NOOP. DAG size: 75 [2018-02-02 19:03:39,069 WARN L143 SmtUtils]: Spent 2013ms on a formula simplification that was a NOOP. DAG size: 80 [2018-02-02 19:03:39,075 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 182 treesize of output 138 [2018-02-02 19:03:39,078 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:39,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:39,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:39,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:39,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:39,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:39,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:39,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:39,086 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:39,087 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:39,087 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:39,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:39,088 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:03:39,089 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:03:39,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 249 [2018-02-02 19:03:39,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:39,126 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 106 treesize of output 14 [2018-02-02 19:03:39,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:39,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:39,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:39,134 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:197, output treesize:10 [2018-02-02 19:03:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 30 proven. 38 refuted. 44 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:39,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:03:39,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 59 [2018-02-02 19:03:39,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-02 19:03:39,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-02 19:03:39,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=2863, Unknown=167, NotChecked=0, Total=3422 [2018-02-02 19:03:39,223 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 59 states. [2018-02-02 19:03:41,886 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 81 DAG size of output 66 [2018-02-02 19:03:42,274 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 83 DAG size of output 70 [2018-02-02 19:03:42,635 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 81 DAG size of output 67 [2018-02-02 19:03:47,089 WARN L146 SmtUtils]: Spent 4041ms on a formula simplification. DAG size of input: 89 DAG size of output 72 [2018-02-02 19:03:49,589 WARN L146 SmtUtils]: Spent 2425ms on a formula simplification. DAG size of input: 95 DAG size of output 74 [2018-02-02 19:03:51,882 WARN L146 SmtUtils]: Spent 2214ms on a formula simplification. DAG size of input: 100 DAG size of output 77 [2018-02-02 19:03:56,138 WARN L146 SmtUtils]: Spent 4033ms on a formula simplification. DAG size of input: 83 DAG size of output 82 [2018-02-02 19:03:56,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:56,140 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2018-02-02 19:03:56,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-02 19:03:56,140 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 77 [2018-02-02 19:03:56,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:56,141 INFO L225 Difference]: With dead ends: 134 [2018-02-02 19:03:56,141 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 19:03:56,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2255 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=980, Invalid=8903, Unknown=419, NotChecked=0, Total=10302 [2018-02-02 19:03:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 19:03:56,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2018-02-02 19:03:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 19:03:56,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-02-02 19:03:56,145 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 77 [2018-02-02 19:03:56,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:56,145 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-02-02 19:03:56,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-02 19:03:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-02-02 19:03:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 19:03:56,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:56,146 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-02-02 19:03:56,146 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-02-02 19:03:56,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1572028070, now seen corresponding path program 9 times [2018-02-02 19:03:56,146 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:56,146 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:56,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:56,147 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:03:56,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:56,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:56,209 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 62 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-02 19:03:56,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:56,209 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:03:56,215 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 19:03:56,261 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-02 19:03:56,262 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:03:56,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 50 proven. 30 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-02 19:03:56,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:03:56,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2018-02-02 19:03:56,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:03:56,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:03:56,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:03:56,323 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 18 states. [2018-02-02 19:03:56,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:56,456 INFO L93 Difference]: Finished difference Result 190 states and 194 transitions. [2018-02-02 19:03:56,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 19:03:56,456 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2018-02-02 19:03:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:56,457 INFO L225 Difference]: With dead ends: 190 [2018-02-02 19:03:56,457 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 19:03:56,457 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-02-02 19:03:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 19:03:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2018-02-02 19:03:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-02 19:03:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-02-02 19:03:56,459 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 81 [2018-02-02 19:03:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:56,459 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-02-02 19:03:56,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:03:56,459 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-02-02 19:03:56,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 19:03:56,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:56,460 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:03:56,460 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-02-02 19:03:56,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1584152469, now seen corresponding path program 10 times [2018-02-02 19:03:56,460 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:56,461 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:56,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:56,461 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:03:56,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:56,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:56,556 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-02 19:03:56,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:56,556 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:03:56,561 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 19:03:56,576 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 19:03:56,577 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:03:56,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 50 proven. 50 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-02-02 19:03:56,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:03:56,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2018-02-02 19:03:56,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 19:03:56,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 19:03:56,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:03:56,643 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 21 states. [2018-02-02 19:03:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:56,765 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-02-02 19:03:56,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:03:56,766 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2018-02-02 19:03:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:56,766 INFO L225 Difference]: With dead ends: 99 [2018-02-02 19:03:56,766 INFO L226 Difference]: Without dead ends: 99 [2018-02-02 19:03:56,767 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:03:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-02 19:03:56,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2018-02-02 19:03:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 19:03:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-02-02 19:03:56,769 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 84 [2018-02-02 19:03:56,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:56,769 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-02-02 19:03:56,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 19:03:56,769 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-02-02 19:03:56,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 19:03:56,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:56,770 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:03:56,770 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-02-02 19:03:56,770 INFO L82 PathProgramCache]: Analyzing trace with hash -559166732, now seen corresponding path program 11 times [2018-02-02 19:03:56,770 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:56,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:56,771 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:56,771 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:03:56,771 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:56,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:57,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:03:57,879 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:03:57,884 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 19:03:57,940 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-02-02 19:03:57,940 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:03:57,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:03:58,047 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-02-02 19:03:58,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:58,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:58,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 19:03:58,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:58,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:03:58,096 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-02-02 19:03:58,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:58,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:58,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-02 19:03:58,145 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-02-02 19:03:58,147 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-02-02 19:03:58,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:58,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:58,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:03:58,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-02 19:03:58,183 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-02-02 19:03:58,184 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-02-02 19:03:58,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:03:58,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:58,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:03:58,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2018-02-02 19:04:00,874 WARN L146 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 73 DAG size of output 62 [2018-02-02 19:04:00,907 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 80 treesize of output 84 [2018-02-02 19:04:00,909 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 37 treesize of output 40 [2018-02-02 19:04:00,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,914 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 40 treesize of output 48 [2018-02-02 19:04:00,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,920 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,921 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,922 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 42 treesize of output 64 [2018-02-02 19:04:00,925 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,927 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,928 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 88 [2018-02-02 19:04:00,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 97 [2018-02-02 19:04:00,954 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:00,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 106 [2018-02-02 19:04:00,983 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,008 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,031 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,052 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,086 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,119 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-02-02 19:04:01,123 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 38 treesize of output 51 [2018-02-02 19:04:01,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 40 treesize of output 59 [2018-02-02 19:04:01,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,147 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 42 treesize of output 75 [2018-02-02 19:04:01,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 105 [2018-02-02 19:04:01,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,170 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 154 [2018-02-02 19:04:01,173 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,190 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,199 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,206 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,213 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,227 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,267 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-02-02 19:04:01,268 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:148, output treesize:139 [2018-02-02 19:04:01,580 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 189 treesize of output 139 [2018-02-02 19:04:01,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,592 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:04:01,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,595 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,595 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,596 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:04:01,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 346 [2018-02-02 19:04:01,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:01,649 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 104 treesize of output 54 [2018-02-02 19:04:01,649 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:01,662 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:212, output treesize:10 [2018-02-02 19:04:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 161 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:04:01,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:04:01,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38] total 70 [2018-02-02 19:04:01,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-02 19:04:01,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-02 19:04:01,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=4469, Unknown=75, NotChecked=0, Total=4830 [2018-02-02 19:04:01,787 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 70 states. [2018-02-02 19:04:08,102 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 97 DAG size of output 67 [2018-02-02 19:04:08,608 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 112 DAG size of output 73 [2018-02-02 19:04:09,791 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 137 DAG size of output 81 [2018-02-02 19:04:10,456 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 119 DAG size of output 75 [2018-02-02 19:04:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:04:13,168 INFO L93 Difference]: Finished difference Result 210 states and 216 transitions. [2018-02-02 19:04:13,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-02-02 19:04:13,169 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 88 [2018-02-02 19:04:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:04:13,169 INFO L225 Difference]: With dead ends: 210 [2018-02-02 19:04:13,169 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 19:04:13,171 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3409 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=1367, Invalid=15389, Unknown=274, NotChecked=0, Total=17030 [2018-02-02 19:04:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 19:04:13,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 159. [2018-02-02 19:04:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 19:04:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 164 transitions. [2018-02-02 19:04:13,173 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 164 transitions. Word has length 88 [2018-02-02 19:04:13,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:04:13,173 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 164 transitions. [2018-02-02 19:04:13,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-02 19:04:13,173 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 164 transitions. [2018-02-02 19:04:13,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 19:04:13,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:04:13,174 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:04:13,174 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 19:04:13,174 INFO L82 PathProgramCache]: Analyzing trace with hash -424693361, now seen corresponding path program 12 times [2018-02-02 19:04:13,174 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:04:13,174 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:04:13,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:04:13,175 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:04:13,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:04:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:04:13,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:04:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 63 proven. 50 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 19:04:13,283 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:04:13,283 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:04:13,292 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 19:04:13,372 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-02 19:04:13,372 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:04:13,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:04:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-02 19:04:13,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:04:13,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 24 [2018-02-02 19:04:13,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 19:04:13,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 19:04:13,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:04:13,462 INFO L87 Difference]: Start difference. First operand 159 states and 164 transitions. Second operand 24 states. [2018-02-02 19:04:13,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:04:13,659 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2018-02-02 19:04:13,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 19:04:13,660 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 91 [2018-02-02 19:04:13,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:04:13,660 INFO L225 Difference]: With dead ends: 185 [2018-02-02 19:04:13,660 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 19:04:13,660 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=314, Invalid=678, Unknown=0, NotChecked=0, Total=992 [2018-02-02 19:04:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 19:04:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 97. [2018-02-02 19:04:13,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 19:04:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-02-02 19:04:13,662 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 91 [2018-02-02 19:04:13,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:04:13,662 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-02-02 19:04:13,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 19:04:13,662 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-02-02 19:04:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 19:04:13,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:04:13,663 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:04:13,663 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 19:04:13,663 INFO L82 PathProgramCache]: Analyzing trace with hash 355526932, now seen corresponding path program 13 times [2018-02-02 19:04:13,663 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:04:13,663 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:04:13,664 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:04:13,664 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:04:13,664 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:04:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:04:13,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:04:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 75 proven. 68 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 19:04:13,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:04:13,875 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:04:13,882 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:04:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:04:13,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:04:13,987 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 98 proven. 45 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 19:04:14,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:04:14,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2018-02-02 19:04:14,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 19:04:14,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 19:04:14,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-02-02 19:04:14,006 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 25 states. [2018-02-02 19:04:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:04:14,268 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-02-02 19:04:14,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 19:04:14,269 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 96 [2018-02-02 19:04:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:04:14,269 INFO L225 Difference]: With dead ends: 134 [2018-02-02 19:04:14,269 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 19:04:14,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=1204, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 19:04:14,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 19:04:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-02-02 19:04:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 19:04:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-02-02 19:04:14,271 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 96 [2018-02-02 19:04:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:04:14,271 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-02-02 19:04:14,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 19:04:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-02-02 19:04:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 19:04:14,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:04:14,271 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:04:14,271 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 19:04:14,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1419901777, now seen corresponding path program 14 times [2018-02-02 19:04:14,271 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:04:14,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:04:14,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:04:14,272 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:04:14,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:04:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:04:14,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:04:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 86 proven. 92 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 19:04:15,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:04:15,272 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:04:15,277 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:04:15,297 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:04:15,297 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:04:15,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:04:15,398 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-02-02 19:04:15,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:04:15,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:15,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 19:04:15,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:15,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:15,438 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-02-02 19:04:15,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:04:15,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:15,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-02 19:04:15,485 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-02-02 19:04:15,486 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-02-02 19:04:15,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:04:15,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:15,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:15,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-02 19:04:15,514 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-02-02 19:04:15,515 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-02-02 19:04:15,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:04:15,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:15,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:15,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-02-02 19:04:20,796 WARN L143 SmtUtils]: Spent 119ms on a formula simplification that was a NOOP. DAG size: 55 [2018-02-02 19:04:22,007 WARN L143 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 62 [2018-02-02 19:04:22,243 WARN L143 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 63 [2018-02-02 19:04:30,455 WARN L143 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 63 [2018-02-02 19:04:30,912 WARN L146 SmtUtils]: Spent 451ms on a formula simplification. DAG size of input: 76 DAG size of output 65 [2018-02-02 19:04:30,943 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 98 treesize of output 102 [2018-02-02 19:04:30,946 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 54 treesize of output 57 [2018-02-02 19:04:30,949 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 57 treesize of output 66 [2018-02-02 19:04:30,955 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 59 treesize of output 68 [2018-02-02 19:04:30,965 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 61 treesize of output 70 [2018-02-02 19:04:30,980 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 72 [2018-02-02 19:04:31,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 74 [2018-02-02 19:04:31,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 85 [2018-02-02 19:04:31,048 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,063 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,078 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,092 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,107 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,136 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,163 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 121 treesize of output 120 [2018-02-02 19:04:31,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,166 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 45 [2018-02-02 19:04:31,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,170 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 41 treesize of output 59 [2018-02-02 19:04:31,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,175 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,176 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 81 [2018-02-02 19:04:31,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 111 [2018-02-02 19:04:31,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,188 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 18 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 149 [2018-02-02 19:04:31,201 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,208 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,209 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,209 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,210 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,211 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,211 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 25 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 204 [2018-02-02 19:04:31,215 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,250 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,271 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,287 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,301 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,313 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,337 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-02-02 19:04:31,389 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 10 variables, input treesize:162, output treesize:147 [2018-02-02 19:04:31,755 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 214 treesize of output 158 [2018-02-02 19:04:31,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 1 [2018-02-02 19:04:31,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,794 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,794 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,799 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:04:31,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,801 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:04:31,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:04:31,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 21 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 219 [2018-02-02 19:04:31,806 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:04:31,839 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:221, output treesize:10 [2018-02-02 19:04:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 155 refuted. 78 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:04:32,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:04:32,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 37] total 65 [2018-02-02 19:04:32,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-02 19:04:32,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-02 19:04:32,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=3445, Unknown=98, NotChecked=0, Total=4160 [2018-02-02 19:04:32,022 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 65 states. [2018-02-02 19:04:36,024 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 78 DAG size of output 66 Received shutdown request... [2018-02-02 19:04:37,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 19:04:37,059 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 19:04:37,062 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 19:04:37,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:04:37 BoogieIcfgContainer [2018-02-02 19:04:37,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:04:37,063 INFO L168 Benchmark]: Toolchain (without parser) took 87547.27 ms. Allocated memory was 402.7 MB in the beginning and 923.3 MB in the end (delta: 520.6 MB). Free memory was 359.5 MB in the beginning and 594.9 MB in the end (delta: -235.4 MB). Peak memory consumption was 285.2 MB. Max. memory is 5.3 GB. [2018-02-02 19:04:37,064 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:04:37,064 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.17 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 348.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-02 19:04:37,064 INFO L168 Benchmark]: Boogie Preprocessor took 24.74 ms. Allocated memory is still 402.7 MB. Free memory was 348.9 MB in the beginning and 347.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:04:37,064 INFO L168 Benchmark]: RCFGBuilder took 226.37 ms. Allocated memory is still 402.7 MB. Free memory was 347.5 MB in the beginning and 326.9 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-02-02 19:04:37,064 INFO L168 Benchmark]: TraceAbstraction took 87134.03 ms. Allocated memory was 402.7 MB in the beginning and 923.3 MB in the end (delta: 520.6 MB). Free memory was 326.9 MB in the beginning and 594.9 MB in the end (delta: -268.1 MB). Peak memory consumption was 252.5 MB. Max. memory is 5.3 GB. [2018-02-02 19:04:37,065 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.17 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 348.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.74 ms. Allocated memory is still 402.7 MB. Free memory was 348.9 MB in the beginning and 347.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 226.37 ms. Allocated memory is still 402.7 MB. Free memory was 347.5 MB in the beginning and 326.9 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 87134.03 ms. Allocated memory was 402.7 MB in the beginning and 923.3 MB in the end (delta: 520.6 MB). Free memory was 326.9 MB in the beginning and 594.9 MB in the end (delta: -268.1 MB). Peak memory consumption was 252.5 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 (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 50 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 48. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 19 error locations. TIMEOUT Result, 87.0s OverallTime, 34 OverallIterations, 8 TraceHistogramMax, 47.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1202 SDtfs, 5360 SDslu, 7777 SDs, 0 SdLazy, 13480 SolverSat, 1969 SolverUnsat, 939 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2185 GetRequests, 1130 SyntacticMatches, 48 SemanticMatches, 1006 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16100 ImplicationChecksByTransitivity, 66.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=31, 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.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 458 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 37.2s InterpolantComputationTime, 2904 NumberOfCodeBlocks, 2879 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 2849 ConstructedInterpolants, 259 QuantifiedInterpolants, 2671638 SizeOfPredicates, 127 NumberOfNonLiveVariables, 4520 ConjunctsInSsa, 461 ConjunctsInUnsatCore, 55 InterpolantComputations, 15 PerfectInterpolantSequences, 1689/3394 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-04-37-070.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-04-37-070.csv Completed graceful shutdown