java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_dsw_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:05:30,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:05:30,301 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:05:30,316 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:05:30,317 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:05:30,318 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:05:30,319 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:05:30,320 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:05:30,322 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:05:30,323 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:05:30,323 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:05:30,324 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:05:30,325 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:05:30,326 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:05:30,327 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:05:30,329 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:05:30,331 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:05:30,333 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:05:30,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:05:30,336 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:05:30,338 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:05:30,338 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:05:30,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:05:30,339 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:05:30,340 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:05:30,341 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:05:30,342 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:05:30,342 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:05:30,342 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:05:30,343 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:05:30,343 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:05:30,344 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:05:30,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:05:30,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:05:30,353 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:05:30,353 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:05:30,353 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:05:30,353 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:05:30,353 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:05:30,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:05:30,354 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:05:30,354 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:05:30,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:05:30,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:05:30,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:05:30,354 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:05:30,354 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:05:30,354 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:05:30,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:05:30,355 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:05:30,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:05:30,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:05:30,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:05:30,355 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:05:30,355 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:05:30,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:05:30,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:05:30,356 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:05:30,356 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:05:30,356 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:05:30,357 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:05:30,357 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:05:30,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:05:30,357 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:05:30,357 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:05:30,358 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:05:30,390 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:05:30,399 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:05:30,403 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:05:30,404 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:05:30,405 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:05:30,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_dsw_true-valid-memsafety_false-termination.i [2018-01-24 12:05:30,572 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:05:30,577 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:05:30,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:05:30,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:05:30,583 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:05:30,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:05:30" (1/1) ... [2018-01-24 12:05:30,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a926555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:30, skipping insertion in model container [2018-01-24 12:05:30,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:05:30" (1/1) ... [2018-01-24 12:05:30,600 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:05:30,638 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:05:30,764 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:05:30,792 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:05:30,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:30 WrapperNode [2018-01-24 12:05:30,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:05:30,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:05:30,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:05:30,805 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:05:30,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:30" (1/1) ... [2018-01-24 12:05:30,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:30" (1/1) ... [2018-01-24 12:05:30,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:30" (1/1) ... [2018-01-24 12:05:30,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:30" (1/1) ... [2018-01-24 12:05:30,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:30" (1/1) ... [2018-01-24 12:05:30,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:30" (1/1) ... [2018-01-24 12:05:30,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:30" (1/1) ... [2018-01-24 12:05:30,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:05:30,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:05:30,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:05:30,851 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:05:30,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:30" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:05:30,902 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:05:30,902 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:05:30,903 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:05:30,903 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:05:30,903 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:05:30,903 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:05:30,903 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:05:30,903 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:05:30,903 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:05:30,904 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:05:30,904 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:05:30,904 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:05:30,904 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:05:30,904 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:05:31,457 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:05:31,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:05:31 BoogieIcfgContainer [2018-01-24 12:05:31,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:05:31,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:05:31,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:05:31,461 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:05:31,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:05:30" (1/3) ... [2018-01-24 12:05:31,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468e66e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:05:31, skipping insertion in model container [2018-01-24 12:05:31,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:30" (2/3) ... [2018-01-24 12:05:31,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468e66e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:05:31, skipping insertion in model container [2018-01-24 12:05:31,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:05:31" (3/3) ... [2018-01-24 12:05:31,465 INFO L105 eAbstractionObserver]: Analyzing ICFG tree_dsw_true-valid-memsafety_false-termination.i [2018-01-24 12:05:31,471 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:05:31,478 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-01-24 12:05:31,518 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:05:31,518 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:05:31,518 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:05:31,519 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:05:31,519 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:05:31,519 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:05:31,519 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:05:31,519 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:05:31,520 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:05:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2018-01-24 12:05:31,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:05:31,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:31,545 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:31,546 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:31,549 INFO L82 PathProgramCache]: Analyzing trace with hash -985735074, now seen corresponding path program 1 times [2018-01-24 12:05:31,551 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:31,551 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:31,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:31,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:31,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:31,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:31,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:31,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:05:31,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:05:31,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:05:31,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:05:31,698 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 4 states. [2018-01-24 12:05:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:32,044 INFO L93 Difference]: Finished difference Result 348 states and 384 transitions. [2018-01-24 12:05:32,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:05:32,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:05:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:32,059 INFO L225 Difference]: With dead ends: 348 [2018-01-24 12:05:32,059 INFO L226 Difference]: Without dead ends: 183 [2018-01-24 12:05:32,064 INFO L525 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-01-24 12:05:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-24 12:05:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2018-01-24 12:05:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-24 12:05:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2018-01-24 12:05:32,103 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 8 [2018-01-24 12:05:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:32,104 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2018-01-24 12:05:32,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:05:32,104 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2018-01-24 12:05:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:05:32,104 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:32,104 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:32,104 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:32,105 INFO L82 PathProgramCache]: Analyzing trace with hash -985735073, now seen corresponding path program 1 times [2018-01-24 12:05:32,105 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:32,105 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:32,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:32,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:32,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:32,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:32,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:32,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:32,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:05:32,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:05:32,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:05:32,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:05:32,195 INFO L87 Difference]: Start difference. First operand 168 states and 181 transitions. Second operand 4 states. [2018-01-24 12:05:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:32,364 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2018-01-24 12:05:32,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:05:32,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:05:32,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:32,367 INFO L225 Difference]: With dead ends: 168 [2018-01-24 12:05:32,368 INFO L226 Difference]: Without dead ends: 166 [2018-01-24 12:05:32,369 INFO L525 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-01-24 12:05:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-24 12:05:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-01-24 12:05:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-01-24 12:05:32,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2018-01-24 12:05:32,382 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 8 [2018-01-24 12:05:32,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:32,382 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2018-01-24 12:05:32,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:05:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2018-01-24 12:05:32,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:05:32,383 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:32,383 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:32,384 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:32,384 INFO L82 PathProgramCache]: Analyzing trace with hash 473226571, now seen corresponding path program 1 times [2018-01-24 12:05:32,384 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:32,384 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:32,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:32,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:32,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:32,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:32,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:32,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:05:32,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:05:32,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:05:32,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:05:32,433 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand 4 states. [2018-01-24 12:05:32,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:32,606 INFO L93 Difference]: Finished difference Result 200 states and 217 transitions. [2018-01-24 12:05:32,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:05:32,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 12:05:32,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:32,608 INFO L225 Difference]: With dead ends: 200 [2018-01-24 12:05:32,609 INFO L226 Difference]: Without dead ends: 180 [2018-01-24 12:05:32,609 INFO L525 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-01-24 12:05:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-24 12:05:32,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 153. [2018-01-24 12:05:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-24 12:05:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2018-01-24 12:05:32,623 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 14 [2018-01-24 12:05:32,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:32,623 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2018-01-24 12:05:32,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:05:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2018-01-24 12:05:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:05:32,624 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:32,624 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:32,624 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:32,624 INFO L82 PathProgramCache]: Analyzing trace with hash 473226572, now seen corresponding path program 1 times [2018-01-24 12:05:32,625 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:32,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:32,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:32,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:32,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:32,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:32,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:32,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:05:32,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:05:32,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:05:32,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:05:32,713 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand 5 states. [2018-01-24 12:05:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:32,918 INFO L93 Difference]: Finished difference Result 227 states and 250 transitions. [2018-01-24 12:05:32,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:05:32,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 12:05:32,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:32,960 INFO L225 Difference]: With dead ends: 227 [2018-01-24 12:05:32,960 INFO L226 Difference]: Without dead ends: 211 [2018-01-24 12:05:32,961 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:05:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-24 12:05:32,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 188. [2018-01-24 12:05:32,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-24 12:05:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 215 transitions. [2018-01-24 12:05:32,976 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 215 transitions. Word has length 14 [2018-01-24 12:05:32,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:32,976 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 215 transitions. [2018-01-24 12:05:32,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:05:32,977 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2018-01-24 12:05:32,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:05:32,978 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:32,978 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:32,978 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:32,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1727604301, now seen corresponding path program 1 times [2018-01-24 12:05:32,978 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:32,979 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:32,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:32,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:32,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:32,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:33,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:33,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:05:33,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:05:33,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:05:33,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:05:33,047 INFO L87 Difference]: Start difference. First operand 188 states and 215 transitions. Second operand 7 states. [2018-01-24 12:05:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:33,222 INFO L93 Difference]: Finished difference Result 310 states and 342 transitions. [2018-01-24 12:05:33,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:05:33,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-24 12:05:33,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:33,223 INFO L225 Difference]: With dead ends: 310 [2018-01-24 12:05:33,224 INFO L226 Difference]: Without dead ends: 249 [2018-01-24 12:05:33,225 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:05:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-01-24 12:05:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 189. [2018-01-24 12:05:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-24 12:05:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 216 transitions. [2018-01-24 12:05:33,234 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 216 transitions. Word has length 18 [2018-01-24 12:05:33,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:33,234 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 216 transitions. [2018-01-24 12:05:33,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:05:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 216 transitions. [2018-01-24 12:05:33,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 12:05:33,235 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:33,235 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:33,235 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:33,235 INFO L82 PathProgramCache]: Analyzing trace with hash 471570443, now seen corresponding path program 1 times [2018-01-24 12:05:33,235 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:33,235 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:33,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:33,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:33,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:33,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:33,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:33,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:05:33,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:05:33,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:05:33,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:05:33,281 INFO L87 Difference]: Start difference. First operand 189 states and 216 transitions. Second operand 5 states. [2018-01-24 12:05:33,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:33,431 INFO L93 Difference]: Finished difference Result 266 states and 295 transitions. [2018-01-24 12:05:33,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:05:33,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-24 12:05:33,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:33,433 INFO L225 Difference]: With dead ends: 266 [2018-01-24 12:05:33,433 INFO L226 Difference]: Without dead ends: 207 [2018-01-24 12:05:33,433 INFO L525 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-01-24 12:05:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-24 12:05:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 188. [2018-01-24 12:05:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-24 12:05:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 214 transitions. [2018-01-24 12:05:33,442 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 214 transitions. Word has length 21 [2018-01-24 12:05:33,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:33,442 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 214 transitions. [2018-01-24 12:05:33,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:05:33,443 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 214 transitions. [2018-01-24 12:05:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:05:33,444 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:33,444 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:33,444 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:33,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1608607228, now seen corresponding path program 1 times [2018-01-24 12:05:33,444 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:33,444 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:33,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:33,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:33,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:33,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:33,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:33,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:33,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:05:33,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:05:33,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:05:33,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:05:33,487 INFO L87 Difference]: Start difference. First operand 188 states and 214 transitions. Second operand 3 states. [2018-01-24 12:05:33,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:33,502 INFO L93 Difference]: Finished difference Result 369 states and 423 transitions. [2018-01-24 12:05:33,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:05:33,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-24 12:05:33,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:33,503 INFO L225 Difference]: With dead ends: 369 [2018-01-24 12:05:33,504 INFO L226 Difference]: Without dead ends: 190 [2018-01-24 12:05:33,505 INFO L525 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-01-24 12:05:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-24 12:05:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-01-24 12:05:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-01-24 12:05:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2018-01-24 12:05:33,514 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 22 [2018-01-24 12:05:33,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:33,514 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2018-01-24 12:05:33,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:05:33,514 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2018-01-24 12:05:33,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:05:33,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:33,515 INFO L322 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] [2018-01-24 12:05:33,515 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:33,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1343010439, now seen corresponding path program 1 times [2018-01-24 12:05:33,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:33,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:33,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:33,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:33,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:33,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:33,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:33,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:05:33,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:05:33,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:05:33,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:05:33,637 INFO L87 Difference]: Start difference. First operand 190 states and 216 transitions. Second operand 6 states. [2018-01-24 12:05:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:33,902 INFO L93 Difference]: Finished difference Result 419 states and 479 transitions. [2018-01-24 12:05:33,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:05:33,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 12:05:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:33,904 INFO L225 Difference]: With dead ends: 419 [2018-01-24 12:05:33,904 INFO L226 Difference]: Without dead ends: 238 [2018-01-24 12:05:33,905 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:05:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-24 12:05:33,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 206. [2018-01-24 12:05:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-24 12:05:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 237 transitions. [2018-01-24 12:05:33,916 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 237 transitions. Word has length 24 [2018-01-24 12:05:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:33,916 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 237 transitions. [2018-01-24 12:05:33,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:05:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 237 transitions. [2018-01-24 12:05:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:05:33,917 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:33,918 INFO L322 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] [2018-01-24 12:05:33,918 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:33,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1202174280, now seen corresponding path program 1 times [2018-01-24 12:05:33,918 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:33,918 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:33,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:33,919 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:33,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:33,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:33,967 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:33,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:05:33,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:05:33,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:05:33,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:05:33,968 INFO L87 Difference]: Start difference. First operand 206 states and 237 transitions. Second operand 5 states. [2018-01-24 12:05:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:34,230 INFO L93 Difference]: Finished difference Result 332 states and 384 transitions. [2018-01-24 12:05:34,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:05:34,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 12:05:34,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:34,232 INFO L225 Difference]: With dead ends: 332 [2018-01-24 12:05:34,232 INFO L226 Difference]: Without dead ends: 331 [2018-01-24 12:05:34,232 INFO L525 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-01-24 12:05:34,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-01-24 12:05:34,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 205. [2018-01-24 12:05:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-01-24 12:05:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2018-01-24 12:05:34,241 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 25 [2018-01-24 12:05:34,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:34,242 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2018-01-24 12:05:34,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:05:34,242 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2018-01-24 12:05:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:05:34,243 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:34,243 INFO L322 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] [2018-01-24 12:05:34,243 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:34,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1202174281, now seen corresponding path program 1 times [2018-01-24 12:05:34,243 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:34,244 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:34,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:34,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:34,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:34,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:34,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:34,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:05:34,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:05:34,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:05:34,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:05:34,388 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand 5 states. [2018-01-24 12:05:34,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:34,652 INFO L93 Difference]: Finished difference Result 365 states and 417 transitions. [2018-01-24 12:05:34,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:05:34,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 12:05:34,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:34,654 INFO L225 Difference]: With dead ends: 365 [2018-01-24 12:05:34,654 INFO L226 Difference]: Without dead ends: 364 [2018-01-24 12:05:34,655 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:05:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-01-24 12:05:34,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 204. [2018-01-24 12:05:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-24 12:05:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 233 transitions. [2018-01-24 12:05:34,667 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 233 transitions. Word has length 25 [2018-01-24 12:05:34,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:34,667 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 233 transitions. [2018-01-24 12:05:34,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:05:34,668 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 233 transitions. [2018-01-24 12:05:34,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:05:34,669 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:34,669 INFO L322 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] [2018-01-24 12:05:34,669 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:34,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2086605704, now seen corresponding path program 1 times [2018-01-24 12:05:34,670 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:34,670 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:34,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:34,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:34,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:34,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:34,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:34,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:05:34,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:05:34,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:05:34,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:05:34,725 INFO L87 Difference]: Start difference. First operand 204 states and 233 transitions. Second operand 4 states. [2018-01-24 12:05:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:34,943 INFO L93 Difference]: Finished difference Result 251 states and 284 transitions. [2018-01-24 12:05:34,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:05:34,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 12:05:34,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:34,945 INFO L225 Difference]: With dead ends: 251 [2018-01-24 12:05:34,945 INFO L226 Difference]: Without dead ends: 250 [2018-01-24 12:05:34,945 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:05:34,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-24 12:05:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 207. [2018-01-24 12:05:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-01-24 12:05:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 238 transitions. [2018-01-24 12:05:34,956 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 238 transitions. Word has length 27 [2018-01-24 12:05:34,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:34,957 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 238 transitions. [2018-01-24 12:05:34,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:05:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 238 transitions. [2018-01-24 12:05:34,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:05:34,958 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:34,958 INFO L322 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] [2018-01-24 12:05:34,958 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:34,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2086605703, now seen corresponding path program 1 times [2018-01-24 12:05:34,958 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:34,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:34,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:34,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:34,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:34,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 12:05:35,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:35,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:05:35,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:05:35,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:05:35,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:05:35,097 INFO L87 Difference]: Start difference. First operand 207 states and 238 transitions. Second operand 8 states. [2018-01-24 12:05:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:35,443 INFO L93 Difference]: Finished difference Result 321 states and 357 transitions. [2018-01-24 12:05:35,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:05:35,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-01-24 12:05:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:35,445 INFO L225 Difference]: With dead ends: 321 [2018-01-24 12:05:35,445 INFO L226 Difference]: Without dead ends: 317 [2018-01-24 12:05:35,445 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:05:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-01-24 12:05:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 211. [2018-01-24 12:05:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-24 12:05:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 244 transitions. [2018-01-24 12:05:35,459 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 244 transitions. Word has length 27 [2018-01-24 12:05:35,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:35,460 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 244 transitions. [2018-01-24 12:05:35,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:05:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 244 transitions. [2018-01-24 12:05:35,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:05:35,461 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:35,461 INFO L322 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] [2018-01-24 12:05:35,461 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:35,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2086546122, now seen corresponding path program 1 times [2018-01-24 12:05:35,464 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:35,464 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:35,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:35,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:35,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:35,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:35,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:35,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:05:35,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:05:35,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:05:35,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:05:35,579 INFO L87 Difference]: Start difference. First operand 211 states and 244 transitions. Second operand 7 states. [2018-01-24 12:05:35,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:35,842 INFO L93 Difference]: Finished difference Result 423 states and 470 transitions. [2018-01-24 12:05:35,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:05:35,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-24 12:05:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:35,844 INFO L225 Difference]: With dead ends: 423 [2018-01-24 12:05:35,844 INFO L226 Difference]: Without dead ends: 343 [2018-01-24 12:05:35,844 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:05:35,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-01-24 12:05:35,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 223. [2018-01-24 12:05:35,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-24 12:05:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 256 transitions. [2018-01-24 12:05:35,853 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 256 transitions. Word has length 27 [2018-01-24 12:05:35,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:35,853 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 256 transitions. [2018-01-24 12:05:35,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:05:35,853 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 256 transitions. [2018-01-24 12:05:35,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:05:35,854 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:35,854 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:35,854 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:35,855 INFO L82 PathProgramCache]: Analyzing trace with hash -260268355, now seen corresponding path program 1 times [2018-01-24 12:05:35,855 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:35,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:35,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:35,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:35,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:35,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:36,100 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:05:36,100 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:05:36,117 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:36,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:05:36,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:36,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:36,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:05:36,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:36,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:36,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-24 12:05:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:05:36,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:05:36,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2018-01-24 12:05:36,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:05:36,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:05:36,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:05:36,338 INFO L87 Difference]: Start difference. First operand 223 states and 256 transitions. Second operand 10 states. [2018-01-24 12:05:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:36,798 INFO L93 Difference]: Finished difference Result 400 states and 442 transitions. [2018-01-24 12:05:36,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:05:36,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-01-24 12:05:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:36,801 INFO L225 Difference]: With dead ends: 400 [2018-01-24 12:05:36,801 INFO L226 Difference]: Without dead ends: 338 [2018-01-24 12:05:36,801 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2018-01-24 12:05:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-01-24 12:05:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 221. [2018-01-24 12:05:36,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-24 12:05:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 253 transitions. [2018-01-24 12:05:36,820 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 253 transitions. Word has length 28 [2018-01-24 12:05:36,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:36,821 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 253 transitions. [2018-01-24 12:05:36,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:05:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 253 transitions. [2018-01-24 12:05:36,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:05:36,821 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:36,821 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:36,822 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:36,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1758248235, now seen corresponding path program 1 times [2018-01-24 12:05:36,822 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:36,822 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:36,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:36,823 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:36,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:36,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:37,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:37,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:05:37,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:05:37,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:05:37,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:05:37,059 INFO L87 Difference]: Start difference. First operand 221 states and 253 transitions. Second operand 9 states. [2018-01-24 12:05:37,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:37,704 INFO L93 Difference]: Finished difference Result 279 states and 320 transitions. [2018-01-24 12:05:37,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:05:37,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-24 12:05:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:37,705 INFO L225 Difference]: With dead ends: 279 [2018-01-24 12:05:37,705 INFO L226 Difference]: Without dead ends: 278 [2018-01-24 12:05:37,711 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:05:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-01-24 12:05:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 220. [2018-01-24 12:05:37,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-24 12:05:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 251 transitions. [2018-01-24 12:05:37,719 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 251 transitions. Word has length 28 [2018-01-24 12:05:37,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:37,720 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 251 transitions. [2018-01-24 12:05:37,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:05:37,720 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 251 transitions. [2018-01-24 12:05:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:05:37,720 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:37,720 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:37,720 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:37,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1758248234, now seen corresponding path program 1 times [2018-01-24 12:05:37,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:37,721 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:37,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:37,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:37,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:37,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:38,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:38,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:05:38,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:05:38,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:05:38,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:05:38,201 INFO L87 Difference]: Start difference. First operand 220 states and 251 transitions. Second operand 9 states. [2018-01-24 12:05:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:38,796 INFO L93 Difference]: Finished difference Result 278 states and 318 transitions. [2018-01-24 12:05:38,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:05:38,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-24 12:05:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:38,797 INFO L225 Difference]: With dead ends: 278 [2018-01-24 12:05:38,797 INFO L226 Difference]: Without dead ends: 277 [2018-01-24 12:05:38,798 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:05:38,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-01-24 12:05:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 219. [2018-01-24 12:05:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-24 12:05:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 249 transitions. [2018-01-24 12:05:38,809 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 249 transitions. Word has length 28 [2018-01-24 12:05:38,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:38,809 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 249 transitions. [2018-01-24 12:05:38,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:05:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 249 transitions. [2018-01-24 12:05:38,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:05:38,810 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:38,810 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:38,811 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:38,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1399776421, now seen corresponding path program 1 times [2018-01-24 12:05:38,811 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:38,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:38,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:38,812 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:38,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:38,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:38,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:38,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:05:38,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:05:38,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:05:38,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:05:38,869 INFO L87 Difference]: Start difference. First operand 219 states and 249 transitions. Second operand 5 states. [2018-01-24 12:05:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:39,102 INFO L93 Difference]: Finished difference Result 348 states and 400 transitions. [2018-01-24 12:05:39,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:05:39,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 12:05:39,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:39,103 INFO L225 Difference]: With dead ends: 348 [2018-01-24 12:05:39,104 INFO L226 Difference]: Without dead ends: 347 [2018-01-24 12:05:39,104 INFO L525 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-01-24 12:05:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-01-24 12:05:39,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 218. [2018-01-24 12:05:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-24 12:05:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 247 transitions. [2018-01-24 12:05:39,116 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 247 transitions. Word has length 29 [2018-01-24 12:05:39,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:39,116 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 247 transitions. [2018-01-24 12:05:39,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:05:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 247 transitions. [2018-01-24 12:05:39,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:05:39,117 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:39,117 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:39,117 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:39,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1399776422, now seen corresponding path program 1 times [2018-01-24 12:05:39,118 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:39,118 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:39,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:39,119 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:39,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:39,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:39,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:39,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:05:39,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:05:39,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:05:39,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:05:39,180 INFO L87 Difference]: Start difference. First operand 218 states and 247 transitions. Second operand 5 states. [2018-01-24 12:05:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:39,461 INFO L93 Difference]: Finished difference Result 381 states and 433 transitions. [2018-01-24 12:05:39,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:05:39,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 12:05:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:39,464 INFO L225 Difference]: With dead ends: 381 [2018-01-24 12:05:39,464 INFO L226 Difference]: Without dead ends: 380 [2018-01-24 12:05:39,464 INFO L525 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-01-24 12:05:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-01-24 12:05:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 217. [2018-01-24 12:05:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-01-24 12:05:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 245 transitions. [2018-01-24 12:05:39,476 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 245 transitions. Word has length 29 [2018-01-24 12:05:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:39,476 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 245 transitions. [2018-01-24 12:05:39,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:05:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 245 transitions. [2018-01-24 12:05:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 12:05:39,477 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:39,477 INFO L322 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] [2018-01-24 12:05:39,477 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash 901972539, now seen corresponding path program 1 times [2018-01-24 12:05:39,478 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:39,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:39,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:39,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:39,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:39,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:39,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:39,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:05:39,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:05:39,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:05:39,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:05:39,620 INFO L87 Difference]: Start difference. First operand 217 states and 245 transitions. Second operand 9 states. [2018-01-24 12:05:40,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:40,122 INFO L93 Difference]: Finished difference Result 245 states and 276 transitions. [2018-01-24 12:05:40,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:05:40,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-24 12:05:40,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:40,124 INFO L225 Difference]: With dead ends: 245 [2018-01-24 12:05:40,124 INFO L226 Difference]: Without dead ends: 244 [2018-01-24 12:05:40,124 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:05:40,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-01-24 12:05:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 216. [2018-01-24 12:05:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-24 12:05:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 244 transitions. [2018-01-24 12:05:40,135 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 244 transitions. Word has length 32 [2018-01-24 12:05:40,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:40,136 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 244 transitions. [2018-01-24 12:05:40,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:05:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 244 transitions. [2018-01-24 12:05:40,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 12:05:40,136 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:40,136 INFO L322 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] [2018-01-24 12:05:40,137 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:40,137 INFO L82 PathProgramCache]: Analyzing trace with hash 901972538, now seen corresponding path program 1 times [2018-01-24 12:05:40,137 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:40,137 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:40,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:40,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:40,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:40,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:40,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:40,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:05:40,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:05:40,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:05:40,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:05:40,236 INFO L87 Difference]: Start difference. First operand 216 states and 244 transitions. Second operand 9 states. [2018-01-24 12:05:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:40,873 INFO L93 Difference]: Finished difference Result 244 states and 275 transitions. [2018-01-24 12:05:40,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:05:40,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-24 12:05:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:40,874 INFO L225 Difference]: With dead ends: 244 [2018-01-24 12:05:40,874 INFO L226 Difference]: Without dead ends: 243 [2018-01-24 12:05:40,875 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:05:40,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-24 12:05:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 215. [2018-01-24 12:05:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-24 12:05:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 243 transitions. [2018-01-24 12:05:40,882 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 243 transitions. Word has length 32 [2018-01-24 12:05:40,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:40,882 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 243 transitions. [2018-01-24 12:05:40,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:05:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 243 transitions. [2018-01-24 12:05:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 12:05:40,882 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:40,882 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:40,882 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:40,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1252448966, now seen corresponding path program 1 times [2018-01-24 12:05:40,883 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:40,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:40,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:40,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:40,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:40,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:41,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:05:41,045 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:05:41,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:41,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:05:41,080 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-01-24 12:05:41,082 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-01-24 12:05:41,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,088 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-01-24 12:05:41,090 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-01-24 12:05:41,090 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,095 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-01-24 12:05:41,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-01-24 12:05:41,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:41,143 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 29 [2018-01-24 12:05:41,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-01-24 12:05:41,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:41,165 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 29 [2018-01-24 12:05:41,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,180 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-01-24 12:05:41,205 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 36 treesize of output 27 [2018-01-24 12:05:41,231 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:41,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-01-24 12:05:41,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,281 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 36 treesize of output 27 [2018-01-24 12:05:41,284 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:41,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-01-24 12:05:41,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,301 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:15 [2018-01-24 12:05:41,417 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 20 treesize of output 16 [2018-01-24 12:05:41,422 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-01-24 12:05:41,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,429 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 20 treesize of output 16 [2018-01-24 12:05:41,433 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-01-24 12:05:41,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:41,437 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-01-24 12:05:41,495 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:41,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:05:41,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2018-01-24 12:05:41,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:05:41,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:05:41,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:05:41,522 INFO L87 Difference]: Start difference. First operand 215 states and 243 transitions. Second operand 12 states. [2018-01-24 12:05:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:41,904 INFO L93 Difference]: Finished difference Result 350 states and 390 transitions. [2018-01-24 12:05:41,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:05:41,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-01-24 12:05:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:41,906 INFO L225 Difference]: With dead ends: 350 [2018-01-24 12:05:41,906 INFO L226 Difference]: Without dead ends: 270 [2018-01-24 12:05:41,906 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:05:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-01-24 12:05:41,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 225. [2018-01-24 12:05:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-24 12:05:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 253 transitions. [2018-01-24 12:05:41,920 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 253 transitions. Word has length 37 [2018-01-24 12:05:41,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:41,920 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 253 transitions. [2018-01-24 12:05:41,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:05:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 253 transitions. [2018-01-24 12:05:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:05:41,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:41,921 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:41,921 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:41,921 INFO L82 PathProgramCache]: Analyzing trace with hash 126757974, now seen corresponding path program 2 times [2018-01-24 12:05:41,922 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:41,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:41,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:41,923 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:41,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:41,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:42,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:05:42,227 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:05:42,234 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:05:42,246 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:05:42,260 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:05:42,273 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:05:42,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:05:42,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:05:42,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:42,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:42,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:05:42,310 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-01-24 12:05:42,313 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-01-24 12:05:42,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:42,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:42,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:42,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-24 12:05:42,450 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 29 treesize of output 22 [2018-01-24 12:05:42,452 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:42,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 31 [2018-01-24 12:05:42,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:42,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:42,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:42,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-24 12:05:42,495 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 38 treesize of output 29 [2018-01-24 12:05:42,498 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:42,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-01-24 12:05:42,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:42,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:42,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:42,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:13 [2018-01-24 12:05:42,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-24 12:05:42,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-24 12:05:42,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:42,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:42,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:42,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-01-24 12:05:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:42,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:05:42,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2018-01-24 12:05:42,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 12:05:42,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 12:05:42,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2018-01-24 12:05:42,649 INFO L87 Difference]: Start difference. First operand 225 states and 253 transitions. Second operand 25 states. [2018-01-24 12:05:43,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:43,917 INFO L93 Difference]: Finished difference Result 367 states and 407 transitions. [2018-01-24 12:05:43,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-24 12:05:43,917 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-01-24 12:05:43,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:43,919 INFO L225 Difference]: With dead ends: 367 [2018-01-24 12:05:43,919 INFO L226 Difference]: Without dead ends: 366 [2018-01-24 12:05:43,920 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=417, Invalid=2339, Unknown=0, NotChecked=0, Total=2756 [2018-01-24 12:05:43,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-01-24 12:05:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 255. [2018-01-24 12:05:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-01-24 12:05:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 286 transitions. [2018-01-24 12:05:43,931 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 286 transitions. Word has length 47 [2018-01-24 12:05:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:43,931 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 286 transitions. [2018-01-24 12:05:43,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 12:05:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 286 transitions. [2018-01-24 12:05:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:05:43,932 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:43,932 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:43,932 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:43,932 INFO L82 PathProgramCache]: Analyzing trace with hash 126757975, now seen corresponding path program 1 times [2018-01-24 12:05:43,932 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:43,932 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:43,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:43,933 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:05:43,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:43,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:44,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:05:44,270 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:05:44,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:44,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:05:44,316 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-01-24 12:05:44,318 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-01-24 12:05:44,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,329 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-01-24 12:05:44,331 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-01-24 12:05:44,332 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,339 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-01-24 12:05:44,420 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-01-24 12:05:44,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:44,424 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-01-24 12:05:44,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,440 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-01-24 12:05:44,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:44,442 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-01-24 12:05:44,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,446 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:32 [2018-01-24 12:05:44,459 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:05:44,460 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 23 treesize of output 25 [2018-01-24 12:05:44,462 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 25 treesize of output 13 [2018-01-24 12:05:44,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:44,474 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 23 treesize of output 26 [2018-01-24 12:05:44,476 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 26 treesize of output 14 [2018-01-24 12:05:44,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,486 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:26 [2018-01-24 12:05:44,610 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 34 treesize of output 25 [2018-01-24 12:05:44,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:44,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-01-24 12:05:44,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-01-24 12:05:44,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:44,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, 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 29 [2018-01-24 12:05:44,631 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,634 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,641 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:52 [2018-01-24 12:05:44,671 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 36 treesize of output 27 [2018-01-24 12:05:44,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:44,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-01-24 12:05:44,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,693 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 36 treesize of output 27 [2018-01-24 12:05:44,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:44,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-01-24 12:05:44,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,706 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:22 [2018-01-24 12:05:44,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 12:05:44,759 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-01-24 12:05:44,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 12:05:44,768 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-01-24 12:05:44,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:44,773 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:14 [2018-01-24 12:05:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:44,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:05:44,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2018-01-24 12:05:44,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 12:05:44,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 12:05:44,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756 [2018-01-24 12:05:44,907 INFO L87 Difference]: Start difference. First operand 255 states and 286 transitions. Second operand 28 states. [2018-01-24 12:05:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:46,292 INFO L93 Difference]: Finished difference Result 527 states and 581 transitions. [2018-01-24 12:05:46,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-24 12:05:46,292 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2018-01-24 12:05:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:46,294 INFO L225 Difference]: With dead ends: 527 [2018-01-24 12:05:46,294 INFO L226 Difference]: Without dead ends: 437 [2018-01-24 12:05:46,295 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=409, Invalid=3623, Unknown=0, NotChecked=0, Total=4032 [2018-01-24 12:05:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-01-24 12:05:46,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 267. [2018-01-24 12:05:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-01-24 12:05:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 298 transitions. [2018-01-24 12:05:46,315 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 298 transitions. Word has length 47 [2018-01-24 12:05:46,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:46,315 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 298 transitions. [2018-01-24 12:05:46,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 12:05:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 298 transitions. [2018-01-24 12:05:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 12:05:46,316 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:46,316 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:46,316 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:46,317 INFO L82 PathProgramCache]: Analyzing trace with hash -365471073, now seen corresponding path program 1 times [2018-01-24 12:05:46,317 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:46,317 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:46,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:46,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:46,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:46,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-24 12:05:46,398 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:05:46,398 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:05:46,412 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:46,450 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:05:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-24 12:05:46,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:05:46,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-24 12:05:46,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:05:46,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:05:46,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:05:46,487 INFO L87 Difference]: Start difference. First operand 267 states and 298 transitions. Second operand 4 states. [2018-01-24 12:05:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:46,570 INFO L93 Difference]: Finished difference Result 415 states and 454 transitions. [2018-01-24 12:05:46,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:05:46,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-01-24 12:05:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:46,571 INFO L225 Difference]: With dead ends: 415 [2018-01-24 12:05:46,571 INFO L226 Difference]: Without dead ends: 354 [2018-01-24 12:05:46,572 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:05:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-01-24 12:05:46,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 270. [2018-01-24 12:05:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-01-24 12:05:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 302 transitions. [2018-01-24 12:05:46,584 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 302 transitions. Word has length 48 [2018-01-24 12:05:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:46,584 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 302 transitions. [2018-01-24 12:05:46,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:05:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 302 transitions. [2018-01-24 12:05:46,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 12:05:46,584 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:46,585 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:46,585 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:46,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1428269570, now seen corresponding path program 1 times [2018-01-24 12:05:46,585 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:46,585 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:46,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:46,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:46,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:46,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:47,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:05:47,008 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:05:47,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:47,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:05:47,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:47,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:47,139 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-01-24 12:05:47,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:47,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:47,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-01-24 12:05:47,176 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-01-24 12:05:47,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:47,180 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-01-24 12:05:47,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:47,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:47,197 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-01-24 12:05:47,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:47,199 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-01-24 12:05:47,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:47,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:47,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:47,213 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:56 [2018-01-24 12:05:47,273 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 75 treesize of output 79 [2018-01-24 12:05:47,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-24 12:05:47,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:47,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:47,303 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 41 [2018-01-24 12:05:47,305 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-01-24 12:05:47,305 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:47,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:47,323 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-01-24 12:05:47,323 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:82 [2018-01-24 12:05:47,427 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 105 treesize of output 91 [2018-01-24 12:05:47,430 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-01-24 12:05:47,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:47,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:47,460 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 55 treesize of output 48 [2018-01-24 12:05:47,467 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-01-24 12:05:47,467 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:47,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:47,490 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-01-24 12:05:47,490 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:126, output treesize:106 [2018-01-24 12:05:52,158 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 39 treesize of output 35 [2018-01-24 12:05:52,160 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-01-24 12:05:52,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:52,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:52,166 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-01-24 12:05:52,167 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:52,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:52,177 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-01-24 12:05:52,177 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:94, output treesize:59 [2018-01-24 12:05:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:52,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:05:52,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 33 [2018-01-24 12:05:52,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-24 12:05:52,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-24 12:05:52,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=890, Unknown=3, NotChecked=0, Total=1056 [2018-01-24 12:05:52,270 INFO L87 Difference]: Start difference. First operand 270 states and 302 transitions. Second operand 33 states. [2018-01-24 12:06:24,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:06:24,509 INFO L93 Difference]: Finished difference Result 573 states and 647 transitions. [2018-01-24 12:06:24,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 12:06:24,510 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48 [2018-01-24 12:06:24,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:06:24,511 INFO L225 Difference]: With dead ends: 573 [2018-01-24 12:06:24,511 INFO L226 Difference]: Without dead ends: 360 [2018-01-24 12:06:24,512 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=553, Invalid=1984, Unknown=13, NotChecked=0, Total=2550 [2018-01-24 12:06:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-01-24 12:06:24,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 293. [2018-01-24 12:06:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-01-24 12:06:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 329 transitions. [2018-01-24 12:06:24,529 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 329 transitions. Word has length 48 [2018-01-24 12:06:24,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:06:24,529 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 329 transitions. [2018-01-24 12:06:24,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-24 12:06:24,529 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 329 transitions. [2018-01-24 12:06:24,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 12:06:24,530 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:06:24,530 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:06:24,530 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:06:24,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1743211522, now seen corresponding path program 1 times [2018-01-24 12:06:24,531 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:06:24,531 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:06:24,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:06:24,532 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:06:24,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:06:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:06:24,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:06:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:06:24,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:06:24,858 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:06:24,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:06:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:06:24,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:06:24,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:06:24,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:06:24,894 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-01-24 12:06:24,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:06:24,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:06:24,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-24 12:06:24,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:06:24,929 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-01-24 12:06:24,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:06:24,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:06:24,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:06:24,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-01-24 12:06:24,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-01-24 12:06:24,987 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-01-24 12:06:24,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:06:24,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:06:24,998 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-01-24 12:06:24,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-01-24 12:06:25,045 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-01-24 12:06:25,048 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 20 treesize of output 25 [2018-01-24 12:06:25,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:06:25,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:06:25,060 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-01-24 12:06:25,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:47 [2018-01-24 12:06:31,134 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 38 treesize of output 26 [2018-01-24 12:06:31,136 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-01-24 12:06:31,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:06:31,143 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-01-24 12:06:31,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:06:31,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:06:31,150 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-01-24 12:06:31,151 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-01-24 12:06:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:06:31,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:06:31,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-24 12:06:31,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 12:06:31,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 12:06:31,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=367, Unknown=3, NotChecked=0, Total=462 [2018-01-24 12:06:31,223 INFO L87 Difference]: Start difference. First operand 293 states and 329 transitions. Second operand 22 states. Received shutdown request... [2018-01-24 12:06:35,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:06:35,467 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:06:35,472 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:06:35,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:06:35 BoogieIcfgContainer [2018-01-24 12:06:35,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:06:35,474 INFO L168 Benchmark]: Toolchain (without parser) took 64901.32 ms. Allocated memory was 304.6 MB in the beginning and 679.5 MB in the end (delta: 374.9 MB). Free memory was 263.5 MB in the beginning and 378.7 MB in the end (delta: -115.2 MB). Peak memory consumption was 259.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:06:35,475 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 304.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:06:35,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.52 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 251.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:06:35,476 INFO L168 Benchmark]: Boogie Preprocessor took 46.12 ms. Allocated memory is still 304.6 MB. Free memory was 251.6 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:06:35,476 INFO L168 Benchmark]: RCFGBuilder took 607.25 ms. Allocated memory is still 304.6 MB. Free memory was 249.6 MB in the beginning and 206.6 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:06:35,476 INFO L168 Benchmark]: TraceAbstraction took 64013.87 ms. Allocated memory was 304.6 MB in the beginning and 679.5 MB in the end (delta: 374.9 MB). Free memory was 206.6 MB in the beginning and 378.7 MB in the end (delta: -172.1 MB). Peak memory consumption was 202.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:06:35,478 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 304.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 226.52 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 251.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.12 ms. Allocated memory is still 304.6 MB. Free memory was 251.6 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 607.25 ms. Allocated memory is still 304.6 MB. Free memory was 249.6 MB in the beginning and 206.6 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64013.87 ms. Allocated memory was 304.6 MB in the beginning and 679.5 MB in the end (delta: 374.9 MB). Free memory was 206.6 MB in the beginning and 378.7 MB in the end (delta: -172.1 MB). Peak memory consumption was 202.8 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 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 685). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 685). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 7 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 24 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 75 error locations. TIMEOUT Result, 63.9s OverallTime, 26 OverallIterations, 4 TraceHistogramMax, 45.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3256 SDtfs, 9112 SDslu, 10714 SDs, 0 SdLazy, 12251 SolverSat, 774 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 20.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 680 GetRequests, 277 SyntacticMatches, 42 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2273 ImplicationChecksByTransitivity, 37.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=293occurred in iteration=25, 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, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 1789 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 1044 NumberOfCodeBlocks, 1044 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1011 ConstructedInterpolants, 34 QuantifiedInterpolants, 398957 SizeOfPredicates, 90 NumberOfNonLiveVariables, 1397 ConjunctsInSsa, 248 ConjunctsInUnsatCore, 33 InterpolantComputations, 20 PerfectInterpolantSequences, 104/325 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_dsw_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-06-35-490.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_dsw_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-06-35-490.csv Completed graceful shutdown