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/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:04:06,826 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:04:06,827 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:04:06,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:04:06,840 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:04:06,840 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:04:06,841 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:04:06,843 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:04:06,844 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:04:06,845 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:04:06,845 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:04:06,846 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:04:06,846 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:04:06,847 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:04:06,848 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:04:06,850 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:04:06,851 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:04:06,853 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:04:06,854 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:04:06,855 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:04:06,857 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:04:06,857 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:04:06,857 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:04:06,858 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:04:06,859 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:04:06,860 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:04:06,860 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:04:06,861 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:04:06,861 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:04:06,861 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:04:06,861 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:04:06,862 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 01:04:06,871 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:04:06,871 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:04:06,872 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:04:06,872 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:04:06,873 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:04:06,873 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:04:06,873 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:04:06,873 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:04:06,873 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:04:06,873 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:04:06,873 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:04:06,873 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:04:06,873 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:04:06,874 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:04:06,874 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:04:06,874 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:04:06,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:04:06,874 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:04:06,874 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:04:06,874 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:04:06,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:04:06,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:04:06,875 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 01:04:06,875 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 01:04:06,875 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 01:04:06,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:04:06,909 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:04:06,912 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:04:06,912 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:04:06,913 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:04:06,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-02-04 01:04:07,037 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:04:07,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:04:07,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:04:07,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:04:07,044 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:04:07,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:04:07" (1/1) ... [2018-02-04 01:04:07,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2121b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07, skipping insertion in model container [2018-02-04 01:04:07,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:04:07" (1/1) ... [2018-02-04 01:04:07,062 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:04:07,092 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:04:07,177 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:04:07,190 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:04:07,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07 WrapperNode [2018-02-04 01:04:07,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:04:07,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:04:07,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:04:07,195 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:04:07,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (1/1) ... [2018-02-04 01:04:07,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (1/1) ... [2018-02-04 01:04:07,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (1/1) ... [2018-02-04 01:04:07,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (1/1) ... [2018-02-04 01:04:07,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (1/1) ... [2018-02-04 01:04:07,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (1/1) ... [2018-02-04 01:04:07,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (1/1) ... [2018-02-04 01:04:07,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:04:07,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:04:07,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:04:07,227 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:04:07,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (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 01:04:07,271 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:04:07,271 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:04:07,272 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:04:07,272 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:04:07,272 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:04:07,272 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 01:04:07,273 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 01:04:07,273 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:04:07,273 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:04:07,273 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:04:07,273 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 01:04:07,273 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 01:04:07,273 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:04:07,273 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 01:04:07,273 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:04:07,273 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:04:07,273 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:04:07,595 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:04:07,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:04:07 BoogieIcfgContainer [2018-02-04 01:04:07,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:04:07,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:04:07,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:04:07,598 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:04:07,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:04:07" (1/3) ... [2018-02-04 01:04:07,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f6e7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:04:07, skipping insertion in model container [2018-02-04 01:04:07,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (2/3) ... [2018-02-04 01:04:07,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f6e7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:04:07, skipping insertion in model container [2018-02-04 01:04:07,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:04:07" (3/3) ... [2018-02-04 01:04:07,601 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-02-04 01:04:07,606 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:04:07,610 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-02-04 01:04:07,634 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:04:07,634 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:04:07,634 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 01:04:07,634 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 01:04:07,634 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:04:07,635 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:04:07,635 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:04:07,635 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:04:07,635 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:04:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-02-04 01:04:07,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 01:04:07,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:07,657 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:07,657 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:07,661 INFO L82 PathProgramCache]: Analyzing trace with hash 805618339, now seen corresponding path program 1 times [2018-02-04 01:04:07,663 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:07,663 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:07,706 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:07,706 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:07,706 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:07,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:07,799 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 01:04:07,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:07,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:04:07,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:04:07,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:04:07,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:04:07,818 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 4 states. [2018-02-04 01:04:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:08,050 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2018-02-04 01:04:08,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:04:08,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 01:04:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:08,060 INFO L225 Difference]: With dead ends: 152 [2018-02-04 01:04:08,060 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 01:04:08,062 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 01:04:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 01:04:08,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2018-02-04 01:04:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 01:04:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-02-04 01:04:08,101 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 8 [2018-02-04 01:04:08,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:08,101 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-02-04 01:04:08,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:04:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-02-04 01:04:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 01:04:08,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:08,102 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:08,102 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:08,102 INFO L82 PathProgramCache]: Analyzing trace with hash 805618340, now seen corresponding path program 1 times [2018-02-04 01:04:08,102 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:08,102 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:08,103 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:08,103 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:08,103 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:08,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:08,154 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 01:04:08,154 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:08,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:04:08,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:04:08,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:04:08,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:04:08,156 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 4 states. [2018-02-04 01:04:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:08,268 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-02-04 01:04:08,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:04:08,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 01:04:08,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:08,270 INFO L225 Difference]: With dead ends: 129 [2018-02-04 01:04:08,270 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 01:04:08,271 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 01:04:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 01:04:08,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2018-02-04 01:04:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 01:04:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-02-04 01:04:08,277 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 8 [2018-02-04 01:04:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:08,278 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-02-04 01:04:08,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:04:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-02-04 01:04:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 01:04:08,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:08,278 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:08,279 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:08,279 INFO L82 PathProgramCache]: Analyzing trace with hash -86961810, now seen corresponding path program 1 times [2018-02-04 01:04:08,279 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:08,279 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:08,280 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:08,280 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:08,280 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:08,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:08,331 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 01:04:08,331 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:08,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:04:08,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:04:08,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:04:08,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:04:08,331 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 4 states. [2018-02-04 01:04:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:08,425 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-02-04 01:04:08,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:04:08,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 01:04:08,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:08,426 INFO L225 Difference]: With dead ends: 103 [2018-02-04 01:04:08,426 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 01:04:08,426 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 01:04:08,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 01:04:08,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2018-02-04 01:04:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 01:04:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-02-04 01:04:08,430 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 15 [2018-02-04 01:04:08,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:08,430 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-02-04 01:04:08,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:04:08,430 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2018-02-04 01:04:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 01:04:08,430 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:08,430 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:08,430 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:08,431 INFO L82 PathProgramCache]: Analyzing trace with hash -86961809, now seen corresponding path program 1 times [2018-02-04 01:04:08,431 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:08,431 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:08,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:08,431 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:08,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:08,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:08,509 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 01:04:08,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:08,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:04:08,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:04:08,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:04:08,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:04:08,511 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 7 states. [2018-02-04 01:04:08,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:08,715 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2018-02-04 01:04:08,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:04:08,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-04 01:04:08,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:08,717 INFO L225 Difference]: With dead ends: 160 [2018-02-04 01:04:08,717 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 01:04:08,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:04:08,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 01:04:08,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2018-02-04 01:04:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 01:04:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2018-02-04 01:04:08,724 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 15 [2018-02-04 01:04:08,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:08,725 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2018-02-04 01:04:08,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:04:08,725 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2018-02-04 01:04:08,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:04:08,725 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:08,725 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:08,725 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:08,726 INFO L82 PathProgramCache]: Analyzing trace with hash -854983682, now seen corresponding path program 1 times [2018-02-04 01:04:08,726 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:08,726 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:08,727 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:08,727 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:08,727 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:08,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:08,771 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 01:04:08,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:08,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:04:08,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:04:08,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:04:08,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:04:08,772 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand 4 states. [2018-02-04 01:04:08,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:08,863 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2018-02-04 01:04:08,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:04:08,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-04 01:04:08,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:08,864 INFO L225 Difference]: With dead ends: 151 [2018-02-04 01:04:08,864 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 01:04:08,864 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 01:04:08,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 01:04:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 135. [2018-02-04 01:04:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 01:04:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2018-02-04 01:04:08,870 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 18 [2018-02-04 01:04:08,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:08,870 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2018-02-04 01:04:08,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:04:08,870 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2018-02-04 01:04:08,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:04:08,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:08,870 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:08,871 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:08,871 INFO L82 PathProgramCache]: Analyzing trace with hash -854983681, now seen corresponding path program 1 times [2018-02-04 01:04:08,871 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:08,871 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:08,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:08,871 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:08,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:08,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:08,924 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 01:04:08,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:08,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:04:08,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:04:08,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:04:08,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:04:08,925 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand 4 states. [2018-02-04 01:04:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:09,007 INFO L93 Difference]: Finished difference Result 152 states and 169 transitions. [2018-02-04 01:04:09,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:04:09,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-04 01:04:09,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:09,008 INFO L225 Difference]: With dead ends: 152 [2018-02-04 01:04:09,009 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 01:04:09,009 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 01:04:09,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 01:04:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 133. [2018-02-04 01:04:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 01:04:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 157 transitions. [2018-02-04 01:04:09,013 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 157 transitions. Word has length 18 [2018-02-04 01:04:09,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:09,014 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 157 transitions. [2018-02-04 01:04:09,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:04:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 157 transitions. [2018-02-04 01:04:09,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:04:09,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:09,015 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:09,015 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:09,015 INFO L82 PathProgramCache]: Analyzing trace with hash -814008083, now seen corresponding path program 1 times [2018-02-04 01:04:09,015 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:09,015 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:09,016 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:09,016 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:09,016 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:09,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:09,048 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 01:04:09,049 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:09,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:04:09,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:04:09,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:04:09,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:04:09,049 INFO L87 Difference]: Start difference. First operand 133 states and 157 transitions. Second operand 6 states. [2018-02-04 01:04:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:09,204 INFO L93 Difference]: Finished difference Result 228 states and 271 transitions. [2018-02-04 01:04:09,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:04:09,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 01:04:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:09,207 INFO L225 Difference]: With dead ends: 228 [2018-02-04 01:04:09,207 INFO L226 Difference]: Without dead ends: 228 [2018-02-04 01:04:09,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:04:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-04 01:04:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 132. [2018-02-04 01:04:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 01:04:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2018-02-04 01:04:09,211 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 18 [2018-02-04 01:04:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:09,212 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2018-02-04 01:04:09,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:04:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2018-02-04 01:04:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:04:09,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:09,212 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:09,212 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:09,212 INFO L82 PathProgramCache]: Analyzing trace with hash -814008082, now seen corresponding path program 1 times [2018-02-04 01:04:09,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:09,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:09,213 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:09,213 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:09,213 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:09,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:09,273 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 01:04:09,273 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:09,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:04:09,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:04:09,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:04:09,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:04:09,274 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand 6 states. [2018-02-04 01:04:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:09,474 INFO L93 Difference]: Finished difference Result 232 states and 278 transitions. [2018-02-04 01:04:09,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:04:09,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 01:04:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:09,475 INFO L225 Difference]: With dead ends: 232 [2018-02-04 01:04:09,475 INFO L226 Difference]: Without dead ends: 232 [2018-02-04 01:04:09,476 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:04:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-04 01:04:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 122. [2018-02-04 01:04:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 01:04:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2018-02-04 01:04:09,478 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 18 [2018-02-04 01:04:09,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:09,479 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2018-02-04 01:04:09,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:04:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2018-02-04 01:04:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:04:09,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:09,479 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:09,479 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:09,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1060549093, now seen corresponding path program 1 times [2018-02-04 01:04:09,479 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:09,480 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:09,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:09,480 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:09,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:09,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:09,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:09,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:04:09,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:04:09,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:04:09,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:04:09,541 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 5 states. [2018-02-04 01:04:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:09,617 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2018-02-04 01:04:09,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:04:09,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 01:04:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:09,618 INFO L225 Difference]: With dead ends: 139 [2018-02-04 01:04:09,618 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 01:04:09,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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 01:04:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 01:04:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2018-02-04 01:04:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 01:04:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2018-02-04 01:04:09,620 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 23 [2018-02-04 01:04:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:09,621 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2018-02-04 01:04:09,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:04:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2018-02-04 01:04:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:04:09,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:09,621 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:09,621 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:09,621 INFO L82 PathProgramCache]: Analyzing trace with hash -212541728, now seen corresponding path program 1 times [2018-02-04 01:04:09,621 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:09,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:09,622 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:09,622 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:09,622 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:09,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:09,675 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 01:04:09,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:09,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:04:09,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:04:09,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:04:09,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:04:09,676 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand 5 states. [2018-02-04 01:04:09,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:09,811 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2018-02-04 01:04:09,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:04:09,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 01:04:09,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:09,813 INFO L225 Difference]: With dead ends: 162 [2018-02-04 01:04:09,813 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 01:04:09,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:04:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 01:04:09,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 108. [2018-02-04 01:04:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 01:04:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2018-02-04 01:04:09,815 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 23 [2018-02-04 01:04:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:09,815 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2018-02-04 01:04:09,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:04:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2018-02-04 01:04:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:04:09,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:09,817 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:09,817 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:09,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1439904849, now seen corresponding path program 1 times [2018-02-04 01:04:09,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:09,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:09,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:09,818 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:09,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:09,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:09,908 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:04:09,909 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 01:04:09,917 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:09,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:04:09,988 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 12 treesize of output 11 [2018-02-04 01:04:09,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:09,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:09,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 01:04:10,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:10,026 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 01:04:10,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-02-04 01:04:10,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 01:04:10,063 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 13 treesize of output 5 [2018-02-04 01:04:10,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:10,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-02-04 01:04:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:10,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:04:10,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-02-04 01:04:10,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:04:10,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:04:10,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:04:10,097 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand 13 states. [2018-02-04 01:04:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:10,428 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2018-02-04 01:04:10,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 01:04:10,428 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-02-04 01:04:10,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:10,429 INFO L225 Difference]: With dead ends: 150 [2018-02-04 01:04:10,429 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 01:04:10,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:04:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 01:04:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 115. [2018-02-04 01:04:10,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 01:04:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-02-04 01:04:10,432 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 28 [2018-02-04 01:04:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:10,432 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-02-04 01:04:10,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:04:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-02-04 01:04:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:04:10,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:10,433 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:10,433 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:10,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1439904850, now seen corresponding path program 1 times [2018-02-04 01:04:10,434 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:10,434 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:10,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:10,435 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:10,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:10,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:10,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:04:10,537 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 01:04:10,544 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:10,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:04:10,570 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 01:04:10,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 01:04:10,629 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 19 treesize of output 14 [2018-02-04 01:04:10,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2018-02-04 01:04:10,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:10,696 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 01:04:10,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:10,714 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 01:04:10,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,722 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:31 [2018-02-04 01:04:10,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 01:04:10,764 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 13 treesize of output 5 [2018-02-04 01:04:10,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-02-04 01:04:10,777 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 9 [2018-02-04 01:04:10,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:10,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:10,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:19 [2018-02-04 01:04:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:10,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:04:10,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2018-02-04 01:04:10,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 01:04:10,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 01:04:10,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-02-04 01:04:10,866 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 17 states. [2018-02-04 01:04:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:11,391 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2018-02-04 01:04:11,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 01:04:11,392 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-02-04 01:04:11,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:11,392 INFO L225 Difference]: With dead ends: 174 [2018-02-04 01:04:11,392 INFO L226 Difference]: Without dead ends: 174 [2018-02-04 01:04:11,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=545, Unknown=0, NotChecked=0, Total=756 [2018-02-04 01:04:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-04 01:04:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 113. [2018-02-04 01:04:11,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 01:04:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-02-04 01:04:11,394 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 28 [2018-02-04 01:04:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:11,395 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-02-04 01:04:11,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 01:04:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-02-04 01:04:11,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 01:04:11,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:11,395 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:11,395 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:11,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1636816270, now seen corresponding path program 1 times [2018-02-04 01:04:11,396 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:11,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:11,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:11,396 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:11,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:11,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:11,462 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 01:04:11,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:11,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 01:04:11,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:04:11,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:04:11,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:04:11,463 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 10 states. [2018-02-04 01:04:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:11,646 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2018-02-04 01:04:11,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:04:11,647 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-02-04 01:04:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:11,647 INFO L225 Difference]: With dead ends: 157 [2018-02-04 01:04:11,647 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 01:04:11,648 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:04:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 01:04:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 118. [2018-02-04 01:04:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 01:04:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2018-02-04 01:04:11,650 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 29 [2018-02-04 01:04:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:11,651 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2018-02-04 01:04:11,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:04:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2018-02-04 01:04:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 01:04:11,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:11,652 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:11,652 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:11,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1636816271, now seen corresponding path program 1 times [2018-02-04 01:04:11,652 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:11,652 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:11,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:11,653 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:11,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:11,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:11,750 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 01:04:11,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:11,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:04:11,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:04:11,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:04:11,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:04:11,751 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 8 states. [2018-02-04 01:04:11,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:11,963 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2018-02-04 01:04:11,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:04:11,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-02-04 01:04:11,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:11,964 INFO L225 Difference]: With dead ends: 179 [2018-02-04 01:04:11,964 INFO L226 Difference]: Without dead ends: 179 [2018-02-04 01:04:11,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:04:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-04 01:04:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 120. [2018-02-04 01:04:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 01:04:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2018-02-04 01:04:11,966 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 29 [2018-02-04 01:04:11,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:11,967 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2018-02-04 01:04:11,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:04:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2018-02-04 01:04:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 01:04:11,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:11,968 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:11,968 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:11,968 INFO L82 PathProgramCache]: Analyzing trace with hash -63950084, now seen corresponding path program 1 times [2018-02-04 01:04:11,968 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:11,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:11,969 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:11,969 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:11,969 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:11,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:12,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:12,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 01:04:12,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:04:12,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:04:12,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:04:12,088 INFO L87 Difference]: Start difference. First operand 120 states and 134 transitions. Second operand 9 states. [2018-02-04 01:04:12,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:12,239 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2018-02-04 01:04:12,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:04:12,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 01:04:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:12,240 INFO L225 Difference]: With dead ends: 195 [2018-02-04 01:04:12,240 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 01:04:12,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:04:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 01:04:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 124. [2018-02-04 01:04:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 01:04:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 138 transitions. [2018-02-04 01:04:12,243 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 138 transitions. Word has length 32 [2018-02-04 01:04:12,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:12,243 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 138 transitions. [2018-02-04 01:04:12,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:04:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 138 transitions. [2018-02-04 01:04:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 01:04:12,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:12,244 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:12,244 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:12,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1431534921, now seen corresponding path program 1 times [2018-02-04 01:04:12,244 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:12,244 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:12,245 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:12,245 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:12,245 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:12,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:12,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:04:12,367 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 01:04:12,372 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:12,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:04:12,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:12,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:12,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 01:04:12,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:12,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:12,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-02-04 01:04:12,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:12,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-04 01:04:12,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:12,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:12,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:12,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-04 01:04:12,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:12,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-02-04 01:04:12,491 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 16 treesize of output 1 [2018-02-04 01:04:12,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:12,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:12,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:12,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:26 [2018-02-04 01:04:12,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-02-04 01:04:12,515 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 12 treesize of output 11 [2018-02-04 01:04:12,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:12,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:12,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:12,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-02-04 01:04:12,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-02-04 01:04:12,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:04:12,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:12,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 10 [2018-02-04 01:04:12,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:12,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:12,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:12,591 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-02-04 01:04:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:12,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:04:12,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-02-04 01:04:12,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 01:04:12,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 01:04:12,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-02-04 01:04:12,653 INFO L87 Difference]: Start difference. First operand 124 states and 138 transitions. Second operand 21 states. [2018-02-04 01:04:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:13,362 INFO L93 Difference]: Finished difference Result 223 states and 246 transitions. [2018-02-04 01:04:13,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 01:04:13,362 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-02-04 01:04:13,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:13,363 INFO L225 Difference]: With dead ends: 223 [2018-02-04 01:04:13,363 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 01:04:13,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=299, Invalid=1107, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 01:04:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 01:04:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 143. [2018-02-04 01:04:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 01:04:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2018-02-04 01:04:13,367 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 32 [2018-02-04 01:04:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:13,367 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2018-02-04 01:04:13,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 01:04:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2018-02-04 01:04:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 01:04:13,368 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:13,368 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:13,368 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:13,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1431534920, now seen corresponding path program 1 times [2018-02-04 01:04:13,368 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:13,368 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:13,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:13,369 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:13,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:13,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:13,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:04:13,507 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 01:04:13,514 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:13,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:04:13,537 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 01:04:13,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:13,546 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:13,546 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 01:04:13,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-02-04 01:04:13,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:13,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-04 01:04:13,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:13,583 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 01:04:13,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,589 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-02-04 01:04:13,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:13,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-02-04 01:04:13,630 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 16 treesize of output 1 [2018-02-04 01:04:13,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-02-04 01:04:13,652 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 20 treesize of output 19 [2018-02-04 01:04:13,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,655 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,659 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:28 [2018-02-04 01:04:13,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-02-04 01:04:13,673 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 12 treesize of output 11 [2018-02-04 01:04:13,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-04 01:04:13,686 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 12 treesize of output 11 [2018-02-04 01:04:13,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:13,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-02-04 01:04:13,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-02-04 01:04:13,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:04:13,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 28 treesize of output 17 [2018-02-04 01:04:13,756 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-02-04 01:04:13,771 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 11 treesize of output 3 [2018-02-04 01:04:13,771 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:04:13,776 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,777 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:13,781 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-02-04 01:04:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:13,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:04:13,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-02-04 01:04:13,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 01:04:13,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 01:04:13,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-04 01:04:13,802 INFO L87 Difference]: Start difference. First operand 143 states and 162 transitions. Second operand 18 states. [2018-02-04 01:04:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:14,551 INFO L93 Difference]: Finished difference Result 220 states and 245 transitions. [2018-02-04 01:04:14,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:04:14,551 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-02-04 01:04:14,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:14,552 INFO L225 Difference]: With dead ends: 220 [2018-02-04 01:04:14,552 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 01:04:14,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2018-02-04 01:04:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 01:04:14,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 151. [2018-02-04 01:04:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 01:04:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 171 transitions. [2018-02-04 01:04:14,554 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 171 transitions. Word has length 32 [2018-02-04 01:04:14,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:14,555 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 171 transitions. [2018-02-04 01:04:14,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 01:04:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 171 transitions. [2018-02-04 01:04:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 01:04:14,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:14,555 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:14,555 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:14,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2033013693, now seen corresponding path program 1 times [2018-02-04 01:04:14,555 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:14,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:14,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:14,556 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:14,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:14,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:14,622 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 01:04:14,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:14,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 01:04:14,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:04:14,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:04:14,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:04:14,623 INFO L87 Difference]: Start difference. First operand 151 states and 171 transitions. Second operand 11 states. [2018-02-04 01:04:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:14,809 INFO L93 Difference]: Finished difference Result 194 states and 214 transitions. [2018-02-04 01:04:14,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:04:14,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-02-04 01:04:14,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:14,810 INFO L225 Difference]: With dead ends: 194 [2018-02-04 01:04:14,810 INFO L226 Difference]: Without dead ends: 194 [2018-02-04 01:04:14,810 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-02-04 01:04:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-04 01:04:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 165. [2018-02-04 01:04:14,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 01:04:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2018-02-04 01:04:14,813 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 33 [2018-02-04 01:04:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:14,813 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2018-02-04 01:04:14,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:04:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2018-02-04 01:04:14,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 01:04:14,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:14,813 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:14,813 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:14,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1037875369, now seen corresponding path program 1 times [2018-02-04 01:04:14,814 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:14,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:14,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:14,814 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:14,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:14,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:14,862 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 01:04:14,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:14,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:04:14,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:04:14,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:04:14,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:04:14,863 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand 8 states. [2018-02-04 01:04:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:15,015 INFO L93 Difference]: Finished difference Result 216 states and 237 transitions. [2018-02-04 01:04:15,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:04:15,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-04 01:04:15,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:15,016 INFO L225 Difference]: With dead ends: 216 [2018-02-04 01:04:15,016 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 01:04:15,016 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:04:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 01:04:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 186. [2018-02-04 01:04:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 01:04:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 215 transitions. [2018-02-04 01:04:15,019 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 215 transitions. Word has length 33 [2018-02-04 01:04:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:15,019 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 215 transitions. [2018-02-04 01:04:15,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:04:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 215 transitions. [2018-02-04 01:04:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 01:04:15,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:15,020 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:15,020 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:15,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1601538529, now seen corresponding path program 2 times [2018-02-04 01:04:15,020 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:15,020 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:15,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:15,021 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:15,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:15,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 01:04:15,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:15,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 01:04:15,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:04:15,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:04:15,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:04:15,135 INFO L87 Difference]: Start difference. First operand 186 states and 215 transitions. Second operand 10 states. [2018-02-04 01:04:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:15,359 INFO L93 Difference]: Finished difference Result 192 states and 210 transitions. [2018-02-04 01:04:15,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:04:15,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-02-04 01:04:15,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:15,360 INFO L225 Difference]: With dead ends: 192 [2018-02-04 01:04:15,360 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 01:04:15,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2018-02-04 01:04:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 01:04:15,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2018-02-04 01:04:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-04 01:04:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 194 transitions. [2018-02-04 01:04:15,363 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 194 transitions. Word has length 33 [2018-02-04 01:04:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:15,363 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 194 transitions. [2018-02-04 01:04:15,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:04:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 194 transitions. [2018-02-04 01:04:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 01:04:15,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:15,364 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:15,364 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:15,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2022615628, now seen corresponding path program 1 times [2018-02-04 01:04:15,364 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:15,364 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:15,365 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:15,365 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 01:04:15,365 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:15,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:15,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:15,518 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:04:15,551 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 01:04:15,556 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:15,571 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:04:15,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:15,594 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 01:04:15,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:15,603 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 01:04:15,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,616 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-02-04 01:04:15,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-02-04 01:04:15,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:15,637 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 22 treesize of output 14 [2018-02-04 01:04:15,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-02-04 01:04:15,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:15,650 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 22 treesize of output 14 [2018-02-04 01:04:15,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2018-02-04 01:04:15,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:15,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:15,660 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 01:04:15,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-02-04 01:04:15,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-04 01:04:15,697 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 16 treesize of output 1 [2018-02-04 01:04:15,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-04 01:04:15,711 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 16 treesize of output 1 [2018-02-04 01:04:15,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,718 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:22 [2018-02-04 01:04:15,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 01:04:15,724 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 01:04:15,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 01:04:15,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, 1 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 01:04:15,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,746 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:38 [2018-02-04 01:04:15,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-02-04 01:04:15,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2018-02-04 01:04:15,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-02-04 01:04:15,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:15,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:15,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-02-04 01:04:15,887 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 9 [2018-02-04 01:04:15,887 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-02-04 01:04:15,893 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,896 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:15,899 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:68, output treesize:7 [2018-02-04 01:04:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:15,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:04:15,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-02-04 01:04:15,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 01:04:15,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 01:04:15,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=318, Unknown=15, NotChecked=0, Total=380 [2018-02-04 01:04:15,951 INFO L87 Difference]: Start difference. First operand 172 states and 194 transitions. Second operand 20 states. [2018-02-04 01:04:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:16,649 INFO L93 Difference]: Finished difference Result 215 states and 233 transitions. [2018-02-04 01:04:16,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 01:04:16,649 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-02-04 01:04:16,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:16,650 INFO L225 Difference]: With dead ends: 215 [2018-02-04 01:04:16,650 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 01:04:16,650 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=1119, Unknown=16, NotChecked=0, Total=1332 [2018-02-04 01:04:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 01:04:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 191. [2018-02-04 01:04:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 01:04:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2018-02-04 01:04:16,653 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 35 [2018-02-04 01:04:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:16,653 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2018-02-04 01:04:16,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 01:04:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2018-02-04 01:04:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 01:04:16,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:16,654 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:16,654 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:16,654 INFO L82 PathProgramCache]: Analyzing trace with hash -258700639, now seen corresponding path program 2 times [2018-02-04 01:04:16,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:16,654 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:16,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:16,656 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:16,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:16,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:16,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:04:16,822 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 01:04:16,829 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 01:04:16,857 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 01:04:16,857 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 01:04:16,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:04:16,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:16,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:16,932 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 01:04:16,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:16,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:16,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-02-04 01:04:16,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:16,967 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 01:04:16,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:16,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:16,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:16,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-04 01:04:16,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:16,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:16,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:16,982 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-02-04 01:04:17,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:17,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2018-02-04 01:04:17,043 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 20 treesize of output 19 [2018-02-04 01:04:17,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:17,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:17,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:17,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-02-04 01:04:17,057 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 16 treesize of output 1 [2018-02-04 01:04:17,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:17,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:17,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:17,064 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:29 [2018-02-04 01:04:17,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-02-04 01:04:17,083 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 16 treesize of output 15 [2018-02-04 01:04:17,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:17,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:17,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-02-04 01:04:17,095 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 16 treesize of output 15 [2018-02-04 01:04:17,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:17,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:17,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:17,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:49 [2018-02-04 01:04:17,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-02-04 01:04:17,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 01:04:17,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:17,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-02-04 01:04:17,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:17,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:17,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-02-04 01:04:17,206 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 25 treesize of output 14 [2018-02-04 01:04:17,206 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:17,211 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 11 treesize of output 7 [2018-02-04 01:04:17,211 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:17,213 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:17,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:17,216 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:76, output treesize:7 [2018-02-04 01:04:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:17,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:04:17,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-02-04 01:04:17,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 01:04:17,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 01:04:17,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=625, Unknown=3, NotChecked=0, Total=702 [2018-02-04 01:04:17,268 INFO L87 Difference]: Start difference. First operand 191 states and 213 transitions. Second operand 27 states. [2018-02-04 01:04:18,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:18,081 INFO L93 Difference]: Finished difference Result 217 states and 233 transitions. [2018-02-04 01:04:18,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:04:18,081 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 38 [2018-02-04 01:04:18,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:18,082 INFO L225 Difference]: With dead ends: 217 [2018-02-04 01:04:18,082 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 01:04:18,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=262, Invalid=1374, Unknown=4, NotChecked=0, Total=1640 [2018-02-04 01:04:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 01:04:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 190. [2018-02-04 01:04:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-04 01:04:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 210 transitions. [2018-02-04 01:04:18,084 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 210 transitions. Word has length 38 [2018-02-04 01:04:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:18,084 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 210 transitions. [2018-02-04 01:04:18,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 01:04:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 210 transitions. [2018-02-04 01:04:18,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 01:04:18,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:18,085 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:18,085 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:18,085 INFO L82 PathProgramCache]: Analyzing trace with hash -535982827, now seen corresponding path program 1 times [2018-02-04 01:04:18,085 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:18,085 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:18,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:18,085 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 01:04:18,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:18,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:04:18,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:18,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:04:18,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:04:18,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:04:18,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:04:18,129 INFO L87 Difference]: Start difference. First operand 190 states and 210 transitions. Second operand 5 states. [2018-02-04 01:04:18,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:18,200 INFO L93 Difference]: Finished difference Result 212 states and 228 transitions. [2018-02-04 01:04:18,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:04:18,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-04 01:04:18,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:18,200 INFO L225 Difference]: With dead ends: 212 [2018-02-04 01:04:18,201 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 01:04:18,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:04:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 01:04:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 179. [2018-02-04 01:04:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-04 01:04:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2018-02-04 01:04:18,203 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 39 [2018-02-04 01:04:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:18,203 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2018-02-04 01:04:18,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:04:18,203 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2018-02-04 01:04:18,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 01:04:18,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:18,204 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:18,204 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:18,204 INFO L82 PathProgramCache]: Analyzing trace with hash 183551078, now seen corresponding path program 1 times [2018-02-04 01:04:18,204 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:18,204 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:18,205 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:18,205 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:18,205 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:18,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:18,289 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:04:18,289 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 01:04:18,297 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:18,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:04:18,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 01:04:18,387 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 11 treesize of output 7 [2018-02-04 01:04:18,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:18,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:18,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 01:04:18,401 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 11 treesize of output 7 [2018-02-04 01:04:18,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:18,402 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:18,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:18,407 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-02-04 01:04:18,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:18,437 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 01:04:18,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:18,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:18,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:18,444 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 01:04:18,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:18,445 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:18,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:18,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-02-04 01:04:18,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 01:04:18,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:18,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 01:04:18,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:04:18,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 01:04:18,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:18,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 01:04:18,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:04:18,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:04:18,507 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:18 [2018-02-04 01:04:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:18,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:04:18,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 21 [2018-02-04 01:04:18,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 01:04:18,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 01:04:18,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-02-04 01:04:18,560 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand 21 states. [2018-02-04 01:04:19,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:19,188 INFO L93 Difference]: Finished difference Result 220 states and 236 transitions. [2018-02-04 01:04:19,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 01:04:19,188 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-02-04 01:04:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:19,189 INFO L225 Difference]: With dead ends: 220 [2018-02-04 01:04:19,189 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 01:04:19,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=1369, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 01:04:19,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 01:04:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 192. [2018-02-04 01:04:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-04 01:04:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2018-02-04 01:04:19,191 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 41 [2018-02-04 01:04:19,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:19,191 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2018-02-04 01:04:19,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 01:04:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2018-02-04 01:04:19,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 01:04:19,191 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:19,192 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:19,192 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:19,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1660911141, now seen corresponding path program 3 times [2018-02-04 01:04:19,192 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:19,192 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:19,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:19,192 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:19,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:19,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:19,325 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:04:19,325 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 01:04:19,333 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 01:04:19,359 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 01:04:19,360 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 01:04:19,362 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:04:19,364 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 01:04:19,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 01:04:19,399 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:19,399 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:19,400 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 01:04:19,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-04 01:04:19,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:19,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-04 01:04:19,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-02-04 01:04:19,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:19,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-02-04 01:04:19,469 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 16 treesize of output 1 [2018-02-04 01:04:19,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:20 [2018-02-04 01:04:19,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:19,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-04 01:04:19,491 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 01:04:19,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2018-02-04 01:04:19,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:19,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:19,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 01:04:19,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-02-04 01:04:19,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 01:04:19,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-02-04 01:04:19,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2018-02-04 01:04:19,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:19,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 73 [2018-02-04 01:04:19,618 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 69 treesize of output 53 [2018-02-04 01:04:19,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 34 [2018-02-04 01:04:19,647 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 01:04:19,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:04:19,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 01:04:19,671 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:63, output treesize:61 [2018-02-04 01:04:19,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-02-04 01:04:19,701 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 12 treesize of output 11 [2018-02-04 01:04:19,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 64 [2018-02-04 01:04:19,729 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 65 treesize of output 64 [2018-02-04 01:04:19,729 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2018-02-04 01:04:19,752 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 01:04:19,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:04:19,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 01:04:19,790 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:101, output treesize:113 [2018-02-04 01:04:19,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-02-04 01:04:19,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:04:19,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 10 [2018-02-04 01:04:19,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2018-02-04 01:04:19,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 30 treesize of output 21 [2018-02-04 01:04:19,900 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,912 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 36 treesize of output 31 [2018-02-04 01:04:19,913 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 22 [2018-02-04 01:04:19,925 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-02-04 01:04:19,935 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,941 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:19,946 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:89, output treesize:5 [2018-02-04 01:04:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:19,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:04:19,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2018-02-04 01:04:19,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 01:04:19,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 01:04:19,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-02-04 01:04:19,987 INFO L87 Difference]: Start difference. First operand 192 states and 208 transitions. Second operand 32 states. [2018-02-04 01:04:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:21,480 INFO L93 Difference]: Finished difference Result 286 states and 309 transitions. [2018-02-04 01:04:21,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 01:04:21,481 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 41 [2018-02-04 01:04:21,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:21,481 INFO L225 Difference]: With dead ends: 286 [2018-02-04 01:04:21,481 INFO L226 Difference]: Without dead ends: 286 [2018-02-04 01:04:21,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=557, Invalid=2982, Unknown=1, NotChecked=0, Total=3540 [2018-02-04 01:04:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-02-04 01:04:21,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 211. [2018-02-04 01:04:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-04 01:04:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 232 transitions. [2018-02-04 01:04:21,484 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 232 transitions. Word has length 41 [2018-02-04 01:04:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:21,484 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 232 transitions. [2018-02-04 01:04:21,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 01:04:21,484 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 232 transitions. [2018-02-04 01:04:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 01:04:21,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:21,484 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:21,485 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:21,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1660911142, now seen corresponding path program 2 times [2018-02-04 01:04:21,485 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:21,485 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:21,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:21,485 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 01:04:21,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:21,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:21,680 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:04:21,680 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 01:04:21,685 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 01:04:21,699 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 01:04:21,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 01:04:21,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:04:21,703 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 01:04:21,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 01:04:21,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:21,742 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:21,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 01:04:21,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-02-04 01:04:21,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:21,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:04:21,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:04:21,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-04 01:04:21,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,788 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-02-04 01:04:21,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:21,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-02-04 01:04:21,856 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 20 treesize of output 19 [2018-02-04 01:04:21,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:21,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-02-04 01:04:21,873 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 16 treesize of output 1 [2018-02-04 01:04:21,873 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2018-02-04 01:04:21,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-02-04 01:04:21,912 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 12 treesize of output 11 [2018-02-04 01:04:21,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-02-04 01:04:21,930 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 01:04:21,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,944 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:66 [2018-02-04 01:04:21,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:21,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:21,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:21,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-02-04 01:04:21,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-02-04 01:04:21,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:21,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:73 [2018-02-04 01:04:22,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-02-04 01:04:22,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-02-04 01:04:22,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-02-04 01:04:22,059 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 18 treesize of output 11 [2018-02-04 01:04:22,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,092 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:67 [2018-02-04 01:04:22,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:22,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:22,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2018-02-04 01:04:22,189 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 16 treesize of output 1 [2018-02-04 01:04:22,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2018-02-04 01:04:22,210 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 24 treesize of output 23 [2018-02-04 01:04:22,210 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:22,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:125, output treesize:79 [2018-02-04 01:04:22,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 90 [2018-02-04 01:04:22,255 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 16 treesize of output 15 [2018-02-04 01:04:22,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-02-04 01:04:22,276 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 16 treesize of output 15 [2018-02-04 01:04:22,276 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:22,288 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:130, output treesize:106 [2018-02-04 01:04:22,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 61 [2018-02-04 01:04:22,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-02-04 01:04:22,382 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:22,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:04:22,390 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-02-04 01:04:22,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:22,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-02-04 01:04:22,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:04:22,412 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,416 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 11 treesize of output 3 [2018-02-04 01:04:22,416 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,417 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:22,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:22,424 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:117, output treesize:18 [2018-02-04 01:04:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:22,506 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:04:22,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2018-02-04 01:04:22,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 01:04:22,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 01:04:22,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 01:04:22,507 INFO L87 Difference]: Start difference. First operand 211 states and 232 transitions. Second operand 35 states. [2018-02-04 01:04:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:24,838 INFO L93 Difference]: Finished difference Result 298 states and 323 transitions. [2018-02-04 01:04:24,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 01:04:24,839 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2018-02-04 01:04:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:24,839 INFO L225 Difference]: With dead ends: 298 [2018-02-04 01:04:24,839 INFO L226 Difference]: Without dead ends: 298 [2018-02-04 01:04:24,840 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=548, Invalid=3357, Unknown=1, NotChecked=0, Total=3906 [2018-02-04 01:04:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-04 01:04:24,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 213. [2018-02-04 01:04:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-04 01:04:24,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 235 transitions. [2018-02-04 01:04:24,844 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 235 transitions. Word has length 41 [2018-02-04 01:04:24,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:24,844 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 235 transitions. [2018-02-04 01:04:24,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 01:04:24,844 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 235 transitions. [2018-02-04 01:04:24,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 01:04:24,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:24,845 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:24,845 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:04:24,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1395114663, now seen corresponding path program 1 times [2018-02-04 01:04:24,845 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:24,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:24,846 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:24,846 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 01:04:24,846 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 01:04:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 01:04:24,880 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 01:04:24,895 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 01:04:24,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:04:24 BoogieIcfgContainer [2018-02-04 01:04:24,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:04:24,909 INFO L168 Benchmark]: Toolchain (without parser) took 17872.05 ms. Allocated memory was 406.8 MB in the beginning and 861.4 MB in the end (delta: 454.6 MB). Free memory was 363.7 MB in the beginning and 758.8 MB in the end (delta: -395.1 MB). Peak memory consumption was 59.5 MB. Max. memory is 5.3 GB. [2018-02-04 01:04:24,910 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 406.8 MB. Free memory is still 369.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:04:24,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.03 ms. Allocated memory is still 406.8 MB. Free memory was 363.7 MB in the beginning and 350.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 01:04:24,911 INFO L168 Benchmark]: Boogie Preprocessor took 32.06 ms. Allocated memory is still 406.8 MB. Free memory is still 350.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:04:24,911 INFO L168 Benchmark]: RCFGBuilder took 368.53 ms. Allocated memory is still 406.8 MB. Free memory was 350.5 MB in the beginning and 317.9 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:04:24,911 INFO L168 Benchmark]: TraceAbstraction took 17312.52 ms. Allocated memory was 406.8 MB in the beginning and 861.4 MB in the end (delta: 454.6 MB). Free memory was 317.9 MB in the beginning and 758.8 MB in the end (delta: -440.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 5.3 GB. [2018-02-04 01:04:24,912 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 406.8 MB. Free memory is still 369.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.03 ms. Allocated memory is still 406.8 MB. Free memory was 363.7 MB in the beginning and 350.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.06 ms. Allocated memory is still 406.8 MB. Free memory is still 350.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 368.53 ms. Allocated memory is still 406.8 MB. Free memory was 350.5 MB in the beginning and 317.9 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 17312.52 ms. Allocated memory was 406.8 MB in the beginning and 861.4 MB in the end (delta: 454.6 MB). Free memory was 317.9 MB in the beginning and 758.8 MB in the end (delta: -440.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L988] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={17:0}] [L988] SLL* head = malloc(sizeof(SLL)); VAL [head={17:0}, malloc(sizeof(SLL))={17:0}] [L989] FCALL head->next = ((void*)0) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}] [L990] FCALL head->data = 0 VAL [head={17:0}, malloc(sizeof(SLL))={17:0}] [L992] SLL* x = head; VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, x={17:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x = head VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, x={17:0}] [L1015] FCALL x->next VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, x={17:0}, x->next={0:0}] [L1015] COND FALSE !(x->next) [L1022] EXPR, FCALL x->next VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, x={17:0}, x->next={0:0}] [L1022] SLL* y = x->next; [L1023] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1023] FCALL x->next = malloc(sizeof(SLL)) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1024] FCALL x->data = 1 VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1025] FCALL x->next = y VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1029] x = head VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1032] EXPR, FCALL x->data VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, x->data=1, y={0:0}] [L1032] COND FALSE !(x->data != 1) [L1038] EXPR, FCALL x->next VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, x->next={0:0}, y={0:0}] [L1038] x = x->next [L1039] COND FALSE !(\read(*x)) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1047] x = head VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1048] COND TRUE x != ((void*)0) [L1050] head = x VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1051] EXPR, FCALL x->next VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, x->next={0:0}, y={0:0}] [L1051] x = x->next [L1052] FCALL free(head) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1048] COND FALSE !(x != ((void*)0)) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1055] return 0; VAL [\result=0, head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 109 locations, 43 error locations. UNSAFE Result, 17.2s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 10.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1824 SDtfs, 7426 SDslu, 8598 SDs, 0 SdLazy, 13568 SolverSat, 1415 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 770 GetRequests, 254 SyntacticMatches, 34 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 1172 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1066 NumberOfCodeBlocks, 1066 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 989 ConstructedInterpolants, 61 QuantifiedInterpolants, 443095 SizeOfPredicates, 129 NumberOfNonLiveVariables, 1421 ConjunctsInSsa, 344 ConjunctsInUnsatCore, 35 InterpolantComputations, 17 PerfectInterpolantSequences, 33/149 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-04-24-917.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-04-24-917.csv Received shutdown request...