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_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:03:54,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:03:54,302 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:03:54,318 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:03:54,318 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:03:54,319 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:03:54,320 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:03:54,322 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:03:54,324 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:03:54,325 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:03:54,326 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:03:54,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:03:54,328 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:03:54,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:03:54,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:03:54,332 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:03:54,335 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:03:54,337 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:03:54,338 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:03:54,340 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:03:54,342 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:03:54,343 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:03:54,343 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:03:54,344 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:03:54,345 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:03:54,347 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:03:54,347 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:03:54,347 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:03:54,348 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:03:54,348 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:03:54,348 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:03:54,349 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:03:54,358 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:03:54,358 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:03:54,359 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:03:54,359 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:03:54,360 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:03:54,360 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:03:54,360 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:03:54,360 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:03:54,361 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:03:54,361 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:03:54,361 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:03:54,361 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:03:54,362 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:03:54,362 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:03:54,362 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:03:54,362 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:03:54,362 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:03:54,363 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:03:54,363 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:03:54,363 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:03:54,363 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:03:54,363 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:03:54,364 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:03:54,364 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:03:54,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:03:54,364 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:03:54,364 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:03:54,364 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:03:54,365 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:03:54,365 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:03:54,365 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:03:54,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:03:54,365 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:03:54,366 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:03:54,366 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:03:54,367 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:03:54,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:03:54,410 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:03:54,413 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:03:54,414 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:03:54,415 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:03:54,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i [2018-01-24 17:03:54,582 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:03:54,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:03:54,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:03:54,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:03:54,593 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:03:54,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:03:54" (1/1) ... [2018-01-24 17:03:54,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170f2f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:54, skipping insertion in model container [2018-01-24 17:03:54,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:03:54" (1/1) ... [2018-01-24 17:03:54,612 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:03:54,653 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:03:54,781 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:03:54,808 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:03:54,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:54 WrapperNode [2018-01-24 17:03:54,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:03:54,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:03:54,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:03:54,821 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:03:54,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:54" (1/1) ... [2018-01-24 17:03:54,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:54" (1/1) ... [2018-01-24 17:03:54,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:54" (1/1) ... [2018-01-24 17:03:54,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:54" (1/1) ... [2018-01-24 17:03:54,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:54" (1/1) ... [2018-01-24 17:03:54,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:54" (1/1) ... [2018-01-24 17:03:54,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:54" (1/1) ... [2018-01-24 17:03:54,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:03:54,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:03:54,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:03:54,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:03:54,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:54" (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 17:03:54,922 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:03:54,923 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:03:54,923 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:03:54,923 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:03:54,923 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:03:54,923 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:03:54,923 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:03:54,924 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:03:54,924 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:03:54,924 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:03:54,924 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:03:54,924 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:03:54,924 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:03:54,925 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:03:55,672 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:03:55,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:03:55 BoogieIcfgContainer [2018-01-24 17:03:55,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:03:55,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:03:55,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:03:55,677 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:03:55,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:03:54" (1/3) ... [2018-01-24 17:03:55,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b15900e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:03:55, skipping insertion in model container [2018-01-24 17:03:55,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:54" (2/3) ... [2018-01-24 17:03:55,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b15900e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:03:55, skipping insertion in model container [2018-01-24 17:03:55,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:03:55" (3/3) ... [2018-01-24 17:03:55,682 INFO L105 eAbstractionObserver]: Analyzing ICFG tree_of_cslls_true-valid-memsafety.i [2018-01-24 17:03:55,692 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:03:55,700 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-01-24 17:03:55,744 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:03:55,744 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:03:55,745 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:03:55,745 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:03:55,745 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:03:55,745 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:03:55,745 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:03:55,745 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:03:55,746 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:03:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states. [2018-01-24 17:03:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 17:03:55,774 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:55,775 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:03:55,776 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:03:55,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1603684078, now seen corresponding path program 1 times [2018-01-24 17:03:55,784 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:55,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:55,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:55,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:55,839 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:55,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:55,965 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 17:03:55,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:55,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:03:55,967 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:55,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:03:55,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:03:55,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:03:55,989 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 4 states. [2018-01-24 17:03:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:56,688 INFO L93 Difference]: Finished difference Result 503 states and 561 transitions. [2018-01-24 17:03:56,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:03:56,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 17:03:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:56,700 INFO L225 Difference]: With dead ends: 503 [2018-01-24 17:03:56,700 INFO L226 Difference]: Without dead ends: 321 [2018-01-24 17:03:56,704 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 17:03:56,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-01-24 17:03:56,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 208. [2018-01-24 17:03:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-24 17:03:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 224 transitions. [2018-01-24 17:03:56,745 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 224 transitions. Word has length 8 [2018-01-24 17:03:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:56,745 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 224 transitions. [2018-01-24 17:03:56,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:03:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 224 transitions. [2018-01-24 17:03:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 17:03:56,746 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:56,746 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:03:56,746 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:03:56,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1603684077, now seen corresponding path program 1 times [2018-01-24 17:03:56,746 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:56,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:56,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:56,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:56,747 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:56,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:56,825 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 17:03:56,825 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:56,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:03:56,826 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:56,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:03:56,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:03:56,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:03:56,828 INFO L87 Difference]: Start difference. First operand 208 states and 224 transitions. Second operand 4 states. [2018-01-24 17:03:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:57,064 INFO L93 Difference]: Finished difference Result 208 states and 224 transitions. [2018-01-24 17:03:57,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:03:57,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 17:03:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:57,066 INFO L225 Difference]: With dead ends: 208 [2018-01-24 17:03:57,066 INFO L226 Difference]: Without dead ends: 206 [2018-01-24 17:03:57,066 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 17:03:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-24 17:03:57,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-01-24 17:03:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-24 17:03:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 222 transitions. [2018-01-24 17:03:57,077 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 222 transitions. Word has length 8 [2018-01-24 17:03:57,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:57,077 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 222 transitions. [2018-01-24 17:03:57,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:03:57,077 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2018-01-24 17:03:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 17:03:57,078 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:57,078 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:03:57,079 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:03:57,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1863813244, now seen corresponding path program 1 times [2018-01-24 17:03:57,080 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:57,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:57,080 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:57,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:57,081 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:57,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:57,151 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 17:03:57,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:57,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:03:57,152 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:57,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:03:57,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:03:57,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:03:57,153 INFO L87 Difference]: Start difference. First operand 206 states and 222 transitions. Second operand 5 states. [2018-01-24 17:03:57,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:57,517 INFO L93 Difference]: Finished difference Result 362 states and 390 transitions. [2018-01-24 17:03:57,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:03:57,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-24 17:03:57,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:57,520 INFO L225 Difference]: With dead ends: 362 [2018-01-24 17:03:57,520 INFO L226 Difference]: Without dead ends: 355 [2018-01-24 17:03:57,520 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:03:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-01-24 17:03:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 199. [2018-01-24 17:03:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-24 17:03:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2018-01-24 17:03:57,533 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 11 [2018-01-24 17:03:57,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:57,533 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2018-01-24 17:03:57,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:03:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2018-01-24 17:03:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 17:03:57,534 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:57,534 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:03:57,534 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:03:57,534 INFO L82 PathProgramCache]: Analyzing trace with hash -476893285, now seen corresponding path program 1 times [2018-01-24 17:03:57,535 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:57,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:57,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:57,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:57,536 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:57,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:57,588 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 17:03:57,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:57,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:03:57,609 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:57,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:03:57,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:03:57,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:03:57,610 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand 5 states. [2018-01-24 17:03:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:57,839 INFO L93 Difference]: Finished difference Result 275 states and 297 transitions. [2018-01-24 17:03:57,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:03:57,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 17:03:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:57,841 INFO L225 Difference]: With dead ends: 275 [2018-01-24 17:03:57,841 INFO L226 Difference]: Without dead ends: 274 [2018-01-24 17:03:57,842 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 17:03:57,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-01-24 17:03:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 198. [2018-01-24 17:03:57,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-24 17:03:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2018-01-24 17:03:57,852 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 14 [2018-01-24 17:03:57,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:57,852 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2018-01-24 17:03:57,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:03:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2018-01-24 17:03:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 17:03:57,853 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:57,853 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:03:57,853 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:03:57,853 INFO L82 PathProgramCache]: Analyzing trace with hash -476893284, now seen corresponding path program 1 times [2018-01-24 17:03:57,853 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:57,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:57,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:57,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:57,855 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:57,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:57,917 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 17:03:57,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:57,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:03:57,918 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:57,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:03:57,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:03:57,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:03:57,919 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 5 states. [2018-01-24 17:03:58,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:58,178 INFO L93 Difference]: Finished difference Result 316 states and 346 transitions. [2018-01-24 17:03:58,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:03:58,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 17:03:58,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:58,180 INFO L225 Difference]: With dead ends: 316 [2018-01-24 17:03:58,180 INFO L226 Difference]: Without dead ends: 315 [2018-01-24 17:03:58,181 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:03:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-01-24 17:03:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 197. [2018-01-24 17:03:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-24 17:03:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2018-01-24 17:03:58,191 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 14 [2018-01-24 17:03:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:58,191 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2018-01-24 17:03:58,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:03:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2018-01-24 17:03:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 17:03:58,192 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:58,193 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] [2018-01-24 17:03:58,193 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:03:58,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1521405160, now seen corresponding path program 1 times [2018-01-24 17:03:58,193 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:58,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:58,194 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:58,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:58,194 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:58,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:58,367 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 17:03:58,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:58,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:03:58,367 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:58,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:03:58,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:03:58,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:03:58,368 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand 8 states. [2018-01-24 17:03:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:59,184 INFO L93 Difference]: Finished difference Result 370 states and 406 transitions. [2018-01-24 17:03:59,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:03:59,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-24 17:03:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:59,186 INFO L225 Difference]: With dead ends: 370 [2018-01-24 17:03:59,186 INFO L226 Difference]: Without dead ends: 369 [2018-01-24 17:03:59,187 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:03:59,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-01-24 17:03:59,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 204. [2018-01-24 17:03:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-24 17:03:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 222 transitions. [2018-01-24 17:03:59,193 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 222 transitions. Word has length 22 [2018-01-24 17:03:59,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:59,194 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 222 transitions. [2018-01-24 17:03:59,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:03:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 222 transitions. [2018-01-24 17:03:59,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 17:03:59,194 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:59,194 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] [2018-01-24 17:03:59,194 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:03:59,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1521405161, now seen corresponding path program 1 times [2018-01-24 17:03:59,195 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:59,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:59,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:59,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:59,196 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:59,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:59,492 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 17:03:59,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:59,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:03:59,492 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:59,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:03:59,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:03:59,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:03:59,493 INFO L87 Difference]: Start difference. First operand 204 states and 222 transitions. Second operand 8 states. [2018-01-24 17:04:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:04:00,168 INFO L93 Difference]: Finished difference Result 556 states and 612 transitions. [2018-01-24 17:04:00,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:04:00,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-24 17:04:00,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:04:00,171 INFO L225 Difference]: With dead ends: 556 [2018-01-24 17:04:00,171 INFO L226 Difference]: Without dead ends: 555 [2018-01-24 17:04:00,172 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:04:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-01-24 17:04:00,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 204. [2018-01-24 17:04:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-24 17:04:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 221 transitions. [2018-01-24 17:04:00,181 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 221 transitions. Word has length 22 [2018-01-24 17:04:00,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:04:00,181 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 221 transitions. [2018-01-24 17:04:00,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:04:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 221 transitions. [2018-01-24 17:04:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:04:00,182 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:04:00,182 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] [2018-01-24 17:04:00,183 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:04:00,183 INFO L82 PathProgramCache]: Analyzing trace with hash -115400475, now seen corresponding path program 1 times [2018-01-24 17:04:00,183 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:04:00,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:00,183 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:00,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:00,184 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:04:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:00,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:04:00,249 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 17:04:00,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:04:00,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:04:00,249 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:04:00,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:04:00,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:04:00,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:04:00,250 INFO L87 Difference]: Start difference. First operand 204 states and 221 transitions. Second operand 4 states. [2018-01-24 17:04:00,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:04:00,448 INFO L93 Difference]: Finished difference Result 291 states and 324 transitions. [2018-01-24 17:04:00,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:04:00,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-24 17:04:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:04:00,449 INFO L225 Difference]: With dead ends: 291 [2018-01-24 17:04:00,449 INFO L226 Difference]: Without dead ends: 273 [2018-01-24 17:04:00,450 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 17:04:00,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-01-24 17:04:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 197. [2018-01-24 17:04:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-24 17:04:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2018-01-24 17:04:00,458 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 23 [2018-01-24 17:04:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:04:00,458 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2018-01-24 17:04:00,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:04:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2018-01-24 17:04:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:04:00,459 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:04:00,459 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] [2018-01-24 17:04:00,459 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:04:00,459 INFO L82 PathProgramCache]: Analyzing trace with hash -115400474, now seen corresponding path program 1 times [2018-01-24 17:04:00,459 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:04:00,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:00,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:00,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:00,460 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:04:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:00,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:04:00,531 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 17:04:00,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:04:00,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:04:00,531 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:04:00,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:04:00,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:04:00,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:04:00,532 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand 6 states. [2018-01-24 17:04:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:04:00,813 INFO L93 Difference]: Finished difference Result 483 states and 546 transitions. [2018-01-24 17:04:00,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:04:00,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 17:04:00,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:04:00,816 INFO L225 Difference]: With dead ends: 483 [2018-01-24 17:04:00,816 INFO L226 Difference]: Without dead ends: 464 [2018-01-24 17:04:00,816 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:04:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-01-24 17:04:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 346. [2018-01-24 17:04:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-01-24 17:04:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 473 transitions. [2018-01-24 17:04:00,832 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 473 transitions. Word has length 23 [2018-01-24 17:04:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:04:00,832 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 473 transitions. [2018-01-24 17:04:00,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:04:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 473 transitions. [2018-01-24 17:04:00,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:04:00,833 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:04:00,834 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] [2018-01-24 17:04:00,834 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:04:00,834 INFO L82 PathProgramCache]: Analyzing trace with hash -81080279, now seen corresponding path program 1 times [2018-01-24 17:04:00,834 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:04:00,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:00,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:00,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:00,835 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:04:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:00,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:04:00,891 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 17:04:00,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:04:00,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:04:00,892 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:04:00,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:04:00,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:04:00,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:04:00,893 INFO L87 Difference]: Start difference. First operand 346 states and 473 transitions. Second operand 4 states. [2018-01-24 17:04:01,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:04:01,188 INFO L93 Difference]: Finished difference Result 702 states and 999 transitions. [2018-01-24 17:04:01,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:04:01,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-24 17:04:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:04:01,193 INFO L225 Difference]: With dead ends: 702 [2018-01-24 17:04:01,193 INFO L226 Difference]: Without dead ends: 701 [2018-01-24 17:04:01,193 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:04:01,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-01-24 17:04:01,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 345. [2018-01-24 17:04:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-01-24 17:04:01,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 472 transitions. [2018-01-24 17:04:01,212 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 472 transitions. Word has length 23 [2018-01-24 17:04:01,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:04:01,212 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 472 transitions. [2018-01-24 17:04:01,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:04:01,213 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 472 transitions. [2018-01-24 17:04:01,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:04:01,213 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:04:01,214 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] [2018-01-24 17:04:01,214 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:04:01,214 INFO L82 PathProgramCache]: Analyzing trace with hash -81080280, now seen corresponding path program 1 times [2018-01-24 17:04:01,214 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:04:01,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:01,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:01,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:01,215 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:04:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:01,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:04:01,245 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 17:04:01,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:04:01,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:04:01,245 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:04:01,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:04:01,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:04:01,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:04:01,246 INFO L87 Difference]: Start difference. First operand 345 states and 472 transitions. Second operand 4 states. [2018-01-24 17:04:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:04:01,581 INFO L93 Difference]: Finished difference Result 863 states and 1197 transitions. [2018-01-24 17:04:01,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:04:01,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-24 17:04:01,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:04:01,586 INFO L225 Difference]: With dead ends: 863 [2018-01-24 17:04:01,586 INFO L226 Difference]: Without dead ends: 861 [2018-01-24 17:04:01,587 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:04:01,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-24 17:04:01,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 343. [2018-01-24 17:04:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-01-24 17:04:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 467 transitions. [2018-01-24 17:04:01,610 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 467 transitions. Word has length 23 [2018-01-24 17:04:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:04:01,610 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 467 transitions. [2018-01-24 17:04:01,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:04:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 467 transitions. [2018-01-24 17:04:01,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 17:04:01,611 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:04:01,611 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 17:04:01,611 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:04:01,612 INFO L82 PathProgramCache]: Analyzing trace with hash 771701702, now seen corresponding path program 1 times [2018-01-24 17:04:01,612 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:04:01,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:01,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:01,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:01,613 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:04:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:01,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:04:01,646 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 17:04:01,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:04:01,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:04:01,646 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:04:01,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:04:01,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:04:01,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:04:01,647 INFO L87 Difference]: Start difference. First operand 343 states and 467 transitions. Second operand 4 states. [2018-01-24 17:04:01,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:04:01,705 INFO L93 Difference]: Finished difference Result 416 states and 547 transitions. [2018-01-24 17:04:01,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:04:01,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-24 17:04:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:04:01,708 INFO L225 Difference]: With dead ends: 416 [2018-01-24 17:04:01,708 INFO L226 Difference]: Without dead ends: 413 [2018-01-24 17:04:01,708 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:04:01,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-01-24 17:04:01,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 382. [2018-01-24 17:04:01,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-01-24 17:04:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 541 transitions. [2018-01-24 17:04:01,737 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 541 transitions. Word has length 25 [2018-01-24 17:04:01,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:04:01,737 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 541 transitions. [2018-01-24 17:04:01,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:04:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 541 transitions. [2018-01-24 17:04:01,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 17:04:01,739 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:04:01,739 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] [2018-01-24 17:04:01,739 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:04:01,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1690982226, now seen corresponding path program 1 times [2018-01-24 17:04:01,739 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:04:01,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:01,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:01,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:01,741 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:04:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:01,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:04:01,864 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 17:04:01,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:04:01,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:04:01,865 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:04:01,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:04:01,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:04:01,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:04:01,866 INFO L87 Difference]: Start difference. First operand 382 states and 541 transitions. Second operand 9 states. [2018-01-24 17:04:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:04:02,853 INFO L93 Difference]: Finished difference Result 1252 states and 1783 transitions. [2018-01-24 17:04:02,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 17:04:02,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-24 17:04:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:04:02,857 INFO L225 Difference]: With dead ends: 1252 [2018-01-24 17:04:02,857 INFO L226 Difference]: Without dead ends: 1251 [2018-01-24 17:04:02,858 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-01-24 17:04:02,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2018-01-24 17:04:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 381. [2018-01-24 17:04:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-01-24 17:04:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 540 transitions. [2018-01-24 17:04:02,875 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 540 transitions. Word has length 26 [2018-01-24 17:04:02,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:04:02,875 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 540 transitions. [2018-01-24 17:04:02,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:04:02,875 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 540 transitions. [2018-01-24 17:04:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 17:04:02,876 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:04:02,876 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] [2018-01-24 17:04:02,876 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:04:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1690982225, now seen corresponding path program 1 times [2018-01-24 17:04:02,876 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:04:02,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:02,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:02,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:02,878 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:04:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:02,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:04:03,059 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 17:04:03,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:04:03,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:04:03,060 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:04:03,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:04:03,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:04:03,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:04:03,061 INFO L87 Difference]: Start difference. First operand 381 states and 540 transitions. Second operand 9 states. [2018-01-24 17:04:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:04:04,012 INFO L93 Difference]: Finished difference Result 1251 states and 1782 transitions. [2018-01-24 17:04:04,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 17:04:04,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-24 17:04:04,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:04:04,017 INFO L225 Difference]: With dead ends: 1251 [2018-01-24 17:04:04,017 INFO L226 Difference]: Without dead ends: 1250 [2018-01-24 17:04:04,017 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-01-24 17:04:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-01-24 17:04:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 380. [2018-01-24 17:04:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-01-24 17:04:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 539 transitions. [2018-01-24 17:04:04,032 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 539 transitions. Word has length 26 [2018-01-24 17:04:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:04:04,032 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 539 transitions. [2018-01-24 17:04:04,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:04:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 539 transitions. [2018-01-24 17:04:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 17:04:04,033 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:04:04,033 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] [2018-01-24 17:04:04,034 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:04:04,034 INFO L82 PathProgramCache]: Analyzing trace with hash -679017658, now seen corresponding path program 1 times [2018-01-24 17:04:04,034 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:04:04,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:04,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:04,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:04,035 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:04:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:04,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:04:04,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 17:04:04,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:04:04,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:04:04,059 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:04:04,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:04:04,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:04:04,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:04:04,059 INFO L87 Difference]: Start difference. First operand 380 states and 539 transitions. Second operand 3 states. [2018-01-24 17:04:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:04:04,081 INFO L93 Difference]: Finished difference Result 589 states and 875 transitions. [2018-01-24 17:04:04,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:04:04,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-01-24 17:04:04,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:04:04,083 INFO L225 Difference]: With dead ends: 589 [2018-01-24 17:04:04,083 INFO L226 Difference]: Without dead ends: 384 [2018-01-24 17:04:04,084 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 17:04:04,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-01-24 17:04:04,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2018-01-24 17:04:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-01-24 17:04:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 543 transitions. [2018-01-24 17:04:04,096 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 543 transitions. Word has length 30 [2018-01-24 17:04:04,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:04:04,097 INFO L432 AbstractCegarLoop]: Abstraction has 384 states and 543 transitions. [2018-01-24 17:04:04,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:04:04,097 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 543 transitions. [2018-01-24 17:04:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 17:04:04,097 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:04:04,097 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, 1, 1, 1] [2018-01-24 17:04:04,098 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:04:04,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1240786582, now seen corresponding path program 1 times [2018-01-24 17:04:04,098 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:04:04,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:04,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:04,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:04,099 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:04:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:04,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:04:04,117 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 17:04:04,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:04:04,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:04:04,117 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:04:04,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:04:04,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:04:04,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:04:04,118 INFO L87 Difference]: Start difference. First operand 384 states and 543 transitions. Second operand 3 states. [2018-01-24 17:04:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:04:04,157 INFO L93 Difference]: Finished difference Result 735 states and 1054 transitions. [2018-01-24 17:04:04,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:04:04,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-01-24 17:04:04,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:04:04,159 INFO L225 Difference]: With dead ends: 735 [2018-01-24 17:04:04,159 INFO L226 Difference]: Without dead ends: 387 [2018-01-24 17:04:04,160 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 17:04:04,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-01-24 17:04:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-01-24 17:04:04,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-01-24 17:04:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 546 transitions. [2018-01-24 17:04:04,172 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 546 transitions. Word has length 31 [2018-01-24 17:04:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:04:04,172 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 546 transitions. [2018-01-24 17:04:04,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:04:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 546 transitions. [2018-01-24 17:04:04,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 17:04:04,173 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:04:04,173 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 17:04:04,173 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:04:04,173 INFO L82 PathProgramCache]: Analyzing trace with hash 348971873, now seen corresponding path program 1 times [2018-01-24 17:04:04,173 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:04:04,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:04,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:04,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:04,174 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:04:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:04,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:04:04,199 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 17:04:04,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:04:04,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:04:04,199 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:04:04,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:04:04,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:04:04,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:04:04,200 INFO L87 Difference]: Start difference. First operand 387 states and 546 transitions. Second operand 3 states. [2018-01-24 17:04:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:04:04,272 INFO L93 Difference]: Finished difference Result 637 states and 909 transitions. [2018-01-24 17:04:04,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:04:04,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-01-24 17:04:04,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:04:04,274 INFO L225 Difference]: With dead ends: 637 [2018-01-24 17:04:04,274 INFO L226 Difference]: Without dead ends: 428 [2018-01-24 17:04:04,274 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 17:04:04,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-01-24 17:04:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 379. [2018-01-24 17:04:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-01-24 17:04:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 526 transitions. [2018-01-24 17:04:04,287 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 526 transitions. Word has length 32 [2018-01-24 17:04:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:04:04,287 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 526 transitions. [2018-01-24 17:04:04,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:04:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 526 transitions. [2018-01-24 17:04:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 17:04:04,288 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:04:04,288 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, 1, 1, 1, 1, 1] [2018-01-24 17:04:04,288 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:04:04,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1663635795, now seen corresponding path program 1 times [2018-01-24 17:04:04,288 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:04:04,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:04,289 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:04,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:04,289 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:04:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:04,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:04:04,956 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 17:04:04,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:04:04,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 17:04:04,956 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:04:04,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:04:04,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:04:04,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:04:04,957 INFO L87 Difference]: Start difference. First operand 379 states and 526 transitions. Second operand 10 states. [2018-01-24 17:04:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:04:05,736 INFO L93 Difference]: Finished difference Result 948 states and 1266 transitions. [2018-01-24 17:04:05,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 17:04:05,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-01-24 17:04:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:04:05,738 INFO L225 Difference]: With dead ends: 948 [2018-01-24 17:04:05,738 INFO L226 Difference]: Without dead ends: 605 [2018-01-24 17:04:05,739 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-01-24 17:04:05,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-01-24 17:04:05,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 396. [2018-01-24 17:04:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-01-24 17:04:05,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 548 transitions. [2018-01-24 17:04:05,768 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 548 transitions. Word has length 33 [2018-01-24 17:04:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:04:05,768 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 548 transitions. [2018-01-24 17:04:05,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:04:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 548 transitions. [2018-01-24 17:04:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 17:04:05,769 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:04:05,769 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, 1, 1, 1, 1, 1, 1] [2018-01-24 17:04:05,770 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:04:05,770 INFO L82 PathProgramCache]: Analyzing trace with hash 768774257, now seen corresponding path program 1 times [2018-01-24 17:04:05,770 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:04:05,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:05,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:05,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:05,771 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:04:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:05,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:04:06,046 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 17:04:06,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:04:06,047 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:04:06,048 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-24 17:04:06,049 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [10], [13], [14], [17], [20], [23], [26], [30], [32], [35], [62], [64], [67], [211], [217], [221], [223], [224], [226], [229], [241], [242], [247], [248], [251], [340], [341], [342] [2018-01-24 17:04:06,097 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:04:06,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:04:06,420 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:04:06,421 INFO L268 AbstractInterpreter]: Visited 33 different actions 49 times. Merged at 10 different actions 15 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 39 variables. [2018-01-24 17:04:06,436 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:04:06,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:04:06,436 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 17:04:06,449 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:06,450 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:04:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:06,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:04:06,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:04:06,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:04:06,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:06,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:06,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:04:06,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:04:06,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:06,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:06,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:06,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-24 17:04:06,735 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 17:04:06,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:06,740 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 17:04:06,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:06,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:06,765 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 17:04:06,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:06,770 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 17:04:06,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:06,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:06,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:06,797 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-01-24 17:04:06,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:06,849 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:06,850 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 17:04:06,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:06,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:06,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2018-01-24 17:04:06,945 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 30 treesize of output 23 [2018-01-24 17:04:06,963 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:06,964 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:06,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:06,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-24 17:04:06,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:06,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:07,007 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 30 treesize of output 23 [2018-01-24 17:04:07,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:07,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:07,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:07,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-24 17:04:07,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:07,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:07,047 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 17:04:07,047 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:49 [2018-01-24 17:04:07,112 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 73 treesize of output 67 [2018-01-24 17:04:07,114 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 17:04:07,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:07,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:07,138 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 17:04:07,140 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 17:04:07,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:07,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:07,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:07,155 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:95, output treesize:49 [2018-01-24 17:04:07,194 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 34 treesize of output 26 [2018-01-24 17:04:07,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:07,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:07,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:07,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-01-24 17:04:07,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:07,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:07,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-24 17:04:07,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:07,216 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 17:04:07,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:07,219 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:07,223 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 17:04:07,223 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:7 [2018-01-24 17:04:07,255 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 17:04:07,255 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:04:07,754 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:07,755 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 11 variables, input treesize:117, output treesize:1 [2018-01-24 17:04:07,764 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 17:04:07,795 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:04:07,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [13] total 30 [2018-01-24 17:04:07,795 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:04:07,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 17:04:07,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 17:04:07,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2018-01-24 17:04:07,796 INFO L87 Difference]: Start difference. First operand 396 states and 548 transitions. Second operand 12 states. [2018-01-24 17:04:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:04:09,084 INFO L93 Difference]: Finished difference Result 755 states and 996 transitions. [2018-01-24 17:04:09,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 17:04:09,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-01-24 17:04:09,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:04:09,087 INFO L225 Difference]: With dead ends: 755 [2018-01-24 17:04:09,087 INFO L226 Difference]: Without dead ends: 601 [2018-01-24 17:04:09,088 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=342, Invalid=1550, Unknown=0, NotChecked=0, Total=1892 [2018-01-24 17:04:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-01-24 17:04:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 402. [2018-01-24 17:04:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-01-24 17:04:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 554 transitions. [2018-01-24 17:04:09,109 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 554 transitions. Word has length 34 [2018-01-24 17:04:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:04:09,110 INFO L432 AbstractCegarLoop]: Abstraction has 402 states and 554 transitions. [2018-01-24 17:04:09,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 17:04:09,110 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 554 transitions. [2018-01-24 17:04:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 17:04:09,110 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:04:09,110 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:04:09,110 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:04:09,110 INFO L82 PathProgramCache]: Analyzing trace with hash -700463843, now seen corresponding path program 1 times [2018-01-24 17:04:09,110 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:04:09,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:09,111 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:09,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:09,111 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:04:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:09,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:04:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:04:09,629 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:04:09,629 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:04:09,629 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-24 17:04:09,629 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [10], [13], [14], [17], [20], [23], [26], [30], [32], [37], [38], [39], [40], [43], [44], [46], [49], [50], [53], [56], [340], [341], [342] [2018-01-24 17:04:09,631 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:04:09,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:04:09,785 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:04:09,785 INFO L268 AbstractInterpreter]: Visited 28 different actions 46 times. Merged at 13 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 35 variables. [2018-01-24 17:04:09,795 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:04:09,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:04:09,796 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 17:04:09,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:09,805 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:04:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:09,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:04:09,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:09,873 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:09,874 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 17:04:09,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:09,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:09,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-24 17:04:09,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 17:04:09,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 17:04:09,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:09,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:09,910 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 17:04:09,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-01-24 17:04:09,933 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 34 treesize of output 28 [2018-01-24 17:04:09,938 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 17:04:09,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:09,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:09,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:09,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:16 [2018-01-24 17:04:09,971 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:09,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:09,973 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 17:04:09,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:09,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:09,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-01-24 17:04:09,998 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 22 treesize of output 23 [2018-01-24 17:04:10,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:04:10,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2018-01-24 17:04:10,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-24 17:04:10,077 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 14 treesize of output 13 [2018-01-24 17:04:10,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:10,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2018-01-24 17:04:10,130 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 18 treesize of output 17 [2018-01-24 17:04:10,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:10,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:41 [2018-01-24 17:04:10,167 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 45 treesize of output 31 [2018-01-24 17:04:10,169 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 25 treesize of output 10 [2018-01-24 17:04:10,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-01-24 17:04:10,178 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,202 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-01-24 17:04:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:04:10,227 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:04:10,255 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-01-24 17:04:10,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:10,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2018-01-24 17:04:10,581 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:04:10,581 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:04:10,582 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 13 treesize of output 3 [2018-01-24 17:04:10,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,589 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-01-24 17:04:10,606 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 11 treesize of output 10 [2018-01-24 17:04:10,606 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,612 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 10 treesize of output 8 [2018-01-24 17:04:10,614 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 8 treesize of output 1 [2018-01-24 17:04:10,614 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,615 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,619 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,624 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:50, output treesize:4 [2018-01-24 17:04:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:04:10,674 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:04:10,674 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:04:10,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:10,678 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:04:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:10,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:04:10,746 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 17:04:10,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:04:10,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:10,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:10,765 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 17:04:10,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-24 17:04:10,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 17:04:10,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 17:04:10,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,782 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 17:04:10,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-01-24 17:04:10,795 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 34 treesize of output 28 [2018-01-24 17:04:10,797 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 17:04:10,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:16 [2018-01-24 17:04:10,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:10,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:10,814 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 17:04:10,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-01-24 17:04:10,874 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 22 treesize of output 23 [2018-01-24 17:04:10,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:04:10,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-01-24 17:04:10,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-24 17:04:10,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-24 17:04:10,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:10,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:56 [2018-01-24 17:04:10,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 61 [2018-01-24 17:04:10,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:10,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:61 [2018-01-24 17:04:11,009 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 60 treesize of output 38 [2018-01-24 17:04:11,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-01-24 17:04:11,011 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:11,018 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 25 treesize of output 10 [2018-01-24 17:04:11,018 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:11,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:11,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:11,029 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:65, output treesize:24 [2018-01-24 17:04:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:04:11,052 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:04:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:04:11,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:04:11,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 11, 6] total 29 [2018-01-24 17:04:11,199 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:04:11,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 17:04:11,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 17:04:11,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2018-01-24 17:04:11,200 INFO L87 Difference]: Start difference. First operand 402 states and 554 transitions. Second operand 15 states. [2018-01-24 17:04:25,506 WARN L146 SmtUtils]: Spent 4028ms on a formula simplification. DAG size of input: 44 DAG size of output 38 [2018-01-24 17:04:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:04:34,090 INFO L93 Difference]: Finished difference Result 705 states and 902 transitions. [2018-01-24 17:04:34,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 17:04:34,091 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-24 17:04:34,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:04:34,093 INFO L225 Difference]: With dead ends: 705 [2018-01-24 17:04:34,093 INFO L226 Difference]: Without dead ends: 704 [2018-01-24 17:04:34,094 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 97 SyntacticMatches, 24 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=381, Invalid=1338, Unknown=3, NotChecked=0, Total=1722 [2018-01-24 17:04:34,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-01-24 17:04:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 401. [2018-01-24 17:04:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-01-24 17:04:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 553 transitions. [2018-01-24 17:04:34,109 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 553 transitions. Word has length 34 [2018-01-24 17:04:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:04:34,109 INFO L432 AbstractCegarLoop]: Abstraction has 401 states and 553 transitions. [2018-01-24 17:04:34,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 17:04:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 553 transitions. [2018-01-24 17:04:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 17:04:34,110 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:04:34,110 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:04:34,110 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:04:34,110 INFO L82 PathProgramCache]: Analyzing trace with hash -700463842, now seen corresponding path program 1 times [2018-01-24 17:04:34,110 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:04:34,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:34,111 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:34,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:04:34,111 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:04:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:34,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:04:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:04:34,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:04:34,338 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:04:34,338 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-24 17:04:34,339 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [10], [13], [14], [17], [20], [23], [26], [30], [32], [37], [38], [39], [40], [43], [45], [46], [49], [50], [53], [56], [340], [341], [342] [2018-01-24 17:04:34,340 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:04:34,340 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:04:34,470 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:04:34,470 INFO L268 AbstractInterpreter]: Visited 28 different actions 46 times. Merged at 13 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 35 variables. [2018-01-24 17:04:34,484 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:04:34,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:04:34,484 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 17:04:34,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:34,494 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:04:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:34,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:04:34,538 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:34,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:34,540 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 17:04:34,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 17:04:34,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 17:04:34,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 17:04:34,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 17:04:34,587 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 17:04:34,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,604 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 17:04:34,604 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-01-24 17:04:34,645 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 57 treesize of output 51 [2018-01-24 17:04:34,648 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 17:04:34,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-01-24 17:04:34,669 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 17:04:34,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:71, output treesize:25 [2018-01-24 17:04:34,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:34,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:34,691 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 17:04:34,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-01-24 17:04:34,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-24 17:04:34,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:04:34,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-01-24 17:04:34,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:04:34,817 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,834 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 17:04:34,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:68, output treesize:46 [2018-01-24 17:04:34,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 73 [2018-01-24 17:04:34,871 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 14 treesize of output 13 [2018-01-24 17:04:34,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-01-24 17:04:34,899 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 17:04:34,900 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:34,914 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:92, output treesize:56 [2018-01-24 17:04:34,960 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:34,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:34,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-01-24 17:04:34,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-24 17:04:34,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:34,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:34,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:60 [2018-01-24 17:04:35,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2018-01-24 17:04:35,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-01-24 17:04:35,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:35,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2018-01-24 17:04:35,086 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:35,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:35,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 17:04:35,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-24 17:04:35,100 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:35,101 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:35,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:35,107 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:78, output treesize:18 [2018-01-24 17:04:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:04:35,164 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:04:37,654 WARN L143 SmtUtils]: Spent 2078ms on a formula simplification that was a NOOP. DAG size: 67 [2018-01-24 17:04:37,690 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:04:37,690 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:04:37,691 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 79 treesize of output 70 [2018-01-24 17:04:37,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:37,729 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 139 [2018-01-24 17:04:37,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:37,739 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 206 [2018-01-24 17:04:37,740 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 17:04:37,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2018-01-24 17:04:37,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:37,793 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:04:37,793 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:04:37,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 126 [2018-01-24 17:04:37,794 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:37,795 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:04:37,796 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:04:37,796 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 74 treesize of output 65 [2018-01-24 17:04:37,796 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:37,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2018-01-24 17:04:37,817 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:224, output treesize:184 [2018-01-24 17:04:38,270 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 17:04:38,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,302 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:04:38,303 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:04:38,303 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 17 treesize of output 8 [2018-01-24 17:04:38,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,315 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:04:38,316 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:04:38,316 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 16 treesize of output 7 [2018-01-24 17:04:38,317 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:04:38,323 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:47, output treesize:8 [2018-01-24 17:04:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:04:38,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:04:38,367 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:04:38,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:38,370 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:04:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:38,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:04:38,433 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 17:04:38,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:04:38,458 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 17:04:38,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:38,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:38,468 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 17:04:38,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-24 17:04:38,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 17:04:38,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 17:04:38,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 17:04:38,524 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 17:04:38,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,533 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 17:04:38,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:47 [2018-01-24 17:04:38,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 73 [2018-01-24 17:04:38,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-24 17:04:38,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-01-24 17:04:38,617 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 17:04:38,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,631 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:47 [2018-01-24 17:04:38,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:38,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-24 17:04:38,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:38,657 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:38,657 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:38,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-01-24 17:04:38,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:71 [2018-01-24 17:04:38,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-01-24 17:04:38,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:04:38,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-01-24 17:04:38,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:04:38,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,873 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 17:04:38,873 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:71 [2018-01-24 17:04:38,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 83 [2018-01-24 17:04:38,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-24 17:04:38,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-01-24 17:04:38,957 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 17:04:38,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:38,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:38,976 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:117, output treesize:111 [2018-01-24 17:04:39,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:39,032 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:39,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:39,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:39,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2018-01-24 17:04:39,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:39,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2018-01-24 17:04:39,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:39,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:39,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:113 [2018-01-24 17:04:39,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 62 [2018-01-24 17:04:39,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-01-24 17:04:39,198 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:39,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 18 [2018-01-24 17:04:39,212 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:39,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:39,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 17:04:39,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-24 17:04:39,239 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:39,241 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:39,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:39,253 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:131, output treesize:31 [2018-01-24 17:04:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:04:39,322 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:04:41,024 WARN L143 SmtUtils]: Spent 1287ms on a formula simplification that was a NOOP. DAG size: 73 [2018-01-24 17:04:45,143 WARN L143 SmtUtils]: Spent 2048ms on a formula simplification that was a NOOP. DAG size: 74 [2018-01-24 17:04:46,188 WARN L143 SmtUtils]: Spent 954ms on a formula simplification that was a NOOP. DAG size: 74 [2018-01-24 17:04:49,103 WARN L143 SmtUtils]: Spent 595ms on a formula simplification that was a NOOP. DAG size: 106 Received shutdown request... [2018-01-24 17:04:53,250 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 17:04:53,250 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 17:04:53,255 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 17:04:53,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:04:53 BoogieIcfgContainer [2018-01-24 17:04:53,255 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:04:53,256 INFO L168 Benchmark]: Toolchain (without parser) took 58673.03 ms. Allocated memory was 304.1 MB in the beginning and 686.8 MB in the end (delta: 382.7 MB). Free memory was 264.0 MB in the beginning and 403.7 MB in the end (delta: -139.7 MB). Peak memory consumption was 243.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:04:53,256 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 304.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:04:53,256 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.47 ms. Allocated memory is still 304.1 MB. Free memory was 262.9 MB in the beginning and 251.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:04:53,257 INFO L168 Benchmark]: Boogie Preprocessor took 47.39 ms. Allocated memory is still 304.1 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:04:53,257 INFO L168 Benchmark]: RCFGBuilder took 805.05 ms. Allocated memory is still 304.1 MB. Free memory was 249.0 MB in the beginning and 197.4 MB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:04:53,257 INFO L168 Benchmark]: TraceAbstraction took 57580.30 ms. Allocated memory was 304.1 MB in the beginning and 686.8 MB in the end (delta: 382.7 MB). Free memory was 197.4 MB in the beginning and 403.7 MB in the end (delta: -206.3 MB). Peak memory consumption was 176.5 MB. Max. memory is 5.3 GB. [2018-01-24 17:04:53,259 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.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 232.47 ms. Allocated memory is still 304.1 MB. Free memory was 262.9 MB in the beginning and 251.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.39 ms. Allocated memory is still 304.1 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 805.05 ms. Allocated memory is still 304.1 MB. Free memory was 249.0 MB in the beginning and 197.4 MB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57580.30 ms. Allocated memory was 304.1 MB in the beginning and 686.8 MB in the end (delta: 382.7 MB). Free memory was 197.4 MB in the beginning and 403.7 MB in the end (delta: -206.3 MB). Peak memory consumption was 176.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 32 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 398 LocStat_NO_SUPPORTING_DISEQUALITIES : 196 LocStat_NO_DISJUNCTIONS : -64 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 37 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 75 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.666547 RENAME_VARIABLES(MILLISECONDS) : 0.536173 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.627198 PROJECTAWAY(MILLISECONDS) : 0.556204 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001693 DISJOIN(MILLISECONDS) : 0.929635 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.571263 ADD_EQUALITY(MILLISECONDS) : 0.024837 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016587 #CONJOIN_DISJUNCTIVE : 86 #RENAME_VARIABLES : 141 #UNFREEZE : 0 #CONJOIN : 162 #PROJECTAWAY : 112 #ADD_WEAK_EQUALITY : 21 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 131 #ADD_EQUALITY : 78 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 317 LocStat_NO_SUPPORTING_DISEQUALITIES : 144 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 66 TransStat_NO_SUPPORTING_DISEQUALITIES : 14 TransStat_NO_DISJUNCTIONS : 32 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.393628 RENAME_VARIABLES(MILLISECONDS) : 0.267707 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.355399 PROJECTAWAY(MILLISECONDS) : 0.254972 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001121 DISJOIN(MILLISECONDS) : 0.786141 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.307242 ADD_EQUALITY(MILLISECONDS) : 0.029957 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.031038 #CONJOIN_DISJUNCTIVE : 78 #RENAME_VARIABLES : 119 #UNFREEZE : 0 #CONJOIN : 147 #PROJECTAWAY : 91 #ADD_WEAK_EQUALITY : 31 #DISJOIN : 5 #RENAME_VARIABLES_DISJUNCTIVE : 119 #ADD_EQUALITY : 78 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 317 LocStat_NO_SUPPORTING_DISEQUALITIES : 141 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.301957 RENAME_VARIABLES(MILLISECONDS) : 0.186404 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.259346 PROJECTAWAY(MILLISECONDS) : 0.190480 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001379 DISJOIN(MILLISECONDS) : 0.683870 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.211899 ADD_EQUALITY(MILLISECONDS) : 0.026396 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008704 #CONJOIN_DISJUNCTIVE : 78 #RENAME_VARIABLES : 121 #UNFREEZE : 0 #CONJOIN : 149 #PROJECTAWAY : 94 #ADD_WEAK_EQUALITY : 31 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 119 #ADD_EQUALITY : 80 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 220 locations, 101 error locations. TIMEOUT Result, 57.5s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 31.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3666 SDtfs, 9478 SDslu, 9583 SDs, 0 SdLazy, 8773 SolverSat, 455 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 408 GetRequests, 182 SyntacticMatches, 29 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=402occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 4578 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 564 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 640 ConstructedInterpolants, 43 QuantifiedInterpolants, 200592 SizeOfPredicates, 67 NumberOfNonLiveVariables, 477 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 16/45 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_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-04-53-275.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-04-53-275.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-04-53-275.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-04-53-275.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-04-53-275.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_17-04-53-275.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_17-04-53-275.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-04-53-275.csv Completed graceful shutdown