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/memsafety/960521-1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:22:08,771 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:22:08,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:22:08,784 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:22:08,785 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:22:08,785 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:22:08,786 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:22:08,787 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:22:08,789 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:22:08,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:22:08,791 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:22:08,791 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:22:08,791 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:22:08,792 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:22:08,793 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:22:08,795 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:22:08,797 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:22:08,798 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:22:08,799 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:22:08,801 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:22:08,802 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:22:08,803 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:22:08,803 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:22:08,804 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:22:08,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:22:08,806 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:22:08,806 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:22:08,806 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:22:08,806 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:22:08,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:22:08,807 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:22:08,807 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-04 12:22:08,816 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:22:08,816 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:22:08,817 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:22:08,817 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:22:08,817 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:22:08,817 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:22:08,817 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:22:08,817 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:22:08,818 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:22:08,818 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:22:08,818 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:22:08,818 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:22:08,818 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:22:08,818 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:22:08,818 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:22:08,818 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:22:08,818 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:22:08,818 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:22:08,819 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:22:08,819 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:22:08,819 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:22:08,819 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:22:08,819 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:22:08,819 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:22:08,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:22:08,854 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:22:08,856 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:22:08,858 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:22:08,858 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:22:08,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i [2018-02-04 12:22:08,994 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:22:08,995 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:22:08,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:22:08,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:22:09,001 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:22:09,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:22:08" (1/1) ... [2018-02-04 12:22:09,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70f5748a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:22:09, skipping insertion in model container [2018-02-04 12:22:09,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:22:08" (1/1) ... [2018-02-04 12:22:09,018 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:22:09,052 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:22:09,144 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:22:09,156 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:22:09,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:22:09 WrapperNode [2018-02-04 12:22:09,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:22:09,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:22:09,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:22:09,161 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:22:09,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:22:09" (1/1) ... [2018-02-04 12:22:09,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:22:09" (1/1) ... [2018-02-04 12:22:09,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:22:09" (1/1) ... [2018-02-04 12:22:09,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:22:09" (1/1) ... [2018-02-04 12:22:09,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:22:09" (1/1) ... [2018-02-04 12:22:09,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:22:09" (1/1) ... [2018-02-04 12:22:09,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:22:09" (1/1) ... [2018-02-04 12:22:09,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:22:09,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:22:09,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:22:09,190 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:22:09,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:22: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-04 12:22:09,224 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:22:09,224 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:22:09,224 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 12:22:09,224 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:22:09,224 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:22:09,224 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:22:09,225 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:22:09,225 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:22:09,225 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:22:09,225 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 12:22:09,225 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 12:22:09,225 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 12:22:09,226 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:22:09,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:22:09,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:22:09,384 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:22:09,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:22:09 BoogieIcfgContainer [2018-02-04 12:22:09,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:22:09,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:22:09,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:22:09,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:22:09,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:22:08" (1/3) ... [2018-02-04 12:22:09,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5331a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:22:09, skipping insertion in model container [2018-02-04 12:22:09,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:22:09" (2/3) ... [2018-02-04 12:22:09,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5331a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:22:09, skipping insertion in model container [2018-02-04 12:22:09,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:22:09" (3/3) ... [2018-02-04 12:22:09,389 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-free.i [2018-02-04 12:22:09,393 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:22:09,397 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 12:22:09,420 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:22:09,420 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:22:09,421 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:22:09,421 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:22:09,421 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:22:09,421 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:22:09,421 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:22:09,421 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:22:09,422 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:22:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-02-04 12:22:09,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 12:22:09,441 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:09,442 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:22:09,442 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:09,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989713, now seen corresponding path program 1 times [2018-02-04 12:22:09,446 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:09,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:09,478 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:09,479 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:09,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:09,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:09,597 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-04 12:22:09,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:22:09,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:22:09,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:22:09,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:22:09,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:22:09,610 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-02-04 12:22:09,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:09,715 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-02-04 12:22:09,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:22:09,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-04 12:22:09,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:09,778 INFO L225 Difference]: With dead ends: 52 [2018-02-04 12:22:09,779 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 12:22:09,780 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-04 12:22:09,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 12:22:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 12:22:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 12:22:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-02-04 12:22:09,808 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 11 [2018-02-04 12:22:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:09,809 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-02-04 12:22:09,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:22:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-02-04 12:22:09,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 12:22:09,809 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:09,809 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:22:09,809 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:09,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989714, now seen corresponding path program 1 times [2018-02-04 12:22:09,810 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:09,810 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:09,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:09,811 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:09,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:09,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:22:09,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:22:09,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:22:09,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:22:09,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:22:09,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:22:09,880 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2018-02-04 12:22:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:09,936 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-02-04 12:22:09,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:22:09,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-04 12:22:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:09,938 INFO L225 Difference]: With dead ends: 48 [2018-02-04 12:22:09,938 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 12:22:09,938 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-04 12:22:09,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 12:22:09,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 12:22:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 12:22:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 12:22:09,943 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-02-04 12:22:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:09,943 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 12:22:09,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:22:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 12:22:09,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:22:09,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:09,944 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:22:09,944 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:09,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525484, now seen corresponding path program 1 times [2018-02-04 12:22:09,944 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:09,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:09,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:09,945 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:09,946 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:09,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:10,010 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-04 12:22:10,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:22:10,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:22:10,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:22:10,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:22:10,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:22:10,012 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2018-02-04 12:22:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:10,082 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-04 12:22:10,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:22:10,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 12:22:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:10,083 INFO L225 Difference]: With dead ends: 45 [2018-02-04 12:22:10,083 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 12:22:10,083 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-04 12:22:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 12:22:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 12:22:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 12:22:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-02-04 12:22:10,087 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 17 [2018-02-04 12:22:10,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:10,087 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-02-04 12:22:10,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:22:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-02-04 12:22:10,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:22:10,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:10,088 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:22:10,088 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:10,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525483, now seen corresponding path program 1 times [2018-02-04 12:22:10,089 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:10,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:10,089 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:10,090 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:10,090 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:10,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:10,191 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-04 12:22:10,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:22:10,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:22:10,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:22:10,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:22:10,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:22:10,191 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 7 states. [2018-02-04 12:22:10,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:10,255 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-04 12:22:10,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:22:10,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-04 12:22:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:10,256 INFO L225 Difference]: With dead ends: 53 [2018-02-04 12:22:10,256 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 12:22:10,256 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-04 12:22:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 12:22:10,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-02-04 12:22:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 12:22:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 12:22:10,259 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2018-02-04 12:22:10,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:10,259 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 12:22:10,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:22:10,259 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 12:22:10,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:22:10,259 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:10,260 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:22:10,260 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:10,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2106816852, now seen corresponding path program 1 times [2018-02-04 12:22:10,260 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:10,260 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:10,261 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:10,261 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:10,261 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:10,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:22:10,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:10,387 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-04 12:22:10,399 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:10,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:10,450 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-04 12:22:10,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:22:10,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:22:10,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 12:22:10,465 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-04 12:22:10,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:22:10,477 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-04 12:22:10,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-02-04 12:22:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:22:10,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:10,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-02-04 12:22:10,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:22:10,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:22:10,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:22:10,573 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 12 states. [2018-02-04 12:22:10,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:10,773 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-04 12:22:10,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:22:10,774 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-02-04 12:22:10,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:10,774 INFO L225 Difference]: With dead ends: 63 [2018-02-04 12:22:10,774 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 12:22:10,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:22:10,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 12:22:10,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-02-04 12:22:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 12:22:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-02-04 12:22:10,779 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 21 [2018-02-04 12:22:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:10,779 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-02-04 12:22:10,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:22:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-02-04 12:22:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:22:10,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:10,780 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:22:10,780 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:10,780 INFO L82 PathProgramCache]: Analyzing trace with hash -702775421, now seen corresponding path program 2 times [2018-02-04 12:22:10,780 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:10,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:10,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:10,781 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:10,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:10,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:22:10,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:10,916 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-04 12:22:10,921 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:22:10,943 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:22:10,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:10,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:10,955 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-04 12:22:10,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:22:10,965 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-04 12:22:10,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:22:10,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:22:10,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-04 12:22:10,990 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:22:10,990 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:22:10,992 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-04 12:22:10,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:22:10,998 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-04 12:22:10,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:22:11,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:22:11,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-02-04 12:22:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:22:11,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:11,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-02-04 12:22:11,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 12:22:11,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 12:22:11,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:22:11,116 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 17 states. [2018-02-04 12:22:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:11,552 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-02-04 12:22:11,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:22:11,553 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-02-04 12:22:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:11,553 INFO L225 Difference]: With dead ends: 73 [2018-02-04 12:22:11,553 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 12:22:11,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2018-02-04 12:22:11,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 12:22:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-02-04 12:22:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 12:22:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-02-04 12:22:11,558 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 25 [2018-02-04 12:22:11,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:11,558 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-02-04 12:22:11,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 12:22:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-02-04 12:22:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 12:22:11,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:11,559 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:22:11,559 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:11,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1827026138, now seen corresponding path program 3 times [2018-02-04 12:22:11,559 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:11,559 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:11,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:11,560 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:22:11,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:11,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:22:11,708 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:11,708 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-04 12:22:11,712 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:22:11,729 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 12:22:11,729 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:11,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:11,733 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-04 12:22:11,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:22:11,737 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-04 12:22:11,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:22:11,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:22:11,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-04 12:22:11,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:22:11,767 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-04 12:22:11,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:22:11,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:22:11,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:22:11,779 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-04 12:22:11,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:22:11,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:22:11,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-04 12:22:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 12:22:11,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:11,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-02-04 12:22:11,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 12:22:11,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 12:22:11,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:22:11,930 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 18 states. [2018-02-04 12:22:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:12,432 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-02-04 12:22:12,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:22:12,433 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-02-04 12:22:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:12,435 INFO L225 Difference]: With dead ends: 90 [2018-02-04 12:22:12,435 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 12:22:12,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:22:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 12:22:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-02-04 12:22:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 12:22:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 12:22:12,438 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 29 [2018-02-04 12:22:12,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:12,438 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 12:22:12,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 12:22:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 12:22:12,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 12:22:12,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:12,439 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:22:12,439 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:12,439 INFO L82 PathProgramCache]: Analyzing trace with hash -645884181, now seen corresponding path program 1 times [2018-02-04 12:22:12,439 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:12,439 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:12,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:12,440 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:22:12,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:12,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:22:12,502 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:12,503 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-04 12:22:12,512 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:12,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:22:12,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:12,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 12:22:12,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 12:22:12,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 12:22:12,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:22:12,617 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 15 states. [2018-02-04 12:22:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:12,706 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-02-04 12:22:12,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:22:12,706 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-02-04 12:22:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:12,707 INFO L225 Difference]: With dead ends: 102 [2018-02-04 12:22:12,707 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 12:22:12,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:22:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 12:22:12,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2018-02-04 12:22:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 12:22:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-02-04 12:22:12,710 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 40 [2018-02-04 12:22:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:12,710 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-02-04 12:22:12,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 12:22:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-02-04 12:22:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 12:22:12,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:12,711 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:22:12,711 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:12,711 INFO L82 PathProgramCache]: Analyzing trace with hash -2113361740, now seen corresponding path program 2 times [2018-02-04 12:22:12,711 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:12,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:12,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:12,712 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:12,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:12,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:22:12,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:12,785 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-04 12:22:12,796 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:22:12,815 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 12:22:12,815 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:12,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:12,820 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-04 12:22:12,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:22:12,826 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-04 12:22:12,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-04 12:22:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 12:22:12,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:22:12,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-02-04 12:22:12,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 12:22:12,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 12:22:12,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:22:12,940 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 15 states. [2018-02-04 12:22:13,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:13,424 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-02-04 12:22:13,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:22:13,424 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-04 12:22:13,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:13,425 INFO L225 Difference]: With dead ends: 102 [2018-02-04 12:22:13,425 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 12:22:13,426 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=828, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 12:22:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 12:22:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2018-02-04 12:22:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 12:22:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-02-04 12:22:13,429 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 44 [2018-02-04 12:22:13,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:13,430 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-02-04 12:22:13,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 12:22:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-02-04 12:22:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:22:13,430 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:13,431 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:22:13,431 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:13,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1590645252, now seen corresponding path program 1 times [2018-02-04 12:22:13,431 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:13,431 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:13,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:13,431 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:22:13,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:13,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-04 12:22:13,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:22:13,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:22:13,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:22:13,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:22:13,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:22:13,470 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 4 states. [2018-02-04 12:22:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:13,486 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-02-04 12:22:13,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:22:13,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-02-04 12:22:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:13,487 INFO L225 Difference]: With dead ends: 83 [2018-02-04 12:22:13,487 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 12:22:13,487 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-04 12:22:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 12:22:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-04 12:22:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 12:22:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-02-04 12:22:13,490 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 48 [2018-02-04 12:22:13,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:13,490 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-02-04 12:22:13,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:22:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-02-04 12:22:13,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 12:22:13,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:13,491 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 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] [2018-02-04 12:22:13,491 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:13,492 INFO L82 PathProgramCache]: Analyzing trace with hash 221692531, now seen corresponding path program 1 times [2018-02-04 12:22:13,492 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:13,492 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:13,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:13,492 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:13,493 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:13,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 12:22:13,593 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:13,593 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-04 12:22:13,600 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:13,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 12:22:13,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:13,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-02-04 12:22:13,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 12:22:13,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 12:22:13,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2018-02-04 12:22:13,719 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 20 states. [2018-02-04 12:22:13,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:13,807 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-02-04 12:22:13,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:22:13,807 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2018-02-04 12:22:13,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:13,807 INFO L225 Difference]: With dead ends: 99 [2018-02-04 12:22:13,807 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 12:22:13,808 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:22:13,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 12:22:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-02-04 12:22:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 12:22:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-02-04 12:22:13,810 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 77 [2018-02-04 12:22:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:13,810 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-02-04 12:22:13,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 12:22:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-02-04 12:22:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 12:22:13,811 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:13,811 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 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-04 12:22:13,811 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:13,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2016762916, now seen corresponding path program 2 times [2018-02-04 12:22:13,811 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:13,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:13,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:13,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:13,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:13,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-04 12:22:13,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:13,894 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-04 12:22:13,901 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:22:13,925 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:22:13,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:13,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-04 12:22:14,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:14,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2018-02-04 12:22:14,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 12:22:14,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 12:22:14,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=296, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:22:14,044 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 22 states. [2018-02-04 12:22:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:14,116 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-02-04 12:22:14,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:22:14,117 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 89 [2018-02-04 12:22:14,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:14,117 INFO L225 Difference]: With dead ends: 107 [2018-02-04 12:22:14,117 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 12:22:14,117 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=187, Invalid=319, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:22:14,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 12:22:14,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-02-04 12:22:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 12:22:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-02-04 12:22:14,120 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 89 [2018-02-04 12:22:14,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:14,120 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-02-04 12:22:14,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 12:22:14,120 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-02-04 12:22:14,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 12:22:14,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:14,121 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 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-04 12:22:14,121 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:14,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1885341628, now seen corresponding path program 3 times [2018-02-04 12:22:14,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:14,121 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:14,121 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:14,121 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:22:14,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:14,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-04 12:22:14,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:14,212 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-04 12:22:14,217 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:22:14,317 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 12:22:14,317 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:14,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:14,435 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 34 proven. 162 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-04 12:22:14,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:14,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2018-02-04 12:22:14,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 12:22:14,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 12:22:14,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:22:14,453 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 28 states. [2018-02-04 12:22:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:14,595 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-02-04 12:22:14,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:22:14,596 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 97 [2018-02-04 12:22:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:14,596 INFO L225 Difference]: With dead ends: 121 [2018-02-04 12:22:14,596 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 12:22:14,597 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=271, Invalid=541, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:22:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 12:22:14,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2018-02-04 12:22:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 12:22:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-02-04 12:22:14,600 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 97 [2018-02-04 12:22:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:14,601 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-02-04 12:22:14,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 12:22:14,601 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-02-04 12:22:14,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 12:22:14,602 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:14,602 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 10, 10, 10, 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-04 12:22:14,602 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:14,602 INFO L82 PathProgramCache]: Analyzing trace with hash -182148109, now seen corresponding path program 4 times [2018-02-04 12:22:14,602 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:14,602 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:14,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:14,607 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:22:14,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:14,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 12:22:14,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:14,732 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-04 12:22:14,737 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:22:14,886 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:22:14,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:14,889 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 12:22:14,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:14,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-02-04 12:22:14,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 12:22:14,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 12:22:14,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=482, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:22:14,984 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 28 states. [2018-02-04 12:22:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:15,088 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2018-02-04 12:22:15,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:22:15,088 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 109 [2018-02-04 12:22:15,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:15,089 INFO L225 Difference]: With dead ends: 131 [2018-02-04 12:22:15,089 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 12:22:15,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=301, Invalid=511, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:22:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 12:22:15,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-02-04 12:22:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 12:22:15,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-02-04 12:22:15,091 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 109 [2018-02-04 12:22:15,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:15,092 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-02-04 12:22:15,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 12:22:15,092 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-02-04 12:22:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-04 12:22:15,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:15,093 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 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-04 12:22:15,093 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:15,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1012012708, now seen corresponding path program 5 times [2018-02-04 12:22:15,093 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:15,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:15,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:15,094 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:22:15,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:15,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 12:22:15,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:15,266 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-04 12:22:15,275 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:22:15,594 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-02-04 12:22:15,594 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:15,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 12:22:15,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:15,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 18 [2018-02-04 12:22:15,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 12:22:15,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 12:22:15,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:22:15,629 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 18 states. [2018-02-04 12:22:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:15,763 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-02-04 12:22:15,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:22:15,764 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2018-02-04 12:22:15,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:15,764 INFO L225 Difference]: With dead ends: 139 [2018-02-04 12:22:15,764 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 12:22:15,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=333, Invalid=597, Unknown=0, NotChecked=0, Total=930 [2018-02-04 12:22:15,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 12:22:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-02-04 12:22:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 12:22:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-02-04 12:22:15,766 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 121 [2018-02-04 12:22:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:15,766 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-02-04 12:22:15,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 12:22:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-02-04 12:22:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 12:22:15,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:15,771 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 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-04 12:22:15,771 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash 70218044, now seen corresponding path program 6 times [2018-02-04 12:22:15,771 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:15,772 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:15,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:15,772 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:22:15,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:15,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-04 12:22:15,940 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:15,964 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-04 12:22:15,968 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 12:22:17,191 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-02-04 12:22:17,191 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:17,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 50 proven. 338 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 12:22:17,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:17,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2018-02-04 12:22:17,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 12:22:17,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 12:22:17,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=841, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 12:22:17,440 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 36 states. [2018-02-04 12:22:17,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:17,579 INFO L93 Difference]: Finished difference Result 153 states and 155 transitions. [2018-02-04 12:22:17,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 12:22:17,580 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 129 [2018-02-04 12:22:17,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:17,580 INFO L225 Difference]: With dead ends: 153 [2018-02-04 12:22:17,580 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 12:22:17,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=453, Invalid=879, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 12:22:17,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 12:22:17,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2018-02-04 12:22:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 12:22:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-02-04 12:22:17,583 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 129 [2018-02-04 12:22:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:17,584 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-02-04 12:22:17,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 12:22:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-02-04 12:22:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-04 12:22:17,585 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:17,585 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 14, 14, 14, 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-04 12:22:17,585 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:17,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1876890995, now seen corresponding path program 7 times [2018-02-04 12:22:17,585 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:17,585 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:17,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:17,586 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:22:17,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:17,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-04 12:22:17,802 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:17,802 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-04 12:22:17,807 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:17,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-04 12:22:18,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:18,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2018-02-04 12:22:18,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 12:22:18,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 12:22:18,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=800, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 12:22:18,010 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 36 states. [2018-02-04 12:22:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:18,130 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2018-02-04 12:22:18,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 12:22:18,130 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 141 [2018-02-04 12:22:18,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:18,131 INFO L225 Difference]: With dead ends: 163 [2018-02-04 12:22:18,131 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 12:22:18,131 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=495, Invalid=837, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 12:22:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 12:22:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-02-04 12:22:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 12:22:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-02-04 12:22:18,133 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 141 [2018-02-04 12:22:18,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:18,133 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-02-04 12:22:18,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 12:22:18,134 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-02-04 12:22:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-04 12:22:18,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:18,134 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 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-04 12:22:18,134 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1883094748, now seen corresponding path program 8 times [2018-02-04 12:22:18,135 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:18,135 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:18,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:18,135 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:18,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:18,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-02-04 12:22:18,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:18,327 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-04 12:22:18,332 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:22:18,365 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:22:18,365 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:18,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-02-04 12:22:18,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:18,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-02-04 12:22:18,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 12:22:18,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 12:22:18,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=892, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 12:22:18,543 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 38 states. [2018-02-04 12:22:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:18,701 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-02-04 12:22:18,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 12:22:18,703 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 153 [2018-02-04 12:22:18,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:18,703 INFO L225 Difference]: With dead ends: 171 [2018-02-04 12:22:18,703 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 12:22:18,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=551, Invalid=931, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 12:22:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 12:22:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2018-02-04 12:22:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-04 12:22:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-02-04 12:22:18,707 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 153 [2018-02-04 12:22:18,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:18,707 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-02-04 12:22:18,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 12:22:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-02-04 12:22:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-02-04 12:22:18,708 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:18,708 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 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-04 12:22:18,708 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:18,708 INFO L82 PathProgramCache]: Analyzing trace with hash 995322556, now seen corresponding path program 9 times [2018-02-04 12:22:18,708 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:18,709 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:18,709 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:18,709 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:22:18,709 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:18,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-02-04 12:22:19,058 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:19,058 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-04 12:22:19,063 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:22:20,681 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-02-04 12:22:20,681 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:20,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-02-04 12:22:20,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:20,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2018-02-04 12:22:21,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 12:22:21,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 12:22:21,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=989, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 12:22:21,107 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 40 states. [2018-02-04 12:22:21,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:21,289 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-02-04 12:22:21,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:22:21,290 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 161 [2018-02-04 12:22:21,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:21,291 INFO L225 Difference]: With dead ends: 179 [2018-02-04 12:22:21,291 INFO L226 Difference]: Without dead ends: 179 [2018-02-04 12:22:21,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=610, Invalid=1030, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 12:22:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-04 12:22:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2018-02-04 12:22:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 12:22:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-02-04 12:22:21,294 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 161 [2018-02-04 12:22:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:21,295 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-02-04 12:22:21,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 12:22:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-02-04 12:22:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 12:22:21,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:21,296 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 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-04 12:22:21,296 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:21,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1259888540, now seen corresponding path program 10 times [2018-02-04 12:22:21,296 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:21,296 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:21,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:21,297 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:22:21,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:21,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-02-04 12:22:21,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:21,536 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-04 12:22:21,540 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:22:21,570 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:22:21,570 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:21,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:21,578 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-04 12:22:21,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:22:21,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:22:21,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-02-04 12:22:22,236 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 18 treesize of output 10 [2018-02-04 12:22:22,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:22:22,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:22:22,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:17 [2018-02-04 12:22:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 595 proven. 701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:22:22,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:22,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 44] total 65 [2018-02-04 12:22:22,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 12:22:22,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 12:22:22,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=890, Invalid=3270, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 12:22:22,356 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 65 states. [2018-02-04 12:22:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:22,997 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2018-02-04 12:22:22,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 12:22:22,997 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 169 [2018-02-04 12:22:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:22,998 INFO L225 Difference]: With dead ends: 187 [2018-02-04 12:22:22,998 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 12:22:22,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2929 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1561, Invalid=6271, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 12:22:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 12:22:23,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-02-04 12:22:23,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 12:22:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-02-04 12:22:23,002 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 169 [2018-02-04 12:22:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:23,002 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-02-04 12:22:23,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 12:22:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-02-04 12:22:23,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 12:22:23,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:23,003 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 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-04 12:22:23,003 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:23,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1232543100, now seen corresponding path program 11 times [2018-02-04 12:22:23,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:23,004 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:23,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:23,004 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:22:23,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:23,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-02-04 12:22:23,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:23,253 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-04 12:22:23,258 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:22:30,743 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2018-02-04 12:22:30,744 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:30,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-02-04 12:22:30,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:30,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 25 [2018-02-04 12:22:30,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 12:22:30,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 12:22:30,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2018-02-04 12:22:30,793 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 25 states. [2018-02-04 12:22:31,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:31,050 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2018-02-04 12:22:31,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 12:22:31,050 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 177 [2018-02-04 12:22:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:31,050 INFO L225 Difference]: With dead ends: 195 [2018-02-04 12:22:31,050 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 12:22:31,051 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=718, Invalid=1262, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 12:22:31,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 12:22:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2018-02-04 12:22:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 12:22:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-02-04 12:22:31,053 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 177 [2018-02-04 12:22:31,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:31,053 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-02-04 12:22:31,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 12:22:31,053 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-02-04 12:22:31,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-04 12:22:31,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:31,054 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 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-04 12:22:31,054 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:31,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1075455068, now seen corresponding path program 12 times [2018-02-04 12:22:31,054 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:31,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:31,055 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:31,055 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:22:31,055 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:31,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-02-04 12:22:31,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:31,452 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-04 12:22:31,457 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 12:22:49,139 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-02-04 12:22:49,139 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:49,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-02-04 12:22:49,352 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:49,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2018-02-04 12:22:49,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 12:22:49,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 12:22:49,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=1310, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 12:22:49,354 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 46 states. [2018-02-04 12:22:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:49,512 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2018-02-04 12:22:49,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 12:22:49,514 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 185 [2018-02-04 12:22:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:49,515 INFO L225 Difference]: With dead ends: 203 [2018-02-04 12:22:49,515 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 12:22:49,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=805, Invalid=1357, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 12:22:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 12:22:49,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2018-02-04 12:22:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 12:22:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-02-04 12:22:49,517 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 185 [2018-02-04 12:22:49,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:49,517 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-02-04 12:22:49,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 12:22:49,517 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-02-04 12:22:49,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-04 12:22:49,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:49,518 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 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-04 12:22:49,518 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:49,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1200884676, now seen corresponding path program 13 times [2018-02-04 12:22:49,518 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:49,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:49,519 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:49,519 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:22:49,519 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:49,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-02-04 12:22:49,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:49,794 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-04 12:22:49,799 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:49,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-02-04 12:22:50,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:50,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-02-04 12:22:50,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 12:22:50,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 12:22:50,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=829, Invalid=1427, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 12:22:50,146 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 48 states. [2018-02-04 12:22:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:50,286 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2018-02-04 12:22:50,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 12:22:50,286 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 193 [2018-02-04 12:22:50,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:50,287 INFO L225 Difference]: With dead ends: 211 [2018-02-04 12:22:50,287 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 12:22:50,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=876, Invalid=1476, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 12:22:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 12:22:50,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2018-02-04 12:22:50,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-04 12:22:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-02-04 12:22:50,290 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 193 [2018-02-04 12:22:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:50,291 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-02-04 12:22:50,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 12:22:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-02-04 12:22:50,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-04 12:22:50,291 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:50,291 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 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-04 12:22:50,291 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:50,291 INFO L82 PathProgramCache]: Analyzing trace with hash -610857700, now seen corresponding path program 14 times [2018-02-04 12:22:50,291 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:50,291 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:50,292 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:50,292 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:50,292 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:50,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-02-04 12:22:50,574 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:50,574 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-04 12:22:50,579 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:22:50,610 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:22:50,610 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:50,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-02-04 12:22:50,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:50,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 50 [2018-02-04 12:22:50,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 12:22:50,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 12:22:50,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=901, Invalid=1549, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 12:22:50,843 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 50 states. [2018-02-04 12:22:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:51,027 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2018-02-04 12:22:51,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 12:22:51,028 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 201 [2018-02-04 12:22:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:51,028 INFO L225 Difference]: With dead ends: 219 [2018-02-04 12:22:51,028 INFO L226 Difference]: Without dead ends: 219 [2018-02-04 12:22:51,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=950, Invalid=1600, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 12:22:51,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-04 12:22:51,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2018-02-04 12:22:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 12:22:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-02-04 12:22:51,031 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 201 [2018-02-04 12:22:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:51,031 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-02-04 12:22:51,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 12:22:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-02-04 12:22:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-02-04 12:22:51,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:51,032 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 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-04 12:22:51,032 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:51,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1836716292, now seen corresponding path program 15 times [2018-02-04 12:22:51,032 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:51,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:51,032 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:51,032 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:22:51,032 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:51,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2018-02-04 12:22:51,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:51,376 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-04 12:22:51,381 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:22:58,355 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-02-04 12:22:58,356 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:58,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2018-02-04 12:22:58,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:22:58,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 29 [2018-02-04 12:22:58,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 12:22:58,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 12:22:58,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:22:58,435 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 29 states. [2018-02-04 12:22:58,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:58,955 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2018-02-04 12:22:58,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 12:22:58,959 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 209 [2018-02-04 12:22:58,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:58,960 INFO L225 Difference]: With dead ends: 227 [2018-02-04 12:22:58,960 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 12:22:58,960 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1004, Invalid=1752, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 12:22:58,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 12:22:58,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2018-02-04 12:22:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 12:22:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-02-04 12:22:58,976 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 209 [2018-02-04 12:22:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:58,976 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-02-04 12:22:58,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 12:22:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-02-04 12:22:58,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-04 12:22:58,977 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:58,978 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 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-04 12:22:58,978 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:22:58,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1511843364, now seen corresponding path program 16 times [2018-02-04 12:22:58,978 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:58,978 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:58,979 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:58,979 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:22:58,979 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:22:58,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:22:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2018-02-04 12:22:59,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:22:59,445 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-04 12:22:59,450 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:22:59,487 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:22:59,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:22:59,491 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:22:59,511 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-04 12:22:59,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:22:59,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:22:59,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-02-04 12:23:00,407 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 18 treesize of output 10 [2018-02-04 12:23:00,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:23:00,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:23:00,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:17 [2018-02-04 12:23:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1081 proven. 1223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:23:00,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:23:00,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 56] total 83 [2018-02-04 12:23:00,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-02-04 12:23:00,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-02-04 12:23:00,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1466, Invalid=5340, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 12:23:00,531 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 83 states. [2018-02-04 12:23:01,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:23:01,247 INFO L93 Difference]: Finished difference Result 235 states and 236 transitions. [2018-02-04 12:23:01,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 12:23:01,269 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 217 [2018-02-04 12:23:01,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:23:01,270 INFO L225 Difference]: With dead ends: 235 [2018-02-04 12:23:01,270 INFO L226 Difference]: Without dead ends: 235 [2018-02-04 12:23:01,271 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4903 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2566, Invalid=10090, Unknown=0, NotChecked=0, Total=12656 [2018-02-04 12:23:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-04 12:23:01,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2018-02-04 12:23:01,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 12:23:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-02-04 12:23:01,275 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 217 [2018-02-04 12:23:01,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:23:01,275 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-02-04 12:23:01,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-02-04 12:23:01,275 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-02-04 12:23:01,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-02-04 12:23:01,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:23:01,276 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 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-04 12:23:01,276 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:23:01,277 INFO L82 PathProgramCache]: Analyzing trace with hash -568783428, now seen corresponding path program 17 times [2018-02-04 12:23:01,277 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:23:01,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:23:01,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:23:01,277 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:23:01,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:23:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:23:01,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:23:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2018-02-04 12:23:01,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:23:01,632 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:23:01,637 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:25:02,986 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2018-02-04 12:25:02,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:25:03,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:25:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2018-02-04 12:25:03,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:25:03,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 31 [2018-02-04 12:25:03,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 12:25:03,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 12:25:03,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=520, Unknown=0, NotChecked=0, Total=930 [2018-02-04 12:25:03,102 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 31 states. [2018-02-04 12:25:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:03,625 INFO L93 Difference]: Finished difference Result 243 states and 244 transitions. [2018-02-04 12:25:03,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 12:25:03,626 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 225 [2018-02-04 12:25:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:03,626 INFO L225 Difference]: With dead ends: 243 [2018-02-04 12:25:03,627 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 12:25:03,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1165, Invalid=2027, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 12:25:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 12:25:03,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2018-02-04 12:25:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 12:25:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-02-04 12:25:03,629 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 225 [2018-02-04 12:25:03,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:03,629 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-02-04 12:25:03,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 12:25:03,629 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-02-04 12:25:03,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-04 12:25:03,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:03,630 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 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-04 12:25:03,630 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:03,630 INFO L82 PathProgramCache]: Analyzing trace with hash 592595612, now seen corresponding path program 18 times [2018-02-04 12:25:03,630 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:03,630 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:03,630 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:03,631 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:25:03,631 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:03,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2018-02-04 12:25:04,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:25:04,047 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:25:04,052 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown