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-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:34:48,229 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:34:48,230 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:34:48,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:34:48,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:34:48,243 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:34:48,243 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:34:48,245 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:34:48,246 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:34:48,247 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:34:48,248 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:34:48,248 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:34:48,249 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:34:48,250 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:34:48,250 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:34:48,252 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:34:48,253 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:34:48,255 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:34:48,256 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:34:48,257 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:34:48,258 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:34:48,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:34:48,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:34:48,259 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:34:48,260 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:34:48,261 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:34:48,261 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:34:48,261 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:34:48,262 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:34:48,262 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:34:48,262 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:34:48,263 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 14:34:48,272 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:34:48,273 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:34:48,273 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:34:48,274 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:34:48,274 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:34:48,274 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:34:48,274 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:34:48,274 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:34:48,275 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:34:48,275 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:34:48,275 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:34:48,275 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:34:48,275 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:34:48,275 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:34:48,276 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:34:48,276 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:34:48,276 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:34:48,276 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:34:48,276 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:34:48,276 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:34:48,276 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:34:48,277 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 14:34:48,277 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 14:34:48,277 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 14:34:48,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:34:48,311 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:34:48,314 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:34:48,315 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:34:48,315 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:34:48,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i [2018-02-04 14:34:48,465 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:34:48,467 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:34:48,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:34:48,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:34:48,473 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:34:48,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:34:48" (1/1) ... [2018-02-04 14:34:48,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fe6d48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:34:48, skipping insertion in model container [2018-02-04 14:34:48,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:34:48" (1/1) ... [2018-02-04 14:34:48,491 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:34:48,531 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:34:48,619 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:34:48,635 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:34:48,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:34:48 WrapperNode [2018-02-04 14:34:48,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:34:48,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:34:48,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:34:48,641 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:34:48,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:34:48" (1/1) ... [2018-02-04 14:34:48,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:34:48" (1/1) ... [2018-02-04 14:34:48,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:34:48" (1/1) ... [2018-02-04 14:34:48,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:34:48" (1/1) ... [2018-02-04 14:34:48,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:34:48" (1/1) ... [2018-02-04 14:34:48,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:34:48" (1/1) ... [2018-02-04 14:34:48,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:34:48" (1/1) ... [2018-02-04 14:34:48,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:34:48,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:34:48,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:34:48,670 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:34:48,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:34:48" (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 14:34:48,705 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:34:48,705 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:34:48,705 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:34:48,705 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 14:34:48,705 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 14:34:48,705 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:34:48,705 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:34:48,705 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:34:48,706 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 14:34:48,706 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 14:34:48,706 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:34:48,706 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 14:34:48,706 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:34:48,706 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:34:48,706 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:34:49,108 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:34:49,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:34:49 BoogieIcfgContainer [2018-02-04 14:34:49,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:34:49,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:34:49,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:34:49,112 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:34:49,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:34:48" (1/3) ... [2018-02-04 14:34:49,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248cfb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:34:49, skipping insertion in model container [2018-02-04 14:34:49,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:34:48" (2/3) ... [2018-02-04 14:34:49,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248cfb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:34:49, skipping insertion in model container [2018-02-04 14:34:49,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:34:49" (3/3) ... [2018-02-04 14:34:49,114 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-01_true-unreach-call_true-valid-memsafety.i [2018-02-04 14:34:49,119 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:34:49,123 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-02-04 14:34:49,145 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:34:49,145 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:34:49,145 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 14:34:49,145 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 14:34:49,145 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:34:49,146 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:34:49,146 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:34:49,146 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:34:49,146 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:34:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states. [2018-02-04 14:34:49,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 14:34:49,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:49,165 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:49,165 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1781428784, now seen corresponding path program 1 times [2018-02-04 14:34:49,168 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:49,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:49,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:49,197 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:49,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:49,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:49,276 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 14:34:49,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:49,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:34:49,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:34:49,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:34:49,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:34:49,289 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 4 states. [2018-02-04 14:34:49,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:49,534 INFO L93 Difference]: Finished difference Result 210 states and 221 transitions. [2018-02-04 14:34:49,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:34:49,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 14:34:49,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:49,545 INFO L225 Difference]: With dead ends: 210 [2018-02-04 14:34:49,545 INFO L226 Difference]: Without dead ends: 206 [2018-02-04 14:34:49,548 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 14:34:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-04 14:34:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 176. [2018-02-04 14:34:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 14:34:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 188 transitions. [2018-02-04 14:34:49,590 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 188 transitions. Word has length 8 [2018-02-04 14:34:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:49,590 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 188 transitions. [2018-02-04 14:34:49,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:34:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions. [2018-02-04 14:34:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 14:34:49,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:49,592 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:49,593 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:49,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1781428785, now seen corresponding path program 1 times [2018-02-04 14:34:49,593 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:49,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:49,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:49,594 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:49,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:49,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:49,686 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 14:34:49,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:49,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:34:49,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:34:49,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:34:49,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:34:49,688 INFO L87 Difference]: Start difference. First operand 176 states and 188 transitions. Second operand 4 states. [2018-02-04 14:34:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:49,823 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2018-02-04 14:34:49,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:34:49,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 14:34:49,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:49,826 INFO L225 Difference]: With dead ends: 199 [2018-02-04 14:34:49,826 INFO L226 Difference]: Without dead ends: 199 [2018-02-04 14:34:49,827 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 14:34:49,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-04 14:34:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 188. [2018-02-04 14:34:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 14:34:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 207 transitions. [2018-02-04 14:34:49,837 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 207 transitions. Word has length 8 [2018-02-04 14:34:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:49,837 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 207 transitions. [2018-02-04 14:34:49,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:34:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 207 transitions. [2018-02-04 14:34:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 14:34:49,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:49,838 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:49,838 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:49,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1247402511, now seen corresponding path program 1 times [2018-02-04 14:34:49,839 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:49,839 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:49,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:49,840 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:49,840 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:49,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:49,887 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 14:34:49,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:49,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:34:49,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:34:49,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:34:49,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:34:49,888 INFO L87 Difference]: Start difference. First operand 188 states and 207 transitions. Second operand 5 states. [2018-02-04 14:34:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:50,124 INFO L93 Difference]: Finished difference Result 319 states and 346 transitions. [2018-02-04 14:34:50,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:34:50,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 14:34:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:50,126 INFO L225 Difference]: With dead ends: 319 [2018-02-04 14:34:50,126 INFO L226 Difference]: Without dead ends: 319 [2018-02-04 14:34:50,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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 14:34:50,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-04 14:34:50,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 187. [2018-02-04 14:34:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-02-04 14:34:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 206 transitions. [2018-02-04 14:34:50,137 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 206 transitions. Word has length 17 [2018-02-04 14:34:50,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:50,137 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 206 transitions. [2018-02-04 14:34:50,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:34:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 206 transitions. [2018-02-04 14:34:50,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 14:34:50,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:50,138 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:50,138 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:50,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1247402512, now seen corresponding path program 1 times [2018-02-04 14:34:50,139 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:50,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:50,140 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:50,140 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:50,140 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:50,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:50,205 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 14:34:50,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:50,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:34:50,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:34:50,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:34:50,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:34:50,207 INFO L87 Difference]: Start difference. First operand 187 states and 206 transitions. Second operand 5 states. [2018-02-04 14:34:50,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:50,434 INFO L93 Difference]: Finished difference Result 348 states and 385 transitions. [2018-02-04 14:34:50,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:34:50,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 14:34:50,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:50,436 INFO L225 Difference]: With dead ends: 348 [2018-02-04 14:34:50,436 INFO L226 Difference]: Without dead ends: 348 [2018-02-04 14:34:50,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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 14:34:50,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-02-04 14:34:50,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 186. [2018-02-04 14:34:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 14:34:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 205 transitions. [2018-02-04 14:34:50,443 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 205 transitions. Word has length 17 [2018-02-04 14:34:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:50,444 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 205 transitions. [2018-02-04 14:34:50,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:34:50,444 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 205 transitions. [2018-02-04 14:34:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:34:50,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:50,445 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:50,445 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:50,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1311177125, now seen corresponding path program 1 times [2018-02-04 14:34:50,445 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:50,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:50,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:50,446 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:50,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:50,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:50,519 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 14:34:50,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:50,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:34:50,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:34:50,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:34:50,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:34:50,521 INFO L87 Difference]: Start difference. First operand 186 states and 205 transitions. Second operand 8 states. [2018-02-04 14:34:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:50,879 INFO L93 Difference]: Finished difference Result 322 states and 347 transitions. [2018-02-04 14:34:50,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:34:50,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 14:34:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:50,881 INFO L225 Difference]: With dead ends: 322 [2018-02-04 14:34:50,881 INFO L226 Difference]: Without dead ends: 322 [2018-02-04 14:34:50,881 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:34:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-02-04 14:34:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 185. [2018-02-04 14:34:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 14:34:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 204 transitions. [2018-02-04 14:34:50,887 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 204 transitions. Word has length 20 [2018-02-04 14:34:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:50,888 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 204 transitions. [2018-02-04 14:34:50,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:34:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 204 transitions. [2018-02-04 14:34:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:34:50,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:50,889 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:50,889 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:50,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1311177126, now seen corresponding path program 1 times [2018-02-04 14:34:50,889 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:50,889 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:50,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:50,890 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:50,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:50,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:51,003 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 14:34:51,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:51,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:34:51,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:34:51,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:34:51,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:34:51,004 INFO L87 Difference]: Start difference. First operand 185 states and 204 transitions. Second operand 8 states. [2018-02-04 14:34:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:51,575 INFO L93 Difference]: Finished difference Result 324 states and 349 transitions. [2018-02-04 14:34:51,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:34:51,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 14:34:51,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:51,576 INFO L225 Difference]: With dead ends: 324 [2018-02-04 14:34:51,576 INFO L226 Difference]: Without dead ends: 324 [2018-02-04 14:34:51,577 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:34:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-02-04 14:34:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 184. [2018-02-04 14:34:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-04 14:34:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 203 transitions. [2018-02-04 14:34:51,581 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 203 transitions. Word has length 20 [2018-02-04 14:34:51,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:51,582 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 203 transitions. [2018-02-04 14:34:51,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:34:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 203 transitions. [2018-02-04 14:34:51,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 14:34:51,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:51,583 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] [2018-02-04 14:34:51,583 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:51,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1745739826, now seen corresponding path program 1 times [2018-02-04 14:34:51,584 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:51,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:51,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:51,585 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:51,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:51,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:51,627 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 14:34:51,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:51,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:34:51,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:34:51,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:34:51,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:34:51,629 INFO L87 Difference]: Start difference. First operand 184 states and 203 transitions. Second operand 5 states. [2018-02-04 14:34:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:51,708 INFO L93 Difference]: Finished difference Result 272 states and 296 transitions. [2018-02-04 14:34:51,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:34:51,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 14:34:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:51,712 INFO L225 Difference]: With dead ends: 272 [2018-02-04 14:34:51,712 INFO L226 Difference]: Without dead ends: 272 [2018-02-04 14:34:51,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:34:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-04 14:34:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 188. [2018-02-04 14:34:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 14:34:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 207 transitions. [2018-02-04 14:34:51,715 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 207 transitions. Word has length 26 [2018-02-04 14:34:51,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:51,715 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 207 transitions. [2018-02-04 14:34:51,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:34:51,715 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 207 transitions. [2018-02-04 14:34:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 14:34:51,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:51,715 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:51,716 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:51,716 INFO L82 PathProgramCache]: Analyzing trace with hash 33879827, now seen corresponding path program 1 times [2018-02-04 14:34:51,716 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:51,716 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:51,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:51,716 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:51,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:51,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:51,753 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 14:34:51,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:51,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:34:51,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:34:51,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:34:51,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:34:51,754 INFO L87 Difference]: Start difference. First operand 188 states and 207 transitions. Second operand 5 states. [2018-02-04 14:34:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:51,849 INFO L93 Difference]: Finished difference Result 198 states and 210 transitions. [2018-02-04 14:34:51,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:34:51,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 14:34:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:51,850 INFO L225 Difference]: With dead ends: 198 [2018-02-04 14:34:51,850 INFO L226 Difference]: Without dead ends: 198 [2018-02-04 14:34:51,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 3 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 14:34:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-04 14:34:51,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 180. [2018-02-04 14:34:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 14:34:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 199 transitions. [2018-02-04 14:34:51,853 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 199 transitions. Word has length 28 [2018-02-04 14:34:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:51,853 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 199 transitions. [2018-02-04 14:34:51,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:34:51,853 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 199 transitions. [2018-02-04 14:34:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 14:34:51,854 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:51,854 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:51,854 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:51,854 INFO L82 PathProgramCache]: Analyzing trace with hash 33879828, now seen corresponding path program 1 times [2018-02-04 14:34:51,854 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:51,854 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:51,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:51,855 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:51,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:51,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:51,930 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 14:34:51,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:51,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:34:51,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:34:51,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:34:51,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:34:51,931 INFO L87 Difference]: Start difference. First operand 180 states and 199 transitions. Second operand 7 states. [2018-02-04 14:34:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:52,114 INFO L93 Difference]: Finished difference Result 232 states and 247 transitions. [2018-02-04 14:34:52,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:34:52,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-04 14:34:52,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:52,115 INFO L225 Difference]: With dead ends: 232 [2018-02-04 14:34:52,116 INFO L226 Difference]: Without dead ends: 232 [2018-02-04 14:34:52,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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 14:34:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-04 14:34:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 207. [2018-02-04 14:34:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-04 14:34:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 234 transitions. [2018-02-04 14:34:52,118 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 234 transitions. Word has length 28 [2018-02-04 14:34:52,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:52,119 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 234 transitions. [2018-02-04 14:34:52,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:34:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 234 transitions. [2018-02-04 14:34:52,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 14:34:52,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:52,120 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] [2018-02-04 14:34:52,120 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:52,120 INFO L82 PathProgramCache]: Analyzing trace with hash -3315817, now seen corresponding path program 1 times [2018-02-04 14:34:52,120 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:52,120 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:52,121 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:52,121 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:52,121 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:52,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:52,161 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 14:34:52,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:52,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:34:52,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:34:52,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:34:52,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:34:52,162 INFO L87 Difference]: Start difference. First operand 207 states and 234 transitions. Second operand 6 states. [2018-02-04 14:34:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:52,330 INFO L93 Difference]: Finished difference Result 295 states and 335 transitions. [2018-02-04 14:34:52,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:34:52,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 14:34:52,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:52,331 INFO L225 Difference]: With dead ends: 295 [2018-02-04 14:34:52,331 INFO L226 Difference]: Without dead ends: 295 [2018-02-04 14:34:52,332 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 14:34:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-04 14:34:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 206. [2018-02-04 14:34:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 14:34:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 233 transitions. [2018-02-04 14:34:52,336 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 233 transitions. Word has length 31 [2018-02-04 14:34:52,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:52,336 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 233 transitions. [2018-02-04 14:34:52,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:34:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 233 transitions. [2018-02-04 14:34:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 14:34:52,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:52,337 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] [2018-02-04 14:34:52,338 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:52,338 INFO L82 PathProgramCache]: Analyzing trace with hash -3315816, now seen corresponding path program 1 times [2018-02-04 14:34:52,338 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:52,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:52,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:52,339 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:52,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:52,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:52,393 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 14:34:52,394 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:52,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:34:52,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:34:52,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:34:52,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:34:52,395 INFO L87 Difference]: Start difference. First operand 206 states and 233 transitions. Second operand 6 states. [2018-02-04 14:34:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:52,589 INFO L93 Difference]: Finished difference Result 317 states and 365 transitions. [2018-02-04 14:34:52,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:34:52,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 14:34:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:52,591 INFO L225 Difference]: With dead ends: 317 [2018-02-04 14:34:52,591 INFO L226 Difference]: Without dead ends: 317 [2018-02-04 14:34:52,591 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 14:34:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-04 14:34:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 191. [2018-02-04 14:34:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 14:34:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2018-02-04 14:34:52,595 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 31 [2018-02-04 14:34:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:52,596 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2018-02-04 14:34:52,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:34:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2018-02-04 14:34:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 14:34:52,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:52,596 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, 1, 1, 1] [2018-02-04 14:34:52,597 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:52,597 INFO L82 PathProgramCache]: Analyzing trace with hash 253584673, now seen corresponding path program 1 times [2018-02-04 14:34:52,597 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:52,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:52,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:52,598 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:52,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:52,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:52,644 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 14:34:52,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:52,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:34:52,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:34:52,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:34:52,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:34:52,645 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand 5 states. [2018-02-04 14:34:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:52,725 INFO L93 Difference]: Finished difference Result 212 states and 226 transitions. [2018-02-04 14:34:52,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:34:52,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-02-04 14:34:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:52,725 INFO L225 Difference]: With dead ends: 212 [2018-02-04 14:34:52,726 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 14:34:52,726 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 14:34:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 14:34:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 191. [2018-02-04 14:34:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 14:34:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 215 transitions. [2018-02-04 14:34:52,729 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 215 transitions. Word has length 36 [2018-02-04 14:34:52,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:52,729 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 215 transitions. [2018-02-04 14:34:52,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:34:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 215 transitions. [2018-02-04 14:34:52,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 14:34:52,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:52,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:52,730 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:52,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1898871922, now seen corresponding path program 1 times [2018-02-04 14:34:52,731 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:52,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:52,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:52,732 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:52,732 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:52,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:52,879 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 14:34:52,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:52,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 14:34:52,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:34:52,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:34:52,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:34:52,880 INFO L87 Difference]: Start difference. First operand 191 states and 215 transitions. Second operand 10 states. [2018-02-04 14:34:53,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:53,233 INFO L93 Difference]: Finished difference Result 309 states and 336 transitions. [2018-02-04 14:34:53,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 14:34:53,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-04 14:34:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:53,234 INFO L225 Difference]: With dead ends: 309 [2018-02-04 14:34:53,234 INFO L226 Difference]: Without dead ends: 309 [2018-02-04 14:34:53,235 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-02-04 14:34:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-02-04 14:34:53,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 232. [2018-02-04 14:34:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-04 14:34:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 260 transitions. [2018-02-04 14:34:53,237 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 260 transitions. Word has length 42 [2018-02-04 14:34:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:53,238 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 260 transitions. [2018-02-04 14:34:53,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:34:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 260 transitions. [2018-02-04 14:34:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 14:34:53,238 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:53,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:53,238 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:53,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1781092500, now seen corresponding path program 1 times [2018-02-04 14:34:53,239 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:53,239 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:53,239 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:53,239 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:53,239 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:53,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:53,260 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 14:34:53,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:53,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:34:53,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:34:53,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:34:53,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:34:53,261 INFO L87 Difference]: Start difference. First operand 232 states and 260 transitions. Second operand 5 states. [2018-02-04 14:34:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:53,391 INFO L93 Difference]: Finished difference Result 343 states and 386 transitions. [2018-02-04 14:34:53,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:34:53,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-02-04 14:34:53,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:53,393 INFO L225 Difference]: With dead ends: 343 [2018-02-04 14:34:53,393 INFO L226 Difference]: Without dead ends: 343 [2018-02-04 14:34:53,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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 14:34:53,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-04 14:34:53,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 231. [2018-02-04 14:34:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 14:34:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 259 transitions. [2018-02-04 14:34:53,396 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 259 transitions. Word has length 43 [2018-02-04 14:34:53,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:53,396 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 259 transitions. [2018-02-04 14:34:53,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:34:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 259 transitions. [2018-02-04 14:34:53,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 14:34:53,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:53,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:53,397 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:53,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1781092501, now seen corresponding path program 1 times [2018-02-04 14:34:53,398 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:53,398 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:53,398 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:53,399 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:53,399 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:53,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:53,439 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 14:34:53,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:53,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:34:53,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:34:53,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:34:53,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:34:53,440 INFO L87 Difference]: Start difference. First operand 231 states and 259 transitions. Second operand 5 states. [2018-02-04 14:34:53,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:53,585 INFO L93 Difference]: Finished difference Result 375 states and 425 transitions. [2018-02-04 14:34:53,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:34:53,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-02-04 14:34:53,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:53,587 INFO L225 Difference]: With dead ends: 375 [2018-02-04 14:34:53,587 INFO L226 Difference]: Without dead ends: 375 [2018-02-04 14:34:53,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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 14:34:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-02-04 14:34:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 230. [2018-02-04 14:34:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-04 14:34:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 258 transitions. [2018-02-04 14:34:53,591 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 258 transitions. Word has length 43 [2018-02-04 14:34:53,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:53,591 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 258 transitions. [2018-02-04 14:34:53,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:34:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 258 transitions. [2018-02-04 14:34:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 14:34:53,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:53,591 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, 1, 1, 1] [2018-02-04 14:34:53,591 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:53,592 INFO L82 PathProgramCache]: Analyzing trace with hash -661031902, now seen corresponding path program 1 times [2018-02-04 14:34:53,592 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:53,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:53,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:53,592 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:53,593 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:53,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:53,671 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 14:34:53,671 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:34:53,672 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 14:34:53,683 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:53,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:34:53,754 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 14:34:53,756 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 14:34:53,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:34:53,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:34:53,784 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 14:34:53,788 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 14:34:53,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:34:53,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:34:53,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:34:53,795 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-02-04 14:34:53,815 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 21 treesize of output 16 [2018-02-04 14:34:53,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:34:53,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 14:34:53,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:34:53,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:34:53,840 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 21 treesize of output 16 [2018-02-04 14:34:53,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:34:53,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 14:34:53,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:34:53,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:34:53,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:34:53,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-02-04 14:34:53,911 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 14:34:53,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:34:53,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-04 14:34:53,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:34:53,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:34:53,930 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 14:34:53,934 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:34:53,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-04 14:34:53,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:34:53,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:34:53,945 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 14:34:53,946 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-02-04 14:34:53,957 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 14:34:53,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:34:53,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-02-04 14:34:53,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 14:34:53,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 14:34:53,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:34:53,975 INFO L87 Difference]: Start difference. First operand 230 states and 258 transitions. Second operand 11 states. [2018-02-04 14:34:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:54,378 INFO L93 Difference]: Finished difference Result 370 states and 399 transitions. [2018-02-04 14:34:54,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 14:34:54,378 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-02-04 14:34:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:54,379 INFO L225 Difference]: With dead ends: 370 [2018-02-04 14:34:54,380 INFO L226 Difference]: Without dead ends: 370 [2018-02-04 14:34:54,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-02-04 14:34:54,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-02-04 14:34:54,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 274. [2018-02-04 14:34:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-04 14:34:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 311 transitions. [2018-02-04 14:34:54,390 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 311 transitions. Word has length 44 [2018-02-04 14:34:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:54,390 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 311 transitions. [2018-02-04 14:34:54,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 14:34:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 311 transitions. [2018-02-04 14:34:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 14:34:54,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:54,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:54,391 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:54,391 INFO L82 PathProgramCache]: Analyzing trace with hash 500825813, now seen corresponding path program 1 times [2018-02-04 14:34:54,391 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:54,391 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:54,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:54,392 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:54,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:54,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:54,466 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 14:34:54,466 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:54,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:34:54,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:34:54,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:34:54,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:34:54,467 INFO L87 Difference]: Start difference. First operand 274 states and 311 transitions. Second operand 8 states. [2018-02-04 14:34:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:54,740 INFO L93 Difference]: Finished difference Result 291 states and 330 transitions. [2018-02-04 14:34:54,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:34:54,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 14:34:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:54,774 INFO L225 Difference]: With dead ends: 291 [2018-02-04 14:34:54,774 INFO L226 Difference]: Without dead ends: 291 [2018-02-04 14:34:54,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:34:54,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-04 14:34:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 273. [2018-02-04 14:34:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-04 14:34:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 310 transitions. [2018-02-04 14:34:54,780 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 310 transitions. Word has length 46 [2018-02-04 14:34:54,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:54,780 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 310 transitions. [2018-02-04 14:34:54,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:34:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 310 transitions. [2018-02-04 14:34:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 14:34:54,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:54,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:54,781 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:54,781 INFO L82 PathProgramCache]: Analyzing trace with hash 500825814, now seen corresponding path program 1 times [2018-02-04 14:34:54,781 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:54,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:54,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:54,782 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:54,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:54,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:54,871 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 14:34:54,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:54,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:34:54,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:34:54,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:34:54,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:34:54,872 INFO L87 Difference]: Start difference. First operand 273 states and 310 transitions. Second operand 8 states. [2018-02-04 14:34:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:55,113 INFO L93 Difference]: Finished difference Result 290 states and 329 transitions. [2018-02-04 14:34:55,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:34:55,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 14:34:55,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:55,114 INFO L225 Difference]: With dead ends: 290 [2018-02-04 14:34:55,114 INFO L226 Difference]: Without dead ends: 290 [2018-02-04 14:34:55,114 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:34:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-02-04 14:34:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 272. [2018-02-04 14:34:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-04 14:34:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 309 transitions. [2018-02-04 14:34:55,117 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 309 transitions. Word has length 46 [2018-02-04 14:34:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:55,117 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 309 transitions. [2018-02-04 14:34:55,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:34:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 309 transitions. [2018-02-04 14:34:55,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 14:34:55,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:55,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:55,118 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:55,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1624578300, now seen corresponding path program 1 times [2018-02-04 14:34:55,118 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:55,118 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:55,118 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:55,119 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:55,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:55,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:55,213 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 14:34:55,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:55,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 14:34:55,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 14:34:55,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 14:34:55,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:34:55,214 INFO L87 Difference]: Start difference. First operand 272 states and 309 transitions. Second operand 11 states. [2018-02-04 14:34:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:55,618 INFO L93 Difference]: Finished difference Result 522 states and 571 transitions. [2018-02-04 14:34:55,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 14:34:55,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 14:34:55,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:55,620 INFO L225 Difference]: With dead ends: 522 [2018-02-04 14:34:55,620 INFO L226 Difference]: Without dead ends: 522 [2018-02-04 14:34:55,621 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-02-04 14:34:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-02-04 14:34:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 278. [2018-02-04 14:34:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-02-04 14:34:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 314 transitions. [2018-02-04 14:34:55,626 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 314 transitions. Word has length 47 [2018-02-04 14:34:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:55,626 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 314 transitions. [2018-02-04 14:34:55,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 14:34:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 314 transitions. [2018-02-04 14:34:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 14:34:55,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:55,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:55,627 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:55,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1624578299, now seen corresponding path program 1 times [2018-02-04 14:34:55,627 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:55,627 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:55,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:55,628 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:55,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:55,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:55,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 14:34:55,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:55,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 14:34:55,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 14:34:55,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 14:34:55,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:34:55,772 INFO L87 Difference]: Start difference. First operand 278 states and 314 transitions. Second operand 11 states. [2018-02-04 14:34:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:56,262 INFO L93 Difference]: Finished difference Result 575 states and 625 transitions. [2018-02-04 14:34:56,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 14:34:56,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 14:34:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:56,264 INFO L225 Difference]: With dead ends: 575 [2018-02-04 14:34:56,264 INFO L226 Difference]: Without dead ends: 575 [2018-02-04 14:34:56,264 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-02-04 14:34:56,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-02-04 14:34:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 285. [2018-02-04 14:34:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-04 14:34:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 320 transitions. [2018-02-04 14:34:56,269 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 320 transitions. Word has length 47 [2018-02-04 14:34:56,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:56,270 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 320 transitions. [2018-02-04 14:34:56,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 14:34:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 320 transitions. [2018-02-04 14:34:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 14:34:56,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:56,271 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:56,271 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:56,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1211926011, now seen corresponding path program 1 times [2018-02-04 14:34:56,271 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:56,271 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:56,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:56,272 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:56,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:56,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:56,343 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 14:34:56,343 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:56,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:34:56,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:34:56,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:34:56,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:34:56,344 INFO L87 Difference]: Start difference. First operand 285 states and 320 transitions. Second operand 7 states. [2018-02-04 14:34:56,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:56,494 INFO L93 Difference]: Finished difference Result 301 states and 336 transitions. [2018-02-04 14:34:56,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:34:56,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-02-04 14:34:56,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:56,495 INFO L225 Difference]: With dead ends: 301 [2018-02-04 14:34:56,495 INFO L226 Difference]: Without dead ends: 301 [2018-02-04 14:34:56,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:34:56,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-04 14:34:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2018-02-04 14:34:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-04 14:34:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 332 transitions. [2018-02-04 14:34:56,500 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 332 transitions. Word has length 53 [2018-02-04 14:34:56,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:56,500 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 332 transitions. [2018-02-04 14:34:56,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:34:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 332 transitions. [2018-02-04 14:34:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 14:34:56,501 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:56,501 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:56,501 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:56,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1558040000, now seen corresponding path program 1 times [2018-02-04 14:34:56,502 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:56,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:56,502 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:56,503 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:56,503 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:56,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:34:56,588 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:34:56,588 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 14:34:56,595 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:56,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:34:56,632 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 13 treesize of output 10 [2018-02-04 14:34:56,634 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 10 treesize of output 9 [2018-02-04 14:34:56,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:34:56,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:34:56,642 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 13 treesize of output 10 [2018-02-04 14:34:56,643 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 10 treesize of output 9 [2018-02-04 14:34:56,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:34:56,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:34:56,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:34:56,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-02-04 14:34:56,804 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 14:34:56,806 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:34:56,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:34:56,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-02-04 14:34:56,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 14:34:56,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:34:56,828 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 14:34:56,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:34:56,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:34:56,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-02-04 14:34:56,835 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 14:34:56,842 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:34:56,849 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 14:34:56,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:18 [2018-02-04 14:34:56,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:34:56,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:34:56,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-02-04 14:34:56,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 14:34:56,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 14:34:56,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=223, Unknown=6, NotChecked=0, Total=272 [2018-02-04 14:34:56,952 INFO L87 Difference]: Start difference. First operand 297 states and 332 transitions. Second operand 17 states. [2018-02-04 14:34:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:57,739 INFO L93 Difference]: Finished difference Result 429 states and 457 transitions. [2018-02-04 14:34:57,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 14:34:57,740 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-02-04 14:34:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:57,741 INFO L225 Difference]: With dead ends: 429 [2018-02-04 14:34:57,742 INFO L226 Difference]: Without dead ends: 429 [2018-02-04 14:34:57,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=910, Unknown=11, NotChecked=0, Total=1122 [2018-02-04 14:34:57,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-02-04 14:34:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 325. [2018-02-04 14:34:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-04 14:34:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 367 transitions. [2018-02-04 14:34:57,745 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 367 transitions. Word has length 55 [2018-02-04 14:34:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:57,745 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 367 transitions. [2018-02-04 14:34:57,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 14:34:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 367 transitions. [2018-02-04 14:34:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 14:34:57,746 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:57,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:57,746 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:57,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1054600801, now seen corresponding path program 1 times [2018-02-04 14:34:57,746 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:57,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:57,747 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:57,747 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:57,747 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:57,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:34:57,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:34:57,791 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 14:34:57,798 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:57,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:34:57,871 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~list~0.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~list~0.base 0)) (not (= 0 main_~list~0.base)) (= (select |c_old(#valid)| main_~list~0.base) 0))) is different from true [2018-02-04 14:34:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-02-04 14:34:57,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:34:57,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2018-02-04 14:34:57,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:34:57,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:34:57,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2018-02-04 14:34:57,898 INFO L87 Difference]: Start difference. First operand 325 states and 367 transitions. Second operand 10 states. [2018-02-04 14:34:58,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:58,214 INFO L93 Difference]: Finished difference Result 364 states and 406 transitions. [2018-02-04 14:34:58,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:34:58,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-02-04 14:34:58,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:58,216 INFO L225 Difference]: With dead ends: 364 [2018-02-04 14:34:58,216 INFO L226 Difference]: Without dead ends: 334 [2018-02-04 14:34:58,216 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=134, Unknown=1, NotChecked=24, Total=210 [2018-02-04 14:34:58,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-02-04 14:34:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2018-02-04 14:34:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-02-04 14:34:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 375 transitions. [2018-02-04 14:34:58,220 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 375 transitions. Word has length 56 [2018-02-04 14:34:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:58,220 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 375 transitions. [2018-02-04 14:34:58,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:34:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 375 transitions. [2018-02-04 14:34:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 14:34:58,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:58,221 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:58,221 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:58,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1232458711, now seen corresponding path program 1 times [2018-02-04 14:34:58,222 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:58,222 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:58,222 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:58,222 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:58,222 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:58,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:58,310 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 14:34:58,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:58,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 14:34:58,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:34:58,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:34:58,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:34:58,310 INFO L87 Difference]: Start difference. First operand 333 states and 375 transitions. Second operand 10 states. [2018-02-04 14:34:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:58,683 INFO L93 Difference]: Finished difference Result 541 states and 601 transitions. [2018-02-04 14:34:58,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:34:58,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-02-04 14:34:58,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:58,685 INFO L225 Difference]: With dead ends: 541 [2018-02-04 14:34:58,685 INFO L226 Difference]: Without dead ends: 541 [2018-02-04 14:34:58,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-02-04 14:34:58,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-02-04 14:34:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 343. [2018-02-04 14:34:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-04 14:34:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 387 transitions. [2018-02-04 14:34:58,690 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 387 transitions. Word has length 58 [2018-02-04 14:34:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:58,691 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 387 transitions. [2018-02-04 14:34:58,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:34:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 387 transitions. [2018-02-04 14:34:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 14:34:58,692 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:58,692 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:58,692 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:58,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1232458710, now seen corresponding path program 1 times [2018-02-04 14:34:58,692 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:58,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:58,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:58,693 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:58,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:58,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:58,831 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 14:34:58,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:58,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 14:34:58,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:34:58,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:34:58,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:34:58,832 INFO L87 Difference]: Start difference. First operand 343 states and 387 transitions. Second operand 10 states. [2018-02-04 14:34:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:59,202 INFO L93 Difference]: Finished difference Result 547 states and 608 transitions. [2018-02-04 14:34:59,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 14:34:59,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-02-04 14:34:59,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:59,204 INFO L225 Difference]: With dead ends: 547 [2018-02-04 14:34:59,204 INFO L226 Difference]: Without dead ends: 547 [2018-02-04 14:34:59,204 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-02-04 14:34:59,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-02-04 14:34:59,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 350. [2018-02-04 14:34:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-04 14:34:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 393 transitions. [2018-02-04 14:34:59,209 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 393 transitions. Word has length 58 [2018-02-04 14:34:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:59,209 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 393 transitions. [2018-02-04 14:34:59,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:34:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 393 transitions. [2018-02-04 14:34:59,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 14:34:59,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:59,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:59,210 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:59,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1559851379, now seen corresponding path program 1 times [2018-02-04 14:34:59,210 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:59,210 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:59,211 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:59,211 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:59,211 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:59,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:59,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:34:59,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:59,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:34:59,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:34:59,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:34:59,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:34:59,273 INFO L87 Difference]: Start difference. First operand 350 states and 393 transitions. Second operand 7 states. [2018-02-04 14:34:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:59,482 INFO L93 Difference]: Finished difference Result 364 states and 402 transitions. [2018-02-04 14:34:59,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:34:59,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-02-04 14:34:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:59,484 INFO L225 Difference]: With dead ends: 364 [2018-02-04 14:34:59,484 INFO L226 Difference]: Without dead ends: 364 [2018-02-04 14:34:59,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:34:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-02-04 14:34:59,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 350. [2018-02-04 14:34:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-04 14:34:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 392 transitions. [2018-02-04 14:34:59,488 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 392 transitions. Word has length 61 [2018-02-04 14:34:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:59,489 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 392 transitions. [2018-02-04 14:34:59,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:34:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 392 transitions. [2018-02-04 14:34:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 14:34:59,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:59,489 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:59,490 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:59,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1015558783, now seen corresponding path program 1 times [2018-02-04 14:34:59,490 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:59,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:59,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:59,491 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:59,491 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:59,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:34:59,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:59,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:34:59,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:34:59,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:34:59,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:34:59,513 INFO L87 Difference]: Start difference. First operand 350 states and 392 transitions. Second operand 3 states. [2018-02-04 14:34:59,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:59,519 INFO L93 Difference]: Finished difference Result 535 states and 604 transitions. [2018-02-04 14:34:59,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:34:59,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-02-04 14:34:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:59,521 INFO L225 Difference]: With dead ends: 535 [2018-02-04 14:34:59,521 INFO L226 Difference]: Without dead ends: 535 [2018-02-04 14:34:59,521 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:34:59,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-02-04 14:34:59,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 410. [2018-02-04 14:34:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 14:34:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 467 transitions. [2018-02-04 14:34:59,527 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 467 transitions. Word has length 63 [2018-02-04 14:34:59,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:59,527 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 467 transitions. [2018-02-04 14:34:59,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:34:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 467 transitions. [2018-02-04 14:34:59,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 14:34:59,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:59,529 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:34:59,529 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:59,529 INFO L82 PathProgramCache]: Analyzing trace with hash -958300481, now seen corresponding path program 1 times [2018-02-04 14:34:59,529 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:59,529 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:59,530 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:59,530 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:59,530 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:59,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:34:59,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:59,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:34:59,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:34:59,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:34:59,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:34:59,581 INFO L87 Difference]: Start difference. First operand 410 states and 467 transitions. Second operand 6 states. [2018-02-04 14:34:59,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:34:59,661 INFO L93 Difference]: Finished difference Result 386 states and 430 transitions. [2018-02-04 14:34:59,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:34:59,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-02-04 14:34:59,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:34:59,663 INFO L225 Difference]: With dead ends: 386 [2018-02-04 14:34:59,663 INFO L226 Difference]: Without dead ends: 386 [2018-02-04 14:34:59,663 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:34:59,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-04 14:34:59,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 339. [2018-02-04 14:34:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-04 14:34:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 375 transitions. [2018-02-04 14:34:59,668 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 375 transitions. Word has length 63 [2018-02-04 14:34:59,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:34:59,668 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 375 transitions. [2018-02-04 14:34:59,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:34:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 375 transitions. [2018-02-04 14:34:59,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 14:34:59,669 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:34:59,669 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, 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 14:34:59,669 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:34:59,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1831044472, now seen corresponding path program 1 times [2018-02-04 14:34:59,669 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:34:59,669 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:34:59,670 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:59,670 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:34:59,670 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:34:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:34:59,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:34:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 14:34:59,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:34:59,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 14:34:59,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:34:59,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:34:59,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:34:59,815 INFO L87 Difference]: Start difference. First operand 339 states and 375 transitions. Second operand 10 states. [2018-02-04 14:35:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:35:00,069 INFO L93 Difference]: Finished difference Result 469 states and 522 transitions. [2018-02-04 14:35:00,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 14:35:00,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-02-04 14:35:00,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:35:00,071 INFO L225 Difference]: With dead ends: 469 [2018-02-04 14:35:00,071 INFO L226 Difference]: Without dead ends: 469 [2018-02-04 14:35:00,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-02-04 14:35:00,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-02-04 14:35:00,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 309. [2018-02-04 14:35:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-02-04 14:35:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 343 transitions. [2018-02-04 14:35:00,075 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 343 transitions. Word has length 63 [2018-02-04 14:35:00,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:35:00,076 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 343 transitions. [2018-02-04 14:35:00,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:35:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 343 transitions. [2018-02-04 14:35:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 14:35:00,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:35:00,077 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:35:00,077 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:35:00,077 INFO L82 PathProgramCache]: Analyzing trace with hash -795758795, now seen corresponding path program 1 times [2018-02-04 14:35:00,077 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:35:00,077 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:35:00,078 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:35:00,078 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:35:00,078 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:35:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:35:00,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:35:00,217 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 14:35:00,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:35:00,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 14:35:00,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:35:00,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:35:00,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:35:00,219 INFO L87 Difference]: Start difference. First operand 309 states and 343 transitions. Second operand 10 states. [2018-02-04 14:35:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:35:00,419 INFO L93 Difference]: Finished difference Result 467 states and 520 transitions. [2018-02-04 14:35:00,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:35:00,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-02-04 14:35:00,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:35:00,420 INFO L225 Difference]: With dead ends: 467 [2018-02-04 14:35:00,420 INFO L226 Difference]: Without dead ends: 467 [2018-02-04 14:35:00,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-02-04 14:35:00,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-04 14:35:00,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 310. [2018-02-04 14:35:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-04 14:35:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 344 transitions. [2018-02-04 14:35:00,424 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 344 transitions. Word has length 67 [2018-02-04 14:35:00,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:35:00,424 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 344 transitions. [2018-02-04 14:35:00,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:35:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 344 transitions. [2018-02-04 14:35:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 14:35:00,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:35:00,425 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:35:00,425 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:35:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1091380990, now seen corresponding path program 1 times [2018-02-04 14:35:00,426 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:35:00,426 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:35:00,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:35:00,426 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:35:00,427 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:35:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:35:00,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:35:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 14:35:00,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:35:00,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:35:00,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:35:00,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:35:00,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:35:00,482 INFO L87 Difference]: Start difference. First operand 310 states and 344 transitions. Second operand 5 states. [2018-02-04 14:35:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:35:00,567 INFO L93 Difference]: Finished difference Result 326 states and 360 transitions. [2018-02-04 14:35:00,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:35:00,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-04 14:35:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:35:00,568 INFO L225 Difference]: With dead ends: 326 [2018-02-04 14:35:00,568 INFO L226 Difference]: Without dead ends: 326 [2018-02-04 14:35:00,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:35:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-04 14:35:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 314. [2018-02-04 14:35:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-02-04 14:35:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 347 transitions. [2018-02-04 14:35:00,573 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 347 transitions. Word has length 67 [2018-02-04 14:35:00,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:35:00,573 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 347 transitions. [2018-02-04 14:35:00,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:35:00,573 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 347 transitions. [2018-02-04 14:35:00,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 14:35:00,574 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:35:00,574 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:35:00,574 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:35:00,574 INFO L82 PathProgramCache]: Analyzing trace with hash 2101911161, now seen corresponding path program 1 times [2018-02-04 14:35:00,574 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:35:00,574 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:35:00,575 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:35:00,575 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:35:00,575 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:35:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:35:00,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:35:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:35:00,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:35:00,722 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 14:35:00,727 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:35:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:35:00,749 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:35:00,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:00,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:00,785 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 14:35:00,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:00,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:00,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-02-04 14:35:00,818 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 14:35:00,819 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 14:35:00,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:00,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:00,829 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 14:35:00,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-04 14:35:00,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:00,888 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 36 treesize of output 37 [2018-02-04 14:35:00,890 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 14:35:00,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:00,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:00,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:00,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 14:35:00,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-02-04 14:35:00,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:00,927 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 20 treesize of output 31 [2018-02-04 14:35:00,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:00,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:00,941 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 14:35:00,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2018-02-04 14:35:01,030 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 49 treesize of output 31 [2018-02-04 14:35:01,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:01,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 14:35:01,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:01,048 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 14:35:01,048 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:01,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:01,054 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 14:35:01,054 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:15 [2018-02-04 14:35:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:35:01,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:35:01,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2018-02-04 14:35:01,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 14:35:01,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 14:35:01,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-02-04 14:35:01,134 INFO L87 Difference]: Start difference. First operand 314 states and 347 transitions. Second operand 23 states. [2018-02-04 14:35:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:35:01,842 INFO L93 Difference]: Finished difference Result 516 states and 561 transitions. [2018-02-04 14:35:01,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 14:35:01,843 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-02-04 14:35:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:35:01,843 INFO L225 Difference]: With dead ends: 516 [2018-02-04 14:35:01,844 INFO L226 Difference]: Without dead ends: 516 [2018-02-04 14:35:01,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 14:35:01,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-02-04 14:35:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 373. [2018-02-04 14:35:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-02-04 14:35:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 416 transitions. [2018-02-04 14:35:01,848 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 416 transitions. Word has length 69 [2018-02-04 14:35:01,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:35:01,848 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 416 transitions. [2018-02-04 14:35:01,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 14:35:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 416 transitions. [2018-02-04 14:35:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 14:35:01,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:35:01,849 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:35:01,849 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:35:01,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2101911162, now seen corresponding path program 1 times [2018-02-04 14:35:01,850 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:35:01,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:35:01,850 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:35:01,851 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:35:01,851 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:35:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:35:01,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:35:02,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:35:02,043 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:35:02,043 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 14:35:02,049 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:35:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:35:02,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:35:02,112 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 14:35:02,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:02,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:02,121 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 14:35:02,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-02-04 14:35:02,141 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 14:35:02,145 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 14:35:02,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,167 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 14:35:02,169 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 14:35:02,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,185 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 14:35:02,186 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-02-04 14:35:02,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:02,231 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 14:35:02,233 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 14:35:02,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:02,253 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 47 treesize of output 48 [2018-02-04 14:35:02,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 8 treesize of output 7 [2018-02-04 14:35:02,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,268 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-02-04 14:35:02,292 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 40 treesize of output 35 [2018-02-04 14:35:02,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:02,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-02-04 14:35:02,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,319 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 74 treesize of output 64 [2018-02-04 14:35:02,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:02,322 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 20 treesize of output 31 [2018-02-04 14:35:02,322 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,337 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 14:35:02,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:73 [2018-02-04 14:35:02,406 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 73 treesize of output 51 [2018-02-04 14:35:02,408 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 39 treesize of output 26 [2018-02-04 14:35:02,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,418 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:02,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 14:35:02,419 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,432 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 31 treesize of output 27 [2018-02-04 14:35:02,436 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 14:35:02,436 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:02,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 14:35:02,442 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,444 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:02,446 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 14:35:02,447 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:87, output treesize:9 [2018-02-04 14:35:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:35:02,506 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:35:02,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-02-04 14:35:02,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 14:35:02,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 14:35:02,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=286, Unknown=1, NotChecked=0, Total=342 [2018-02-04 14:35:02,507 INFO L87 Difference]: Start difference. First operand 373 states and 416 transitions. Second operand 19 states. [2018-02-04 14:35:03,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:35:03,291 INFO L93 Difference]: Finished difference Result 505 states and 550 transitions. [2018-02-04 14:35:03,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 14:35:03,291 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-02-04 14:35:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:35:03,292 INFO L225 Difference]: With dead ends: 505 [2018-02-04 14:35:03,292 INFO L226 Difference]: Without dead ends: 505 [2018-02-04 14:35:03,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=807, Unknown=1, NotChecked=0, Total=992 [2018-02-04 14:35:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-02-04 14:35:03,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 396. [2018-02-04 14:35:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-04 14:35:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 444 transitions. [2018-02-04 14:35:03,296 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 444 transitions. Word has length 69 [2018-02-04 14:35:03,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:35:03,297 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 444 transitions. [2018-02-04 14:35:03,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 14:35:03,297 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 444 transitions. [2018-02-04 14:35:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 14:35:03,298 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:35:03,298 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, 1, 1, 1, 1, 1, 1, 1, 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 14:35:03,298 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:35:03,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1419604425, now seen corresponding path program 1 times [2018-02-04 14:35:03,298 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:35:03,298 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:35:03,299 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:35:03,299 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:35:03,299 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:35:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:35:03,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:35:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:35:03,671 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:35:03,671 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 14:35:03,676 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:35:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:35:03,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:35:03,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:03,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:03,717 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 14:35:03,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:03,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:03,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-02-04 14:35:03,740 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 13 treesize of output 10 [2018-02-04 14:35:03,742 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 10 treesize of output 9 [2018-02-04 14:35:03,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:03,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:03,748 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 14:35:03,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-02-04 14:35:03,773 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 45 treesize of output 39 [2018-02-04 14:35:03,775 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 14 treesize of output 13 [2018-02-04 14:35:03,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:03,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:03,788 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 14:35:03,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-02-04 14:35:03,859 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 60 treesize of output 46 [2018-02-04 14:35:03,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-02-04 14:35:03,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:03,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:03,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 14:35:03,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-02-04 14:35:07,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:07,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:07,954 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:07,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 58 [2018-02-04 14:35:07,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:07,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:35:07,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-02-04 14:35:08,007 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 58 treesize of output 61 [2018-02-04 14:35:08,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:08,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-02-04 14:35:08,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:08,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:08,031 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 14:35:08,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-02-04 14:35:08,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:08,160 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 86 treesize of output 100 [2018-02-04 14:35:08,162 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 14:35:08,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:08,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:08,180 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 14:35:08,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-02-04 14:35:08,228 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 100 treesize of output 93 [2018-02-04 14:35:08,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:08,231 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 20 treesize of output 31 [2018-02-04 14:35:08,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:08,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:08,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 14:35:08,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:100 [2018-02-04 14:35:08,352 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 91 treesize of output 64 [2018-02-04 14:35:08,354 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 7 treesize of output 1 [2018-02-04 14:35:08,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:08,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:08,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 14:35:08,362 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:08,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2018-02-04 14:35:08,368 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:35:08,373 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 14:35:08,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 14:35:08,378 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:28 [2018-02-04 14:35:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:35:08,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:35:08,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2018-02-04 14:35:08,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 14:35:08,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 14:35:08,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1189, Unknown=3, NotChecked=0, Total=1406 [2018-02-04 14:35:08,477 INFO L87 Difference]: Start difference. First operand 396 states and 444 transitions. Second operand 38 states. [2018-02-04 14:35:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:35:29,803 INFO L93 Difference]: Finished difference Result 734 states and 810 transitions. [2018-02-04 14:35:29,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 14:35:29,804 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-02-04 14:35:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:35:29,805 INFO L225 Difference]: With dead ends: 734 [2018-02-04 14:35:29,805 INFO L226 Difference]: Without dead ends: 734 [2018-02-04 14:35:29,806 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=1219, Invalid=4619, Unknown=14, NotChecked=0, Total=5852 [2018-02-04 14:35:29,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-02-04 14:35:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 396. [2018-02-04 14:35:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-04 14:35:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 443 transitions. [2018-02-04 14:35:29,810 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 443 transitions. Word has length 72 [2018-02-04 14:35:29,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:35:29,810 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 443 transitions. [2018-02-04 14:35:29,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 14:35:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 443 transitions. [2018-02-04 14:35:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 14:35:29,811 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:35:29,811 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, 1, 1, 1, 1, 1, 1, 1, 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 14:35:29,812 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:35:29,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1419604424, now seen corresponding path program 1 times [2018-02-04 14:35:29,812 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:35:29,812 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:35:29,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:35:29,813 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:35:29,813 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:35:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:35:29,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:35:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:35:30,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:35:30,296 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 14:35:30,301 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:35:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:35:30,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:35:30,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 14:35:30,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:30,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:30,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:30,371 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 14:35:30,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:30,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:30,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-04 14:35:30,396 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 13 treesize of output 10 [2018-02-04 14:35:30,397 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 10 treesize of output 9 [2018-02-04 14:35:30,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:30,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:30,406 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 13 treesize of output 10 [2018-02-04 14:35:30,407 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 10 treesize of output 9 [2018-02-04 14:35:30,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:30,408 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:30,414 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 14:35:30,414 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:53 [2018-02-04 14:35:30,459 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 79 treesize of output 73 [2018-02-04 14:35:30,461 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 14 treesize of output 13 [2018-02-04 14:35:30,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:30,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:30,479 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 33 treesize of output 34 [2018-02-04 14:35:30,480 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 14 treesize of output 13 [2018-02-04 14:35:30,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:30,483 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:30,490 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 14:35:30,490 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:79 [2018-02-04 14:35:30,576 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 109 treesize of output 95 [2018-02-04 14:35:30,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-02-04 14:35:30,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:30,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:30,601 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 48 treesize of output 41 [2018-02-04 14:35:30,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-02-04 14:35:30,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:30,607 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:30,618 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 14:35:30,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:129, output treesize:109 [2018-02-04 14:35:34,735 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:34,736 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 18 treesize of output 27 [2018-02-04 14:35:34,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:34,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:34,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:34,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:34,758 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 22 treesize of output 25 [2018-02-04 14:35:34,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:34,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:35:34,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:92 [2018-02-04 14:35:34,817 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 73 treesize of output 74 [2018-02-04 14:35:34,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:34,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 85 [2018-02-04 14:35:34,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:34,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:34,854 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 36 treesize of output 44 [2018-02-04 14:35:34,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:34,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 14:35:34,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:34,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:34,883 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 14:35:34,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:114, output treesize:104 [2018-02-04 14:35:35,006 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:35,012 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 101 treesize of output 115 [2018-02-04 14:35:35,014 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 14:35:35,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:35,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:35,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:35,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 36 treesize of output 61 [2018-02-04 14:35:35,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 12 treesize of output 11 [2018-02-04 14:35:35,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:35,063 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:35,078 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 14:35:35,078 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:127, output treesize:119 [2018-02-04 14:35:35,157 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 57 treesize of output 76 [2018-02-04 14:35:35,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:35,160 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 20 treesize of output 31 [2018-02-04 14:35:35,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:35,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:35,198 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 139 treesize of output 132 [2018-02-04 14:35:35,200 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:35,200 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 20 treesize of output 31 [2018-02-04 14:35:35,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:35,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:35,231 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 14:35:35,232 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:162, output treesize:146 [2018-02-04 14:35:35,482 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 140 treesize of output 105 [2018-02-04 14:35:35,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:35,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 14:35:35,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:35,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 54 [2018-02-04 14:35:35,500 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 14:35:35,512 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 7 treesize of output 1 [2018-02-04 14:35:35,512 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:35,520 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 14:35:35,537 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2018-02-04 14:35:35,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 14:35:35,541 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:35,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:35,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 14:35:35,549 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:35,553 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 7 treesize of output 1 [2018-02-04 14:35:35,554 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:35,556 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:35,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:35:35,563 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:164, output treesize:18 [2018-02-04 14:35:35,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:35:35,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:35:35,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 38 [2018-02-04 14:35:35,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 14:35:35,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 14:35:35,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1296, Unknown=2, NotChecked=0, Total=1482 [2018-02-04 14:35:35,677 INFO L87 Difference]: Start difference. First operand 396 states and 443 transitions. Second operand 39 states. [2018-02-04 14:35:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:35:40,001 INFO L93 Difference]: Finished difference Result 789 states and 866 transitions. [2018-02-04 14:35:40,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 14:35:40,001 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2018-02-04 14:35:40,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:35:40,002 INFO L225 Difference]: With dead ends: 789 [2018-02-04 14:35:40,002 INFO L226 Difference]: Without dead ends: 789 [2018-02-04 14:35:40,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1191, Invalid=5779, Unknown=2, NotChecked=0, Total=6972 [2018-02-04 14:35:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-02-04 14:35:40,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 396. [2018-02-04 14:35:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-04 14:35:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 440 transitions. [2018-02-04 14:35:40,007 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 440 transitions. Word has length 72 [2018-02-04 14:35:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:35:40,007 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 440 transitions. [2018-02-04 14:35:40,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 14:35:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 440 transitions. [2018-02-04 14:35:40,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 14:35:40,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:35:40,008 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, 1, 1, 1, 1, 1, 1, 1, 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 14:35:40,008 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:35:40,008 INFO L82 PathProgramCache]: Analyzing trace with hash 56617986, now seen corresponding path program 1 times [2018-02-04 14:35:40,008 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:35:40,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:35:40,009 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:35:40,009 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:35:40,009 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:35:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:35:40,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:35:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:35:40,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:35:40,558 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 14:35:40,563 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:35:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:35:40,580 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:35:40,625 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 13 treesize of output 10 [2018-02-04 14:35:40,626 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 10 treesize of output 9 [2018-02-04 14:35:40,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,633 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 13 treesize of output 10 [2018-02-04 14:35:40,634 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 10 treesize of output 9 [2018-02-04 14:35:40,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-02-04 14:35:40,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:40,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:40,687 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 14:35:40,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:45 [2018-02-04 14:35:40,729 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 21 treesize of output 19 [2018-02-04 14:35:40,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:40,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 14:35:40,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,748 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 21 treesize of output 19 [2018-02-04 14:35:40,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:40,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 14:35:40,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,764 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 14:35:40,764 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:53 [2018-02-04 14:35:40,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:40,857 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 21 treesize of output 26 [2018-02-04 14:35:40,859 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 14:35:40,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:40,875 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 56 treesize of output 57 [2018-02-04 14:35:40,876 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 14:35:40,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,891 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:76, output treesize:72 [2018-02-04 14:35:40,925 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:40,925 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:40,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:40,926 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 14:35:40,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:70 [2018-02-04 14:35:40,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:40,974 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 64 treesize of output 63 [2018-02-04 14:35:40,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:40,977 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 16 treesize of output 23 [2018-02-04 14:35:40,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:40,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:41,003 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 34 treesize of output 40 [2018-02-04 14:35:41,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:41,005 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 20 treesize of output 31 [2018-02-04 14:35:41,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:41,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:41,020 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 14:35:41,020 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:82 [2018-02-04 14:35:41,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:41,136 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 113 treesize of output 121 [2018-02-04 14:35:41,139 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 14 treesize of output 13 [2018-02-04 14:35:41,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:41,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:41,178 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 44 treesize of output 67 [2018-02-04 14:35:41,180 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 14 treesize of output 13 [2018-02-04 14:35:41,180 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:41,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:41,198 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 14:35:41,198 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:128, output treesize:104 [2018-02-04 14:35:41,307 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 71 treesize of output 86 [2018-02-04 14:35:41,310 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 26 treesize of output 37 [2018-02-04 14:35:41,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:41,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:41,340 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 158 treesize of output 119 [2018-02-04 14:35:41,342 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 26 treesize of output 37 [2018-02-04 14:35:41,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:41,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:41,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 14:35:41,367 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:187, output treesize:159 [2018-02-04 14:35:45,505 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 101 [2018-02-04 14:35:45,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:45,509 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-02-04 14:35:45,509 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 14:35:45,530 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 13 treesize of output 1 [2018-02-04 14:35:45,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:45,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:35:45,541 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-02-04 14:35:45,542 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:35:45,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 14:35:45,565 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2018-02-04 14:35:45,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 14:35:45,567 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:45,574 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 14:35:45,574 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:45,579 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 13 treesize of output 1 [2018-02-04 14:35:45,580 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 14:35:45,581 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:35:45,587 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 14:35:45,587 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:177, output treesize:7 [2018-02-04 14:35:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:35:45,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:35:45,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 41 [2018-02-04 14:35:45,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 14:35:45,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 14:35:45,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1424, Unknown=2, NotChecked=0, Total=1640 [2018-02-04 14:35:45,693 INFO L87 Difference]: Start difference. First operand 396 states and 440 transitions. Second operand 41 states. [2018-02-04 14:36:01,884 WARN L146 SmtUtils]: Spent 2575ms on a formula simplification. DAG size of input: 88 DAG size of output 84 [2018-02-04 14:36:12,019 WARN L146 SmtUtils]: Spent 4062ms on a formula simplification. DAG size of input: 84 DAG size of output 80 [2018-02-04 14:36:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:36:20,186 INFO L93 Difference]: Finished difference Result 711 states and 784 transitions. [2018-02-04 14:36:20,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 14:36:20,186 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 72 [2018-02-04 14:36:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:36:20,187 INFO L225 Difference]: With dead ends: 711 [2018-02-04 14:36:20,187 INFO L226 Difference]: Without dead ends: 711 [2018-02-04 14:36:20,188 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=1418, Invalid=6401, Unknown=13, NotChecked=0, Total=7832 [2018-02-04 14:36:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-02-04 14:36:20,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 448. [2018-02-04 14:36:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-02-04 14:36:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 496 transitions. [2018-02-04 14:36:20,191 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 496 transitions. Word has length 72 [2018-02-04 14:36:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:36:20,192 INFO L432 AbstractCegarLoop]: Abstraction has 448 states and 496 transitions. [2018-02-04 14:36:20,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 14:36:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 496 transitions. [2018-02-04 14:36:20,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 14:36:20,192 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:36:20,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:36:20,192 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:36:20,192 INFO L82 PathProgramCache]: Analyzing trace with hash -797751232, now seen corresponding path program 1 times [2018-02-04 14:36:20,192 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:36:20,193 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:36:20,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:36:20,193 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:36:20,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:36:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:36:20,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:36:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:36:20,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:36:20,509 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 14:36:20,515 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:36:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:36:20,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:36:20,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 14:36:20,648 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 15 treesize of output 12 [2018-02-04 14:36:20,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 14:36:20,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:36:20,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:36:20,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 14:36:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:36:20,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:36:20,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2018-02-04 14:36:20,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 14:36:20,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 14:36:20,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-02-04 14:36:20,795 INFO L87 Difference]: Start difference. First operand 448 states and 496 transitions. Second operand 24 states. [2018-02-04 14:36:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:36:24,471 INFO L93 Difference]: Finished difference Result 624 states and 677 transitions. [2018-02-04 14:36:24,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 14:36:24,472 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-02-04 14:36:24,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:36:24,473 INFO L225 Difference]: With dead ends: 624 [2018-02-04 14:36:24,473 INFO L226 Difference]: Without dead ends: 533 [2018-02-04 14:36:24,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=568, Invalid=3988, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 14:36:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-02-04 14:36:24,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 490. [2018-02-04 14:36:24,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-02-04 14:36:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 559 transitions. [2018-02-04 14:36:24,476 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 559 transitions. Word has length 74 [2018-02-04 14:36:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:36:24,477 INFO L432 AbstractCegarLoop]: Abstraction has 490 states and 559 transitions. [2018-02-04 14:36:24,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 14:36:24,477 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 559 transitions. [2018-02-04 14:36:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 14:36:24,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:36:24,477 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:36:24,478 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:36:24,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1540538446, now seen corresponding path program 1 times [2018-02-04 14:36:24,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:36:24,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:36:24,478 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:36:24,478 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:36:24,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:36:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:36:24,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:36:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:36:24,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:36:24,740 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 14:36:24,745 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:36:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:36:24,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:36:24,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:36:24,773 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:36:24,773 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 14:36:24,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:36:24,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:36:24,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-02-04 14:36:24,794 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 14:36:24,795 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 14:36:24,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:36:24,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:36:24,801 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 14:36:24,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-04 14:36:24,841 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 14:36:24,843 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 14:36:24,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:36:24,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:36:24,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:36:24,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-02-04 14:36:24,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:36:24,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:36:24,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:36:24,870 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 16 treesize of output 13 [2018-02-04 14:36:24,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:36:24,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:36:24,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:27 [2018-02-04 14:36:24,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-02-04 14:36:24,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:36:24,909 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 16 treesize of output 23 [2018-02-04 14:36:24,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:36:24,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:36:24,933 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 14:36:24,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:44 [2018-02-04 14:36:24,978 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 58 treesize of output 56 [2018-02-04 14:36:24,979 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 14 treesize of output 13 [2018-02-04 14:36:24,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:36:24,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:36:24,992 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 14:36:24,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:57 [2018-02-04 14:36:25,076 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 111 treesize of output 80 [2018-02-04 14:36:25,078 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 26 treesize of output 37 [2018-02-04 14:36:25,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:36:25,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:36:25,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 14:36:25,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:97 [2018-02-04 14:36:29,216 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 104 treesize of output 61 [2018-02-04 14:36:29,218 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 29 treesize of output 18 [2018-02-04 14:36:29,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:36:29,226 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 13 treesize of output 1 [2018-02-04 14:36:29,226 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:36:29,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:36:29,231 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-02-04 14:36:29,232 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:36:29,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:36:29,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:36:29,236 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:104, output treesize:5 [2018-02-04 14:36:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:36:29,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:36:29,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2018-02-04 14:36:29,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 14:36:29,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 14:36:29,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=747, Unknown=2, NotChecked=0, Total=870 [2018-02-04 14:36:29,270 INFO L87 Difference]: Start difference. First operand 490 states and 559 transitions. Second operand 30 states. [2018-02-04 14:36:47,937 WARN L146 SmtUtils]: Spent 4077ms on a formula simplification. DAG size of input: 72 DAG size of output 59 [2018-02-04 14:36:58,001 WARN L146 SmtUtils]: Spent 4043ms on a formula simplification. DAG size of input: 62 DAG size of output 55 [2018-02-04 14:37:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:37:10,805 INFO L93 Difference]: Finished difference Result 840 states and 961 transitions. [2018-02-04 14:37:10,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 14:37:10,805 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 74 [2018-02-04 14:37:10,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:37:10,807 INFO L225 Difference]: With dead ends: 840 [2018-02-04 14:37:10,807 INFO L226 Difference]: Without dead ends: 840 [2018-02-04 14:37:10,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 39.1s TimeCoverageRelationStatistics Valid=437, Invalid=1900, Unknown=15, NotChecked=0, Total=2352 [2018-02-04 14:37:10,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-02-04 14:37:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 561. [2018-02-04 14:37:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-02-04 14:37:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 642 transitions. [2018-02-04 14:37:10,811 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 642 transitions. Word has length 74 [2018-02-04 14:37:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:37:10,811 INFO L432 AbstractCegarLoop]: Abstraction has 561 states and 642 transitions. [2018-02-04 14:37:10,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 14:37:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 642 transitions. [2018-02-04 14:37:10,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 14:37:10,811 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:37:10,812 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:37:10,812 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:37:10,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1540538445, now seen corresponding path program 1 times [2018-02-04 14:37:10,812 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:37:10,812 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:37:10,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:37:10,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:37:10,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:37:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:37:10,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:37:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:37:11,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:37:11,167 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 14:37:11,182 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:37:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:37:11,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:37:11,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:37:11,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:37:11,220 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 14:37:11,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-02-04 14:37:11,257 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 14:37:11,259 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 14:37:11,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,273 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 14:37:11,275 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 14:37:11,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,285 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 14:37:11,286 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-02-04 14:37:11,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:37:11,377 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 14:37:11,378 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 14:37:11,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:37:11,393 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 47 treesize of output 48 [2018-02-04 14:37:11,396 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 14:37:11,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,407 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-02-04 14:37:11,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:37:11,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:37:11,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:37:11,434 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 14:37:11,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:56 [2018-02-04 14:37:11,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:37:11,468 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 55 treesize of output 54 [2018-02-04 14:37:11,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:37:11,470 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 16 treesize of output 23 [2018-02-04 14:37:11,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,494 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 32 treesize of output 38 [2018-02-04 14:37:11,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:37:11,496 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 20 treesize of output 31 [2018-02-04 14:37:11,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,513 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 14:37:11,513 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:75 [2018-02-04 14:37:11,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:37:11,573 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 104 treesize of output 112 [2018-02-04 14:37:11,575 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 14 treesize of output 13 [2018-02-04 14:37:11,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,604 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 42 treesize of output 65 [2018-02-04 14:37:11,605 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 14 treesize of output 13 [2018-02-04 14:37:11,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,623 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 14:37:11,623 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:121, output treesize:97 [2018-02-04 14:37:11,716 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 174 treesize of output 131 [2018-02-04 14:37:11,719 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 26 treesize of output 37 [2018-02-04 14:37:11,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,756 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 69 treesize of output 84 [2018-02-04 14:37:11,758 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 26 treesize of output 37 [2018-02-04 14:37:11,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:37:11,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 14:37:11,777 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:184, output treesize:156 [2018-02-04 14:37:15,908 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 153 treesize of output 96 [2018-02-04 14:37:15,912 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 13 treesize of output 1 [2018-02-04 14:37:15,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:15,930 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 40 treesize of output 27 [2018-02-04 14:37:15,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:15,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:37:15,947 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-02-04 14:37:15,947 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:37:15,959 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 14:37:15,980 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2018-02-04 14:37:15,982 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 14:37:15,982 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:15,993 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 14:37:15,993 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:16,000 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 13 treesize of output 1 [2018-02-04 14:37:16,001 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 14:37:16,002 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:37:16,010 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 14:37:16,010 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:170, output treesize:9 [2018-02-04 14:37:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:37:16,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:37:16,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-02-04 14:37:16,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 14:37:16,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 14:37:16,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=956, Unknown=2, NotChecked=0, Total=1056 [2018-02-04 14:37:16,112 INFO L87 Difference]: Start difference. First operand 561 states and 642 transitions. Second operand 33 states. [2018-02-04 14:37:35,145 WARN L146 SmtUtils]: Spent 4071ms on a formula simplification. DAG size of input: 120 DAG size of output 68 [2018-02-04 14:38:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:38:00,760 INFO L93 Difference]: Finished difference Result 913 states and 1039 transitions. [2018-02-04 14:38:00,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 14:38:00,761 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2018-02-04 14:38:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:38:00,762 INFO L225 Difference]: With dead ends: 913 [2018-02-04 14:38:00,762 INFO L226 Difference]: Without dead ends: 913 [2018-02-04 14:38:00,763 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=484, Invalid=2690, Unknown=18, NotChecked=0, Total=3192 [2018-02-04 14:38:00,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-02-04 14:38:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 525. [2018-02-04 14:38:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-02-04 14:38:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 601 transitions. [2018-02-04 14:38:00,766 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 601 transitions. Word has length 74 [2018-02-04 14:38:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:38:00,767 INFO L432 AbstractCegarLoop]: Abstraction has 525 states and 601 transitions. [2018-02-04 14:38:00,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 14:38:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 601 transitions. [2018-02-04 14:38:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 14:38:00,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:38:00,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:38:00,767 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 14:38:00,768 INFO L82 PathProgramCache]: Analyzing trace with hash -536278252, now seen corresponding path program 1 times [2018-02-04 14:38:00,768 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:38:00,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:38:00,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:38:00,768 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:38:00,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:38:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:38:00,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:38:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:38:01,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:38:01,292 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 14:38:01,297 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:38:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:38:01,316 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:38:01,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:38:01,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:38:01,355 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 14:38:01,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:38:01,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:38:01,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-02-04 14:38:01,380 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 13 treesize of output 10 [2018-02-04 14:38:01,381 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 10 treesize of output 9 [2018-02-04 14:38:01,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:38:01,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:38:01,386 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 14:38:01,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-02-04 14:38:01,412 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 45 treesize of output 39 [2018-02-04 14:38:01,413 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 14 treesize of output 13 [2018-02-04 14:38:01,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:38:01,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:38:01,420 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 14:38:01,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-02-04 14:38:01,478 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 60 treesize of output 46 [2018-02-04 14:38:01,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-02-04 14:38:01,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:38:01,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:38:01,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 14:38:01,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-02-04 14:38:05,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:38:05,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:38:05,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:38:05,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 58 [2018-02-04 14:38:05,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:38:05,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:38:05,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-02-04 14:38:05,629 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 58 treesize of output 61 [2018-02-04 14:38:05,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:38:05,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-02-04 14:38:05,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:38:05,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:38:05,649 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 14:38:05,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-02-04 14:38:05,769 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:38:05,781 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 86 treesize of output 100 [2018-02-04 14:38:05,783 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 14:38:05,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:38:05,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:38:05,802 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 14:38:05,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-02-04 14:38:05,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:38:05,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:38:05,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:38:05,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:38:05,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 91 [2018-02-04 14:38:05,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:38:05,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:38:05,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:97, output treesize:113 [2018-02-04 14:38:05,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:38:05,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 111 [2018-02-04 14:38:05,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:38:05,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 14:38:05,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:38:05,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:38:05,968 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 14:38:05,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:137 [2018-02-04 14:38:06,087 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:38:06,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 163 [2018-02-04 14:38:06,096 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 14 treesize of output 13 [2018-02-04 14:38:06,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:38:06,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:38:06,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 14:38:06,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:160, output treesize:150 [2018-02-04 14:38:06,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 160 [2018-02-04 14:38:06,290 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 26 treesize of output 37 [2018-02-04 14:38:06,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:38:06,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:38:06,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 14:38:06,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:204, output treesize:190 [2018-02-04 14:38:08,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 113 [2018-02-04 14:38:08,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 39 [2018-02-04 14:38:08,598 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 14:38:08,609 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 7 treesize of output 1 [2018-02-04 14:38:08,610 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:38:08,621 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:38:08,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2018-02-04 14:38:08,622 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:38:08,632 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 13 treesize of output 1 [2018-02-04 14:38:08,632 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 14:38:08,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 14:38:08,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 14:38:08,656 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:184, output treesize:45 [2018-02-04 14:38:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:38:08,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:38:08,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-02-04 14:38:08,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 14:38:08,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 14:38:08,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=1985, Unknown=7, NotChecked=0, Total=2352 [2018-02-04 14:38:08,803 INFO L87 Difference]: Start difference. First operand 525 states and 601 transitions. Second operand 49 states. Received shutdown request... [2018-02-04 14:38:15,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 14:38:15,147 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 14:38:15,150 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 14:38:15,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:38:15 BoogieIcfgContainer [2018-02-04 14:38:15,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:38:15,151 INFO L168 Benchmark]: Toolchain (without parser) took 206684.66 ms. Allocated memory was 400.0 MB in the beginning and 829.9 MB in the end (delta: 429.9 MB). Free memory was 356.9 MB in the beginning and 596.7 MB in the end (delta: -239.8 MB). Peak memory consumption was 190.1 MB. Max. memory is 5.3 GB. [2018-02-04 14:38:15,151 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:38:15,151 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.41 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 345.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-04 14:38:15,152 INFO L168 Benchmark]: Boogie Preprocessor took 28.85 ms. Allocated memory is still 400.0 MB. Free memory was 345.0 MB in the beginning and 342.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:38:15,152 INFO L168 Benchmark]: RCFGBuilder took 438.06 ms. Allocated memory is still 400.0 MB. Free memory was 342.4 MB in the beginning and 297.8 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:38:15,152 INFO L168 Benchmark]: TraceAbstraction took 206041.34 ms. Allocated memory was 400.0 MB in the beginning and 829.9 MB in the end (delta: 429.9 MB). Free memory was 296.5 MB in the beginning and 596.7 MB in the end (delta: -300.2 MB). Peak memory consumption was 129.7 MB. Max. memory is 5.3 GB. [2018-02-04 14:38:15,153 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 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 173.41 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 345.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.85 ms. Allocated memory is still 400.0 MB. Free memory was 345.0 MB in the beginning and 342.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 438.06 ms. Allocated memory is still 400.0 MB. Free memory was 342.4 MB in the beginning and 297.8 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 206041.34 ms. Allocated memory was 400.0 MB in the beginning and 829.9 MB in the end (delta: 429.9 MB). Free memory was 296.5 MB in the beginning and 596.7 MB in the end (delta: -300.2 MB). Peak memory consumption was 129.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 12 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 63 error locations. TIMEOUT Result, 206.0s OverallTime, 40 OverallIterations, 2 TraceHistogramMax, 165.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6033 SDtfs, 19982 SDslu, 36635 SDs, 0 SdLazy, 27724 SolverSat, 1562 SolverUnsat, 68 SolverUnknown, 0 SolverNotchecked, 39.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1621 GetRequests, 712 SyntacticMatches, 45 SemanticMatches, 863 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 157.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=561occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 4950 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 38.5s InterpolantComputationTime, 2753 NumberOfCodeBlocks, 2753 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2701 ConstructedInterpolants, 318 QuantifiedInterpolants, 3939262 SizeOfPredicates, 166 NumberOfNonLiveVariables, 2569 ConjunctsInSsa, 416 ConjunctsInUnsatCore, 52 InterpolantComputations, 28 PerfectInterpolantSequences, 50/142 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-38-15-158.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_14-38-15-158.csv Completed graceful shutdown