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/list-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:12:49,706 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:12:49,708 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:12:49,723 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:12:49,724 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:12:49,725 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:12:49,726 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:12:49,728 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:12:49,730 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:12:49,731 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:12:49,732 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:12:49,732 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:12:49,733 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:12:49,734 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:12:49,735 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:12:49,738 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:12:49,740 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:12:49,742 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:12:49,743 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:12:49,745 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:12:49,747 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:12:49,747 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:12:49,747 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:12:49,748 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:12:49,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:12:49,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:12:49,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:12:49,751 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:12:49,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:12:49,751 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:12:49,752 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:12:49,752 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:12:49,761 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:12:49,761 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:12:49,762 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:12:49,762 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:12:49,762 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:12:49,762 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:12:49,762 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:12:49,762 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:12:49,763 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:12:49,763 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:12:49,763 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:12:49,763 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:12:49,764 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:12:49,764 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:12:49,764 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:12:49,764 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:12:49,764 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:12:49,764 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:12:49,764 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:12:49,764 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:12:49,765 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:12:49,765 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:12:49,765 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:12:49,765 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:12:49,765 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:12:49,765 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:12:49,766 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:12:49,766 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:12:49,766 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:12:49,766 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:12:49,766 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:12:49,766 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:12:49,766 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:12:49,767 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:12:49,767 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:12:49,767 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:12:49,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:12:49,812 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:12:49,815 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:12:49,816 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:12:49,817 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:12:49,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-01-24 17:12:49,982 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:12:49,989 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:12:49,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:12:49,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:12:49,996 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:12:49,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:12:49" (1/1) ... [2018-01-24 17:12:49,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8bf943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:12:49, skipping insertion in model container [2018-01-24 17:12:50,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:12:49" (1/1) ... [2018-01-24 17:12:50,020 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:12:50,061 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:12:50,191 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:12:50,217 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:12:50,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:12:50 WrapperNode [2018-01-24 17:12:50,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:12:50,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:12:50,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:12:50,224 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:12:50,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:12:50" (1/1) ... [2018-01-24 17:12:50,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:12:50" (1/1) ... [2018-01-24 17:12:50,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:12:50" (1/1) ... [2018-01-24 17:12:50,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:12:50" (1/1) ... [2018-01-24 17:12:50,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:12:50" (1/1) ... [2018-01-24 17:12:50,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:12:50" (1/1) ... [2018-01-24 17:12:50,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:12:50" (1/1) ... [2018-01-24 17:12:50,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:12:50,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:12:50,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:12:50,263 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:12:50,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:12:50" (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:12:50,311 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:12:50,311 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:12:50,312 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:12:50,312 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:12:50,312 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:12:50,312 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 17:12:50,312 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 17:12:50,312 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:12:50,312 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:12:50,312 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:12:50,312 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:12:50,312 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:12:50,313 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 17:12:50,313 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:12:50,313 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:12:50,313 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:12:50,313 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:12:50,764 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:12:50,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:12:50 BoogieIcfgContainer [2018-01-24 17:12:50,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:12:50,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:12:50,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:12:50,768 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:12:50,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:12:49" (1/3) ... [2018-01-24 17:12:50,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c716ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:12:50, skipping insertion in model container [2018-01-24 17:12:50,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:12:50" (2/3) ... [2018-01-24 17:12:50,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c716ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:12:50, skipping insertion in model container [2018-01-24 17:12:50,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:12:50" (3/3) ... [2018-01-24 17:12:50,772 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-01-24 17:12:50,778 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:12:50,785 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-01-24 17:12:50,827 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:12:50,828 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:12:50,828 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:12:50,828 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:12:50,828 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:12:50,828 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:12:50,828 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:12:50,828 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:12:50,829 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:12:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-01-24 17:12:50,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 17:12:50,853 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:50,854 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:50,854 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:50,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1548810554, now seen corresponding path program 1 times [2018-01-24 17:12:50,860 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:50,903 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:50,903 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:50,903 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:50,903 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:50,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:50,976 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:12:50,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:50,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:12:50,978 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:50,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 17:12:50,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 17:12:50,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 17:12:50,994 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-01-24 17:12:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:51,105 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2018-01-24 17:12:51,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 17:12:51,106 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-01-24 17:12:51,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:51,117 INFO L225 Difference]: With dead ends: 196 [2018-01-24 17:12:51,117 INFO L226 Difference]: Without dead ends: 98 [2018-01-24 17:12:51,120 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 17:12:51,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-24 17:12:51,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-24 17:12:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 17:12:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-01-24 17:12:51,155 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 10 [2018-01-24 17:12:51,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:51,155 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-01-24 17:12:51,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 17:12:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-01-24 17:12:51,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 17:12:51,156 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:51,156 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:51,156 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:51,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2085004617, now seen corresponding path program 1 times [2018-01-24 17:12:51,156 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:51,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:51,157 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:51,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:51,158 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:51,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:51,228 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:12:51,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:51,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:12:51,228 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:51,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:12:51,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:12:51,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:12:51,231 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 3 states. [2018-01-24 17:12:51,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:51,263 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-01-24 17:12:51,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:12:51,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 17:12:51,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:51,266 INFO L225 Difference]: With dead ends: 136 [2018-01-24 17:12:51,266 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 17:12:51,267 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:12:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 17:12:51,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-01-24 17:12:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-24 17:12:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-01-24 17:12:51,278 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 13 [2018-01-24 17:12:51,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:51,279 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-01-24 17:12:51,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:12:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-01-24 17:12:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 17:12:51,281 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:51,281 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:51,282 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:51,282 INFO L82 PathProgramCache]: Analyzing trace with hash -211715870, now seen corresponding path program 1 times [2018-01-24 17:12:51,282 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:51,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:51,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:51,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:51,283 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:51,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:51,349 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:12:51,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:51,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:12:51,350 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:51,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:12:51,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:12:51,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:12:51,351 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 4 states. [2018-01-24 17:12:51,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:51,615 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2018-01-24 17:12:51,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:12:51,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 17:12:51,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:51,618 INFO L225 Difference]: With dead ends: 135 [2018-01-24 17:12:51,619 INFO L226 Difference]: Without dead ends: 127 [2018-01-24 17:12:51,619 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:12:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-24 17:12:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2018-01-24 17:12:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 17:12:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-01-24 17:12:51,630 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 14 [2018-01-24 17:12:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:51,631 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-01-24 17:12:51,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:12:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-01-24 17:12:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 17:12:51,632 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:51,632 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:51,632 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:51,633 INFO L82 PathProgramCache]: Analyzing trace with hash -211715869, now seen corresponding path program 1 times [2018-01-24 17:12:51,633 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:51,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:51,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:51,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:51,634 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:51,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:51,757 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:12:51,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:51,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:12:51,757 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:51,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:12:51,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:12:51,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:12:51,758 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 4 states. [2018-01-24 17:12:51,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:51,897 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2018-01-24 17:12:51,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:12:51,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 17:12:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:51,899 INFO L225 Difference]: With dead ends: 144 [2018-01-24 17:12:51,899 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 17:12:51,899 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:12:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 17:12:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2018-01-24 17:12:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 17:12:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2018-01-24 17:12:51,907 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 14 [2018-01-24 17:12:51,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:51,908 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2018-01-24 17:12:51,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:12:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2018-01-24 17:12:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 17:12:51,909 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:51,909 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:51,909 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:51,909 INFO L82 PathProgramCache]: Analyzing trace with hash -210634142, now seen corresponding path program 1 times [2018-01-24 17:12:51,910 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:51,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:51,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:51,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:51,911 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:51,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:51,943 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:12:51,943 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:51,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:12:51,944 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:51,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:12:51,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:12:51,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:12:51,945 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 3 states. [2018-01-24 17:12:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:52,010 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2018-01-24 17:12:52,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:12:52,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-24 17:12:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:52,012 INFO L225 Difference]: With dead ends: 103 [2018-01-24 17:12:52,012 INFO L226 Difference]: Without dead ends: 98 [2018-01-24 17:12:52,012 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:12:52,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-24 17:12:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-01-24 17:12:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 17:12:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-01-24 17:12:52,019 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 14 [2018-01-24 17:12:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:52,020 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-01-24 17:12:52,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:12:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-01-24 17:12:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 17:12:52,020 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:52,020 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:12:52,021 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:52,021 INFO L82 PathProgramCache]: Analyzing trace with hash 479661366, now seen corresponding path program 1 times [2018-01-24 17:12:52,021 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:52,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:52,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:52,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:52,022 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:52,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:12:52,107 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:12:52,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:52,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:12:52,108 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:52,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:12:52,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:12:52,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:12:52,109 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 3 states. [2018-01-24 17:12:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:52,127 INFO L93 Difference]: Finished difference Result 230 states and 261 transitions. [2018-01-24 17:12:52,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:12:52,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-24 17:12:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:52,128 INFO L225 Difference]: With dead ends: 230 [2018-01-24 17:12:52,129 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 17:12:52,129 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:12:52,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 17:12:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 125. [2018-01-24 17:12:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-24 17:12:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2018-01-24 17:12:52,141 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 26 [2018-01-24 17:12:52,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:52,141 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2018-01-24 17:12:52,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:12:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2018-01-24 17:12:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 17:12:52,143 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:52,143 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] [2018-01-24 17:12:52,143 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:52,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1985366289, now seen corresponding path program 1 times [2018-01-24 17:12:52,143 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:52,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:52,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:52,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:52,145 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:52,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:52,278 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:12:52,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:52,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:12:52,278 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:52,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:12:52,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:12:52,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:12:52,279 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand 5 states. [2018-01-24 17:12:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:52,469 INFO L93 Difference]: Finished difference Result 228 states and 263 transitions. [2018-01-24 17:12:52,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:12:52,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-24 17:12:52,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:52,470 INFO L225 Difference]: With dead ends: 228 [2018-01-24 17:12:52,471 INFO L226 Difference]: Without dead ends: 225 [2018-01-24 17:12:52,471 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:12:52,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-24 17:12:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 114. [2018-01-24 17:12:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 17:12:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2018-01-24 17:12:52,482 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2018-01-24 17:12:52,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:52,482 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2018-01-24 17:12:52,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:12:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-01-24 17:12:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:12:52,484 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:52,484 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:52,484 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:52,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812824, now seen corresponding path program 1 times [2018-01-24 17:12:52,484 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:52,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:52,485 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:52,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:52,486 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:52,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:52,550 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:12:52,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:52,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:12:52,551 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:52,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:12:52,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:12:52,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:12:52,552 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 4 states. [2018-01-24 17:12:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:52,817 INFO L93 Difference]: Finished difference Result 175 states and 204 transitions. [2018-01-24 17:12:52,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:12:52,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-24 17:12:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:52,819 INFO L225 Difference]: With dead ends: 175 [2018-01-24 17:12:52,819 INFO L226 Difference]: Without dead ends: 171 [2018-01-24 17:12:52,820 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:12:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-24 17:12:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 110. [2018-01-24 17:12:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-24 17:12:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2018-01-24 17:12:52,827 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 28 [2018-01-24 17:12:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:52,827 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2018-01-24 17:12:52,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:12:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2018-01-24 17:12:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:12:52,828 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:52,828 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:52,829 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:52,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812825, now seen corresponding path program 1 times [2018-01-24 17:12:52,829 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:52,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:52,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:52,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:52,830 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:52,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:52,908 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:12:52,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:52,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:12:52,909 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:52,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:12:52,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:12:52,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:12:52,910 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 4 states. [2018-01-24 17:12:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:53,043 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2018-01-24 17:12:53,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:12:53,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-24 17:12:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:53,044 INFO L225 Difference]: With dead ends: 163 [2018-01-24 17:12:53,045 INFO L226 Difference]: Without dead ends: 159 [2018-01-24 17:12:53,045 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:12:53,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-24 17:12:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 106. [2018-01-24 17:12:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 17:12:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2018-01-24 17:12:53,051 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 28 [2018-01-24 17:12:53,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:53,051 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2018-01-24 17:12:53,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:12:53,051 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2018-01-24 17:12:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 17:12:53,052 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:53,052 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] [2018-01-24 17:12:53,052 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:53,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264726, now seen corresponding path program 1 times [2018-01-24 17:12:53,052 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:53,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:53,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:53,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:53,053 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:53,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:53,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:12:53,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:53,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:12:53,152 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:53,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:12:53,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:12:53,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:12:53,153 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 6 states. [2018-01-24 17:12:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:53,376 INFO L93 Difference]: Finished difference Result 186 states and 209 transitions. [2018-01-24 17:12:53,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:12:53,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 17:12:53,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:53,377 INFO L225 Difference]: With dead ends: 186 [2018-01-24 17:12:53,377 INFO L226 Difference]: Without dead ends: 185 [2018-01-24 17:12:53,377 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:12:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-24 17:12:53,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 130. [2018-01-24 17:12:53,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 17:12:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-01-24 17:12:53,385 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 31 [2018-01-24 17:12:53,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:53,386 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-01-24 17:12:53,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:12:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-01-24 17:12:53,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 17:12:53,388 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:53,388 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] [2018-01-24 17:12:53,388 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:53,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264727, now seen corresponding path program 1 times [2018-01-24 17:12:53,388 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:53,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:53,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:53,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:53,390 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:53,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:53,662 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:12:53,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:53,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 17:12:53,662 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:53,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:12:53,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:12:53,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:12:53,663 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 10 states. [2018-01-24 17:12:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:54,133 INFO L93 Difference]: Finished difference Result 235 states and 261 transitions. [2018-01-24 17:12:54,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 17:12:54,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-24 17:12:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:54,136 INFO L225 Difference]: With dead ends: 235 [2018-01-24 17:12:54,136 INFO L226 Difference]: Without dead ends: 234 [2018-01-24 17:12:54,137 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-01-24 17:12:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-01-24 17:12:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 130. [2018-01-24 17:12:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 17:12:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2018-01-24 17:12:54,148 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 31 [2018-01-24 17:12:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:54,148 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2018-01-24 17:12:54,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:12:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2018-01-24 17:12:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 17:12:54,150 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:54,150 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:54,150 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:54,150 INFO L82 PathProgramCache]: Analyzing trace with hash 414150462, now seen corresponding path program 1 times [2018-01-24 17:12:54,150 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:54,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:54,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:54,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:54,151 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:54,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:12:54,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:54,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:12:54,210 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:54,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:12:54,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:12:54,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:12:54,211 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand 4 states. [2018-01-24 17:12:54,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:54,362 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2018-01-24 17:12:54,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:12:54,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-24 17:12:54,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:54,364 INFO L225 Difference]: With dead ends: 161 [2018-01-24 17:12:54,364 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 17:12:54,364 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:12:54,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 17:12:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2018-01-24 17:12:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 17:12:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2018-01-24 17:12:54,375 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 32 [2018-01-24 17:12:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:54,375 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2018-01-24 17:12:54,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:12:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2018-01-24 17:12:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 17:12:54,376 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:54,377 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:54,377 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:54,377 INFO L82 PathProgramCache]: Analyzing trace with hash 414150463, now seen corresponding path program 1 times [2018-01-24 17:12:54,377 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:54,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:54,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:54,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:54,378 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:54,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:12:54,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:54,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:12:54,461 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:54,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:12:54,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:12:54,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:12:54,462 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand 5 states. [2018-01-24 17:12:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:54,636 INFO L93 Difference]: Finished difference Result 213 states and 243 transitions. [2018-01-24 17:12:54,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:12:54,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-24 17:12:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:54,638 INFO L225 Difference]: With dead ends: 213 [2018-01-24 17:12:54,639 INFO L226 Difference]: Without dead ends: 212 [2018-01-24 17:12:54,639 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:12:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-24 17:12:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 162. [2018-01-24 17:12:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 17:12:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2018-01-24 17:12:54,652 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 189 transitions. Word has length 32 [2018-01-24 17:12:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:54,652 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 189 transitions. [2018-01-24 17:12:54,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:12:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 189 transitions. [2018-01-24 17:12:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 17:12:54,653 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:54,653 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:54,653 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:54,654 INFO L82 PathProgramCache]: Analyzing trace with hash -46238021, now seen corresponding path program 1 times [2018-01-24 17:12:54,654 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:54,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:54,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:54,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:54,655 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:54,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:12:54,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:12:54,733 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:12:54,734 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-24 17:12:54,736 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [94], [97], [113], [117], [163], [165], [166], [167], [171], [172], [173] [2018-01-24 17:12:54,781 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:12:54,782 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:12:55,171 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:12:55,172 INFO L268 AbstractInterpreter]: Visited 30 different actions 54 times. Merged at 23 different actions 23 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-24 17:12:55,184 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:12:55,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:12:55,184 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:12:55,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:55,200 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:12:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:55,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:12:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:12:55,278 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:12:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:12:55,341 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:12:55,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 5 [2018-01-24 17:12:55,341 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:55,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:12:55,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:12:55,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:12:55,342 INFO L87 Difference]: Start difference. First operand 162 states and 189 transitions. Second operand 4 states. [2018-01-24 17:12:55,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:55,401 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2018-01-24 17:12:55,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:12:55,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-01-24 17:12:55,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:55,402 INFO L225 Difference]: With dead ends: 165 [2018-01-24 17:12:55,403 INFO L226 Difference]: Without dead ends: 162 [2018-01-24 17:12:55,403 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:12:55,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-24 17:12:55,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-01-24 17:12:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 17:12:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 187 transitions. [2018-01-24 17:12:55,416 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 187 transitions. Word has length 33 [2018-01-24 17:12:55,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:55,416 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 187 transitions. [2018-01-24 17:12:55,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:12:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 187 transitions. [2018-01-24 17:12:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 17:12:55,417 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:55,417 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:55,418 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:55,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1433361569, now seen corresponding path program 1 times [2018-01-24 17:12:55,418 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:55,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:55,419 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:55,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:55,419 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:55,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:12:55,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:55,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:12:55,487 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:55,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:12:55,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:12:55,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:12:55,488 INFO L87 Difference]: Start difference. First operand 162 states and 187 transitions. Second operand 4 states. [2018-01-24 17:12:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:55,615 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2018-01-24 17:12:55,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:12:55,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-24 17:12:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:55,616 INFO L225 Difference]: With dead ends: 178 [2018-01-24 17:12:55,616 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 17:12:55,616 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:12:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 17:12:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2018-01-24 17:12:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-24 17:12:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 200 transitions. [2018-01-24 17:12:55,626 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 200 transitions. Word has length 34 [2018-01-24 17:12:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:55,626 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 200 transitions. [2018-01-24 17:12:55,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:12:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 200 transitions. [2018-01-24 17:12:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 17:12:55,627 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:55,627 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:55,627 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:55,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1433361568, now seen corresponding path program 1 times [2018-01-24 17:12:55,627 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:55,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:55,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:55,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:55,629 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:55,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:12:55,833 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:55,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:12:55,833 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:55,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:12:55,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:12:55,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:12:55,834 INFO L87 Difference]: Start difference. First operand 168 states and 200 transitions. Second operand 6 states. [2018-01-24 17:12:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:56,246 INFO L93 Difference]: Finished difference Result 252 states and 303 transitions. [2018-01-24 17:12:56,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:12:56,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-24 17:12:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:56,248 INFO L225 Difference]: With dead ends: 252 [2018-01-24 17:12:56,248 INFO L226 Difference]: Without dead ends: 250 [2018-01-24 17:12:56,249 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:12:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-24 17:12:56,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 186. [2018-01-24 17:12:56,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-24 17:12:56,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2018-01-24 17:12:56,264 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 34 [2018-01-24 17:12:56,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:56,264 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2018-01-24 17:12:56,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:12:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2018-01-24 17:12:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 17:12:56,265 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:56,266 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:56,266 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:56,266 INFO L82 PathProgramCache]: Analyzing trace with hash -521175964, now seen corresponding path program 1 times [2018-01-24 17:12:56,266 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:56,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:56,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:56,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:56,267 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:56,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:12:56,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:12:56,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:12:56,416 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:12:56,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:12:56,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:12:56,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:12:56,417 INFO L87 Difference]: Start difference. First operand 186 states and 233 transitions. Second operand 7 states. [2018-01-24 17:12:56,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:56,719 INFO L93 Difference]: Finished difference Result 307 states and 393 transitions. [2018-01-24 17:12:56,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 17:12:56,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-01-24 17:12:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:56,721 INFO L225 Difference]: With dead ends: 307 [2018-01-24 17:12:56,721 INFO L226 Difference]: Without dead ends: 257 [2018-01-24 17:12:56,722 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:12:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-01-24 17:12:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 198. [2018-01-24 17:12:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-24 17:12:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2018-01-24 17:12:56,740 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 38 [2018-01-24 17:12:56,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:56,741 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2018-01-24 17:12:56,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:12:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2018-01-24 17:12:56,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 17:12:56,741 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:56,742 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:56,742 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:56,742 INFO L82 PathProgramCache]: Analyzing trace with hash -47566885, now seen corresponding path program 1 times [2018-01-24 17:12:56,742 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:56,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:56,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:56,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:56,744 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:56,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:12:56,835 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:12:56,835 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:12:56,835 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-24 17:12:56,835 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [94], [97], [113], [119], [120], [121], [123], [124], [127], [131], [135], [157], [166], [167], [171], [172], [173] [2018-01-24 17:12:56,837 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:12:56,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:12:57,260 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:12:57,260 INFO L268 AbstractInterpreter]: Visited 36 different actions 80 times. Merged at 30 different actions 42 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 40 variables. [2018-01-24 17:12:57,277 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:12:57,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:12:57,278 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:12:57,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:57,292 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:12:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:57,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:12:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:12:57,334 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:12:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:12:57,400 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:12:57,400 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:12:57,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:57,409 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:12:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:57,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:12:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:12:57,484 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:12:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:12:57,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:12:57,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 4, 4] total 5 [2018-01-24 17:12:57,507 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:12:57,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:12:57,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:12:57,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:12:57,508 INFO L87 Difference]: Start difference. First operand 198 states and 247 transitions. Second operand 5 states. [2018-01-24 17:12:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:57,568 INFO L93 Difference]: Finished difference Result 288 states and 357 transitions. [2018-01-24 17:12:57,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:12:57,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-24 17:12:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:57,570 INFO L225 Difference]: With dead ends: 288 [2018-01-24 17:12:57,570 INFO L226 Difference]: Without dead ends: 253 [2018-01-24 17:12:57,571 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:12:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-01-24 17:12:57,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2018-01-24 17:12:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-24 17:12:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 310 transitions. [2018-01-24 17:12:57,592 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 310 transitions. Word has length 41 [2018-01-24 17:12:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:57,593 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 310 transitions. [2018-01-24 17:12:57,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:12:57,595 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 310 transitions. [2018-01-24 17:12:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 17:12:57,596 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:57,596 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:57,596 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:57,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1474573890, now seen corresponding path program 1 times [2018-01-24 17:12:57,596 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:57,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:57,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:57,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:57,598 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:57,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:12:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:12:57,769 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:12:57,769 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:12:57,769 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-01-24 17:12:57,770 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [94], [97], [113], [117], [119], [120], [123], [124], [127], [131], [135], [157], [163], [165], [166], [167], [171], [172], [173] [2018-01-24 17:12:57,771 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:12:57,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:12:58,188 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:12:58,188 INFO L268 AbstractInterpreter]: Visited 38 different actions 88 times. Merged at 32 different actions 48 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 41 variables. [2018-01-24 17:12:58,190 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:12:58,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:12:58,190 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:12:58,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:58,202 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:12:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:58,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:12:58,574 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~x~10.base Int)) (and (= (select |c_old(#valid)| main_~x~10.base) 0) (= |c_#valid| (store |c_old(#valid)| main_~x~10.base 0)) (not (= main_~x~10.base 0)))) is different from true [2018-01-24 17:12:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-24 17:12:58,590 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:12:58,772 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_9| Int)) (or (= (store |c_#valid| |v_main_#t~malloc3.base_9| 0) |c_old(#valid)|) (= 0 |v_main_#t~malloc3.base_9|) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_9|))))) is different from false [2018-01-24 17:12:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-01-24 17:12:58,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:12:58,832 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:12:58,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:58,842 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:12:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:58,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:12:58,914 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:12:58,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:12:58,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:12:58,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:12:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:12:59,156 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:12:59,206 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_10| Int)) (or (= (store |c_#valid| |v_main_#t~malloc3.base_10| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_10|))) (= 0 |v_main_#t~malloc3.base_10|))) is different from false [2018-01-24 17:12:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-01-24 17:12:59,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:12:59,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9, 8, 7] total 25 [2018-01-24 17:12:59,223 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:12:59,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 17:12:59,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 17:12:59,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=428, Unknown=8, NotChecked=132, Total=650 [2018-01-24 17:12:59,224 INFO L87 Difference]: Start difference. First operand 238 states and 310 transitions. Second operand 14 states. [2018-01-24 17:12:59,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:12:59,930 INFO L93 Difference]: Finished difference Result 244 states and 315 transitions. [2018-01-24 17:12:59,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:12:59,931 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-01-24 17:12:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:12:59,931 INFO L225 Difference]: With dead ends: 244 [2018-01-24 17:12:59,932 INFO L226 Difference]: Without dead ends: 230 [2018-01-24 17:12:59,932 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=157, Invalid=659, Unknown=8, NotChecked=168, Total=992 [2018-01-24 17:12:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-24 17:12:59,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-01-24 17:12:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-24 17:12:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 300 transitions. [2018-01-24 17:12:59,951 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 300 transitions. Word has length 42 [2018-01-24 17:12:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:12:59,951 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 300 transitions. [2018-01-24 17:12:59,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 17:12:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 300 transitions. [2018-01-24 17:12:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 17:12:59,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:12:59,952 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:12:59,953 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:12:59,953 INFO L82 PathProgramCache]: Analyzing trace with hash 924240911, now seen corresponding path program 1 times [2018-01-24 17:12:59,953 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:12:59,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:59,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:12:59,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:12:59,954 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:12:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:12:59,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:13:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:00,083 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:00,083 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:13:00,083 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-01-24 17:13:00,083 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [94], [97], [99], [101], [166], [167], [171], [172], [173] [2018-01-24 17:13:00,085 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:13:00,086 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:13:00,276 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:13:00,276 INFO L268 AbstractInterpreter]: Visited 27 different actions 47 times. Merged at 19 different actions 19 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-24 17:13:00,278 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:13:00,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:00,278 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:13:00,293 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:00,293 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:00,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:00,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 17:13:00,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:00,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:00,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 17:13:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:00,439 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:13:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:00,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:00,523 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 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 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:13:00,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:00,527 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:00,580 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:00,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:13:00,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:00,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:00,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:13:00,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 17:13:00,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:00,606 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:13:00,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-24 17:13:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:00,613 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:13:00,626 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:00,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:13:00,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 4, 4] total 10 [2018-01-24 17:13:00,627 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:13:00,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:13:00,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:13:00,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:13:00,628 INFO L87 Difference]: Start difference. First operand 229 states and 300 transitions. Second operand 8 states. [2018-01-24 17:13:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:13:00,929 INFO L93 Difference]: Finished difference Result 264 states and 329 transitions. [2018-01-24 17:13:00,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:13:00,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-24 17:13:00,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:13:00,931 INFO L225 Difference]: With dead ends: 264 [2018-01-24 17:13:00,931 INFO L226 Difference]: Without dead ends: 263 [2018-01-24 17:13:00,931 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 163 SyntacticMatches, 16 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-01-24 17:13:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-01-24 17:13:00,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 228. [2018-01-24 17:13:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-01-24 17:13:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 298 transitions. [2018-01-24 17:13:00,951 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 298 transitions. Word has length 45 [2018-01-24 17:13:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:13:00,952 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 298 transitions. [2018-01-24 17:13:00,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:13:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 298 transitions. [2018-01-24 17:13:00,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 17:13:00,953 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:13:00,953 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:13:00,953 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:13:00,953 INFO L82 PathProgramCache]: Analyzing trace with hash 924240912, now seen corresponding path program 1 times [2018-01-24 17:13:00,953 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:13:00,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:00,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:00,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:00,955 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:13:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:00,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:13:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:01,107 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:01,107 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:13:01,107 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-01-24 17:13:01,108 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [94], [97], [99], [102], [166], [167], [171], [172], [173] [2018-01-24 17:13:01,109 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:13:01,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:13:01,280 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:13:01,280 INFO L268 AbstractInterpreter]: Visited 27 different actions 47 times. Merged at 19 different actions 19 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-24 17:13:01,281 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:13:01,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:01,282 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:13:01,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:01,290 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:01,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:01,329 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:13:01,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:01,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:01,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:13:01,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-01-24 17:13:01,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:01,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:01,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2018-01-24 17:13:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:01,451 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:13:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:01,930 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:01,930 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 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 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:13:01,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:01,936 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:01,992 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:01,999 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:13:02,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:02,042 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:13:02,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:02,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:02,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 17:13:02,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:13:02,092 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 12 treesize of output 15 [2018-01-24 17:13:02,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:02,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:13:02,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:13:02,117 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:13:02,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:02,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:13:02,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-01-24 17:13:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:02,168 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:13:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:02,334 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:13:02,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 5, 5] total 22 [2018-01-24 17:13:02,334 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:13:02,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 17:13:02,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 17:13:02,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=409, Unknown=1, NotChecked=0, Total=506 [2018-01-24 17:13:02,335 INFO L87 Difference]: Start difference. First operand 228 states and 298 transitions. Second operand 12 states. [2018-01-24 17:13:02,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:13:02,637 INFO L93 Difference]: Finished difference Result 318 states and 405 transitions. [2018-01-24 17:13:02,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 17:13:02,638 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-01-24 17:13:02,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:13:02,640 INFO L225 Difference]: With dead ends: 318 [2018-01-24 17:13:02,640 INFO L226 Difference]: Without dead ends: 317 [2018-01-24 17:13:02,640 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=647, Unknown=1, NotChecked=0, Total=870 [2018-01-24 17:13:02,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-01-24 17:13:02,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 227. [2018-01-24 17:13:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-01-24 17:13:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 296 transitions. [2018-01-24 17:13:02,661 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 296 transitions. Word has length 45 [2018-01-24 17:13:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:13:02,661 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 296 transitions. [2018-01-24 17:13:02,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 17:13:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 296 transitions. [2018-01-24 17:13:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 17:13:02,662 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:13:02,662 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:13:02,663 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:13:02,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2048623147, now seen corresponding path program 1 times [2018-01-24 17:13:02,663 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:13:02,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:02,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:02,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:02,664 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:13:02,676 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 17:13:02,676 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 17:13:02,676 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 17:13:02,684 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:02,685 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 17:13:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:02,723 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-01-24 17:13:02,723 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [58], [59], [60], [65], [67], [70], [73], [74], [77], [78], [80], [81], [84], [87], [90], [166], [167], [171], [172], [173] [2018-01-24 17:13:02,725 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:13:02,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:13:02,883 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:13:02,884 INFO L268 AbstractInterpreter]: Visited 37 different actions 46 times. Merged at 9 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-01-24 17:13:02,901 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:13:02,902 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:02,902 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:13:02,913 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:02,913 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:02,951 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:02,960 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:13:02,962 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:13:02,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:02,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:02,981 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:13:02,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-24 17:13:02,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-24 17:13:02,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:02,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:02,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-24 17:13:03,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-01-24 17:13:03,081 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 26 treesize of output 25 [2018-01-24 17:13:03,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:03,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:03,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 17:13:03,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-24 17:13:03,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-01-24 17:13:03,115 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 24 treesize of output 17 [2018-01-24 17:13:03,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:03,132 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 17 treesize of output 10 [2018-01-24 17:13:03,132 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:03,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-01-24 17:13:03,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:03,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:03,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:13:03,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2018-01-24 17:13:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:03,155 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:13:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:03,216 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:03,216 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 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 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:13:03,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:03,219 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:03,282 ERROR L243 seRefinementStrategy]: Caught known exception: A non-linear fact was asserted to arithmetic in a linear logic. [2018-01-24 17:13:03,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 17:13:03,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-01-24 17:13:03,283 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:13:03,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 17:13:03,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 17:13:03,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:13:03,284 INFO L87 Difference]: Start difference. First operand 227 states and 296 transitions. Second operand 13 states. [2018-01-24 17:13:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:13:03,558 INFO L93 Difference]: Finished difference Result 249 states and 323 transitions. [2018-01-24 17:13:03,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 17:13:03,558 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-01-24 17:13:03,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:13:03,560 INFO L225 Difference]: With dead ends: 249 [2018-01-24 17:13:03,560 INFO L226 Difference]: Without dead ends: 248 [2018-01-24 17:13:03,560 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-01-24 17:13:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-24 17:13:03,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 226. [2018-01-24 17:13:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-24 17:13:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 294 transitions. [2018-01-24 17:13:03,571 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 294 transitions. Word has length 48 [2018-01-24 17:13:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:13:03,572 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 294 transitions. [2018-01-24 17:13:03,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 17:13:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 294 transitions. [2018-01-24 17:13:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 17:13:03,572 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:13:03,573 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:13:03,573 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:13:03,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2048623146, now seen corresponding path program 1 times [2018-01-24 17:13:03,573 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:13:03,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:03,574 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:03,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:03,574 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:13:03,586 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 17:13:03,586 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 17:13:03,586 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 17:13:03,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:03,603 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 17:13:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:03,657 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-01-24 17:13:03,657 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [58], [59], [60], [65], [67], [70], [73], [74], [77], [79], [80], [81], [84], [87], [90], [166], [167], [171], [172], [173] [2018-01-24 17:13:03,659 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:13:03,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:13:03,805 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:13:03,805 INFO L268 AbstractInterpreter]: Visited 37 different actions 46 times. Merged at 9 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-01-24 17:13:03,808 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:13:03,808 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:03,808 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:13:03,819 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:03,819 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:03,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:03,860 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:13:03,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:03,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:03,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:13:03,901 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:13:03,903 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:13:03,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:03,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:03,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:13:03,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:13:03,931 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:03,939 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:03,981 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:13:03,981 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:34 [2018-01-24 17:13:04,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-01-24 17:13:04,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:04,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:04,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2018-01-24 17:13:04,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-01-24 17:13:04,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-01-24 17:13:04,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:04,273 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 22 treesize of output 21 [2018-01-24 17:13:04,274 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:04,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:04,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-01-24 17:13:04,304 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 33 treesize of output 32 [2018-01-24 17:13:04,305 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:04,320 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:04,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 17:13:04,327 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-01-24 17:13:04,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-01-24 17:13:04,352 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 24 treesize of output 17 [2018-01-24 17:13:04,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:04,364 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 17 treesize of output 10 [2018-01-24 17:13:04,365 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:04,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-01-24 17:13:04,373 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:04,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:04,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-01-24 17:13:04,389 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 29 treesize of output 22 [2018-01-24 17:13:04,389 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:04,400 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 22 treesize of output 13 [2018-01-24 17:13:04,400 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:04,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2018-01-24 17:13:04,410 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:04,417 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:04,421 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:13:04,421 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:67, output treesize:19 [2018-01-24 17:13:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:04,438 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:13:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:04,897 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:04,897 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 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 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:13:04,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:04,901 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:04,965 ERROR L243 seRefinementStrategy]: Caught known exception: A non-linear fact was asserted to arithmetic in a linear logic. [2018-01-24 17:13:04,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 17:13:04,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-01-24 17:13:04,966 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:13:04,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 17:13:04,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 17:13:04,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=279, Unknown=4, NotChecked=0, Total=342 [2018-01-24 17:13:04,968 INFO L87 Difference]: Start difference. First operand 226 states and 294 transitions. Second operand 19 states. [2018-01-24 17:13:05,885 WARN L143 SmtUtils]: Spent 287ms on a formula simplification that was a NOOP. DAG size: 24 [2018-01-24 17:13:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:13:06,035 INFO L93 Difference]: Finished difference Result 318 states and 410 transitions. [2018-01-24 17:13:06,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 17:13:06,035 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-01-24 17:13:06,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:13:06,037 INFO L225 Difference]: With dead ends: 318 [2018-01-24 17:13:06,037 INFO L226 Difference]: Without dead ends: 317 [2018-01-24 17:13:06,038 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=663, Unknown=5, NotChecked=0, Total=870 [2018-01-24 17:13:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-01-24 17:13:06,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 209. [2018-01-24 17:13:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-24 17:13:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 276 transitions. [2018-01-24 17:13:06,055 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 276 transitions. Word has length 48 [2018-01-24 17:13:06,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:13:06,056 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 276 transitions. [2018-01-24 17:13:06,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 17:13:06,056 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 276 transitions. [2018-01-24 17:13:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 17:13:06,057 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:13:06,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:13:06,057 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:13:06,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1869223904, now seen corresponding path program 1 times [2018-01-24 17:13:06,057 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:13:06,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:06,058 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:06,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:06,059 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:13:06,070 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 17:13:06,070 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 17:13:06,071 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 17:13:06,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:06,078 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 17:13:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:06,124 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-01-24 17:13:06,124 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [58], [59], [60], [65], [67], [70], [73], [74], [77], [80], [81], [84], [87], [90], [94], [97], [113], [119], [122], [166], [167], [171], [172], [173] [2018-01-24 17:13:06,125 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:13:06,125 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:13:06,455 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:13:06,455 INFO L268 AbstractInterpreter]: Visited 43 different actions 133 times. Merged at 37 different actions 87 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 41 variables. [2018-01-24 17:13:06,459 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:13:06,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:06,459 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:13:06,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:06,472 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:06,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:06,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:13:06,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-01-24 17:13:06,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:06,549 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:13:06,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:13:06,550 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:13:06,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:06,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:06,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-24 17:13:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:06,608 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:13:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:06,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:06,683 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 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 19 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:13:06,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:06,686 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:06,738 ERROR L243 seRefinementStrategy]: Caught known exception: A non-linear fact was asserted to arithmetic in a linear logic. [2018-01-24 17:13:06,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 17:13:06,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-01-24 17:13:06,738 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:13:06,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:13:06,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:13:06,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:13:06,739 INFO L87 Difference]: Start difference. First operand 209 states and 276 transitions. Second operand 9 states. [2018-01-24 17:13:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:13:06,976 INFO L93 Difference]: Finished difference Result 310 states and 397 transitions. [2018-01-24 17:13:06,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 17:13:06,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-01-24 17:13:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:13:06,978 INFO L225 Difference]: With dead ends: 310 [2018-01-24 17:13:06,978 INFO L226 Difference]: Without dead ends: 309 [2018-01-24 17:13:06,978 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-01-24 17:13:06,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-01-24 17:13:06,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 216. [2018-01-24 17:13:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-24 17:13:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 284 transitions. [2018-01-24 17:13:06,994 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 284 transitions. Word has length 49 [2018-01-24 17:13:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:13:06,995 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 284 transitions. [2018-01-24 17:13:06,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:13:06,995 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 284 transitions. [2018-01-24 17:13:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-24 17:13:06,996 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:13:06,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:13:06,996 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:13:06,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1027839999, now seen corresponding path program 1 times [2018-01-24 17:13:06,996 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:13:06,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:06,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:06,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:06,997 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:13:07,007 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 17:13:07,007 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 17:13:07,008 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 17:13:07,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:07,015 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 17:13:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:07,066 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-01-24 17:13:07,066 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [58], [59], [60], [65], [67], [70], [73], [74], [77], [80], [81], [84], [87], [90], [94], [97], [113], [119], [120], [123], [126], [166], [167], [171], [172], [173] [2018-01-24 17:13:07,067 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:13:07,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:13:07,451 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:13:07,451 INFO L268 AbstractInterpreter]: Visited 45 different actions 137 times. Merged at 39 different actions 88 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 43 variables. [2018-01-24 17:13:07,457 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:13:07,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:07,457 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:13:07,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:07,462 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:07,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:13:07,514 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:13:07,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-01-24 17:13:07,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-24 17:13:07,533 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 12 treesize of output 10 [2018-01-24 17:13:07,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:07,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 17:13:07,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:12 [2018-01-24 17:13:07,550 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:13:07,570 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:13:07,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-01-24 17:13:07,570 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:13:07,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:13:07,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:13:07,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:13:07,571 INFO L87 Difference]: Start difference. First operand 216 states and 284 transitions. Second operand 6 states. [2018-01-24 17:13:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:13:07,677 INFO L93 Difference]: Finished difference Result 249 states and 325 transitions. [2018-01-24 17:13:07,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:13:07,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-01-24 17:13:07,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:13:07,679 INFO L225 Difference]: With dead ends: 249 [2018-01-24 17:13:07,679 INFO L226 Difference]: Without dead ends: 248 [2018-01-24 17:13:07,679 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-01-24 17:13:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-24 17:13:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 218. [2018-01-24 17:13:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-24 17:13:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 285 transitions. [2018-01-24 17:13:07,690 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 285 transitions. Word has length 51 [2018-01-24 17:13:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:13:07,690 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 285 transitions. [2018-01-24 17:13:07,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:13:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 285 transitions. [2018-01-24 17:13:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 17:13:07,691 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:13:07,691 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, 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:13:07,691 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:13:07,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1099560870, now seen corresponding path program 1 times [2018-01-24 17:13:07,691 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:13:07,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:07,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:07,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:07,692 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:13:07,699 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 17:13:07,699 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 17:13:07,699 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 17:13:07,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:07,707 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 17:13:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:07,752 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-01-24 17:13:07,752 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [58], [59], [60], [65], [67], [70], [73], [74], [77], [80], [81], [84], [87], [90], [94], [97], [113], [119], [120], [123], [124], [127], [131], [135], [158], [166], [167], [171], [172], [173] [2018-01-24 17:13:07,753 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:13:07,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:13:08,201 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 17:13:08,202 INFO L268 AbstractInterpreter]: Visited 49 different actions 145 times. Merged at 42 different actions 91 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 47 variables. [2018-01-24 17:13:08,211 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 17:13:08,438 INFO L232 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 68.33% of their original sizes. [2018-01-24 17:13:08,438 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 17:13:08,804 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 17:13:08,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:13:08,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-01-24 17:13:08,805 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:13:08,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 17:13:08,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 17:13:08,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2018-01-24 17:13:08,807 INFO L87 Difference]: Start difference. First operand 218 states and 285 transitions. Second operand 25 states. [2018-01-24 17:13:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:13:14,491 INFO L93 Difference]: Finished difference Result 332 states and 416 transitions. [2018-01-24 17:13:14,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-24 17:13:14,524 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-01-24 17:13:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:13:14,525 INFO L225 Difference]: With dead ends: 332 [2018-01-24 17:13:14,525 INFO L226 Difference]: Without dead ends: 331 [2018-01-24 17:13:14,526 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 102 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=948, Invalid=4308, Unknown=0, NotChecked=0, Total=5256 [2018-01-24 17:13:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-01-24 17:13:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 213. [2018-01-24 17:13:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-24 17:13:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 278 transitions. [2018-01-24 17:13:14,541 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 278 transitions. Word has length 55 [2018-01-24 17:13:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:13:14,542 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 278 transitions. [2018-01-24 17:13:14,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 17:13:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 278 transitions. [2018-01-24 17:13:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 17:13:14,542 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:13:14,542 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, 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:13:14,542 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:13:14,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1099560827, now seen corresponding path program 1 times [2018-01-24 17:13:14,543 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:13:14,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:14,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:14,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:14,544 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:13:14,551 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 17:13:14,551 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 17:13:14,551 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 17:13:14,558 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:14,558 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 17:13:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:14,604 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-01-24 17:13:14,605 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [58], [59], [60], [65], [67], [70], [73], [74], [77], [80], [81], [84], [87], [90], [94], [97], [113], [119], [120], [123], [124], [127], [131], [137], [139], [166], [167], [171], [172], [173] [2018-01-24 17:13:14,606 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:13:14,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:13:14,888 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:13:14,888 INFO L268 AbstractInterpreter]: Visited 49 different actions 145 times. Merged at 43 different actions 92 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 49 variables. [2018-01-24 17:13:14,896 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:13:14,896 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:14,896 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:13:14,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:14,936 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:14,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:15,066 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:13:15,068 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:13:15,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:15,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:15,092 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:13:15,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-24 17:13:15,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-24 17:13:15,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-24 17:13:15,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:15,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:15,185 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:13:15,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-01-24 17:13:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:15,274 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:13:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:15,312 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:13:15,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2018-01-24 17:13:15,313 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:13:15,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:13:15,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:13:15,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:13:15,314 INFO L87 Difference]: Start difference. First operand 213 states and 278 transitions. Second operand 8 states. [2018-01-24 17:13:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:13:15,537 INFO L93 Difference]: Finished difference Result 260 states and 328 transitions. [2018-01-24 17:13:15,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 17:13:15,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-01-24 17:13:15,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:13:15,539 INFO L225 Difference]: With dead ends: 260 [2018-01-24 17:13:15,539 INFO L226 Difference]: Without dead ends: 259 [2018-01-24 17:13:15,539 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-24 17:13:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-24 17:13:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 225. [2018-01-24 17:13:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-24 17:13:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 294 transitions. [2018-01-24 17:13:15,566 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 294 transitions. Word has length 55 [2018-01-24 17:13:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:13:15,566 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 294 transitions. [2018-01-24 17:13:15,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:13:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 294 transitions. [2018-01-24 17:13:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 17:13:15,567 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:13:15,567 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, 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:13:15,567 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:13:15,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1099560826, now seen corresponding path program 1 times [2018-01-24 17:13:15,568 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:13:15,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:15,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:15,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:15,569 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:13:15,578 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 17:13:15,578 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 17:13:15,578 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 17:13:15,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:15,586 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 17:13:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:15,638 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-01-24 17:13:15,638 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [58], [59], [60], [65], [67], [70], [73], [74], [77], [80], [81], [84], [87], [90], [94], [97], [113], [119], [120], [123], [124], [127], [131], [137], [140], [166], [167], [171], [172], [173] [2018-01-24 17:13:15,640 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:13:15,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:13:15,942 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:13:15,942 INFO L268 AbstractInterpreter]: Visited 49 different actions 145 times. Merged at 43 different actions 92 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 49 variables. [2018-01-24 17:13:15,952 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:13:15,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:15,952 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:13:15,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:15,957 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:15,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:16,024 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:13:16,025 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:13:16,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:16,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:16,035 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:13:16,037 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:13:16,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:16,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:16,045 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:13:16,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:36 [2018-01-24 17:13:16,082 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 23 treesize of output 19 [2018-01-24 17:13:16,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-01-24 17:13:16,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:16,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:16,092 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 33 treesize of output 25 [2018-01-24 17:13:16,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-01-24 17:13:16,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:16,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:16,101 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:13:16,101 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-01-24 17:13:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:16,127 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:13:16,232 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 17:13:16,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:16,237 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 8 treesize of output 6 [2018-01-24 17:13:16,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:16,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:16,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2018-01-24 17:13:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:16,279 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:13:16,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 8] imperfect sequences [] total 20 [2018-01-24 17:13:16,280 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:13:16,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 17:13:16,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 17:13:16,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-01-24 17:13:16,280 INFO L87 Difference]: Start difference. First operand 225 states and 294 transitions. Second operand 14 states. [2018-01-24 17:13:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:13:16,906 INFO L93 Difference]: Finished difference Result 385 states and 497 transitions. [2018-01-24 17:13:16,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 17:13:16,906 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-01-24 17:13:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:13:16,907 INFO L225 Difference]: With dead ends: 385 [2018-01-24 17:13:16,908 INFO L226 Difference]: Without dead ends: 384 [2018-01-24 17:13:16,908 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=310, Invalid=1022, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 17:13:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-01-24 17:13:16,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 225. [2018-01-24 17:13:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-24 17:13:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 292 transitions. [2018-01-24 17:13:16,924 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 292 transitions. Word has length 55 [2018-01-24 17:13:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:13:16,924 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 292 transitions. [2018-01-24 17:13:16,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 17:13:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 292 transitions. [2018-01-24 17:13:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-24 17:13:16,925 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:13:16,925 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, 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:13:16,925 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:13:16,925 INFO L82 PathProgramCache]: Analyzing trace with hash -115996377, now seen corresponding path program 1 times [2018-01-24 17:13:16,925 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:13:16,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:16,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:16,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:16,926 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:13:16,936 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 17:13:16,936 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 17:13:16,936 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 17:13:16,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:16,944 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 17:13:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:16,992 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-01-24 17:13:16,992 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [58], [59], [60], [65], [67], [70], [73], [74], [77], [80], [81], [84], [87], [90], [94], [97], [113], [119], [120], [123], [124], [127], [131], [137], [138], [141], [144], [166], [167], [171], [172], [173] [2018-01-24 17:13:16,994 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:13:16,994 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:13:17,326 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:13:17,326 INFO L268 AbstractInterpreter]: Visited 51 different actions 149 times. Merged at 45 different actions 94 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 51 variables. [2018-01-24 17:13:17,329 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:13:17,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:17,329 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:13:17,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:17,335 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:17,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:17,368 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:13:17,370 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:13:17,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:17,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:17,379 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:13:17,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:13:17,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:17,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:17,387 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:13:17,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-24 17:13:17,405 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 23 treesize of output 19 [2018-01-24 17:13:17,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-01-24 17:13:17,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:17,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:17,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 17:13:17,418 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 15 treesize of output 11 [2018-01-24 17:13:17,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:17,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:17,422 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:13:17,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7 [2018-01-24 17:13:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:17,465 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:13:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:17,591 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:13:17,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2018-01-24 17:13:17,591 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:13:17,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:13:17,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:13:17,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-01-24 17:13:17,592 INFO L87 Difference]: Start difference. First operand 225 states and 292 transitions. Second operand 10 states. [2018-01-24 17:13:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:13:18,023 INFO L93 Difference]: Finished difference Result 355 states and 451 transitions. [2018-01-24 17:13:18,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 17:13:18,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2018-01-24 17:13:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:13:18,024 INFO L225 Difference]: With dead ends: 355 [2018-01-24 17:13:18,024 INFO L226 Difference]: Without dead ends: 354 [2018-01-24 17:13:18,025 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2018-01-24 17:13:18,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-01-24 17:13:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 229. [2018-01-24 17:13:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-24 17:13:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 298 transitions. [2018-01-24 17:13:18,042 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 298 transitions. Word has length 57 [2018-01-24 17:13:18,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:13:18,043 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 298 transitions. [2018-01-24 17:13:18,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:13:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 298 transitions. [2018-01-24 17:13:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-24 17:13:18,043 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:13:18,043 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, 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:13:18,043 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:13:18,044 INFO L82 PathProgramCache]: Analyzing trace with hash -115996378, now seen corresponding path program 1 times [2018-01-24 17:13:18,044 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:13:18,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:18,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:18,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:18,045 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:13:18,051 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 17:13:18,051 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 17:13:18,051 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 17:13:18,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:18,069 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 17:13:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:18,114 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-01-24 17:13:18,114 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [58], [59], [60], [65], [67], [70], [73], [74], [77], [80], [81], [84], [87], [90], [94], [97], [113], [119], [120], [123], [124], [127], [131], [137], [138], [141], [143], [166], [167], [171], [172], [173] [2018-01-24 17:13:18,116 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:13:18,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:13:18,405 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 17:13:18,405 INFO L268 AbstractInterpreter]: Visited 51 different actions 149 times. Merged at 44 different actions 93 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 51 variables. [2018-01-24 17:13:18,406 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 17:13:18,531 INFO L232 lantSequenceWeakener]: Weakened 56 states. On average, predicates are now at 66.32% of their original sizes. [2018-01-24 17:13:18,532 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 17:13:18,922 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 17:13:18,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:13:18,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2018-01-24 17:13:18,922 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:13:18,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 17:13:18,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 17:13:18,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2018-01-24 17:13:18,923 INFO L87 Difference]: Start difference. First operand 229 states and 298 transitions. Second operand 28 states. [2018-01-24 17:13:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:13:22,852 INFO L93 Difference]: Finished difference Result 337 states and 422 transitions. [2018-01-24 17:13:22,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-01-24 17:13:22,853 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 57 [2018-01-24 17:13:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:13:22,854 INFO L225 Difference]: With dead ends: 337 [2018-01-24 17:13:22,854 INFO L226 Difference]: Without dead ends: 335 [2018-01-24 17:13:22,855 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2198 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1003, Invalid=6137, Unknown=0, NotChecked=0, Total=7140 [2018-01-24 17:13:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-01-24 17:13:22,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 227. [2018-01-24 17:13:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-01-24 17:13:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 287 transitions. [2018-01-24 17:13:22,883 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 287 transitions. Word has length 57 [2018-01-24 17:13:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:13:22,883 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 287 transitions. [2018-01-24 17:13:22,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 17:13:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 287 transitions. [2018-01-24 17:13:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-24 17:13:22,884 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:13:22,885 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:13:22,885 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:13:22,885 INFO L82 PathProgramCache]: Analyzing trace with hash 156065119, now seen corresponding path program 1 times [2018-01-24 17:13:22,885 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:13:22,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:22,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:22,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:22,886 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:13:22,895 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 17:13:22,895 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 17:13:22,895 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 17:13:22,903 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:22,903 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 17:13:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:22,955 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-01-24 17:13:22,956 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [58], [59], [60], [65], [67], [70], [73], [74], [77], [80], [81], [84], [87], [90], [94], [97], [113], [117], [119], [120], [123], [124], [127], [131], [135], [157], [163], [165], [166], [167], [171], [172], [173] [2018-01-24 17:13:22,957 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:13:22,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:13:23,329 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:13:23,330 INFO L268 AbstractInterpreter]: Visited 52 different actions 166 times. Merged at 46 different actions 108 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 5 different actions. Largest state had 48 variables. [2018-01-24 17:13:23,335 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:13:23,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:23,335 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:13:23,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:23,340 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:23,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:23,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:13:23,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:13:23,381 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:13:23,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:23,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:23,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-24 17:13:23,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:13:23,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:13:23,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:23,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:23,404 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:13:23,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:15 [2018-01-24 17:13:23,434 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 16 treesize of output 12 [2018-01-24 17:13:23,439 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 13 [2018-01-24 17:13:23,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 17:13:23,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:13:23,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:13:23,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2018-01-24 17:13:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:23,486 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:13:23,578 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 11 treesize of output 9 [2018-01-24 17:13:23,589 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 10 treesize of output 3 [2018-01-24 17:13:23,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:23,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:13:23,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 17:13:23,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2018-01-24 17:13:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:23,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:23,712 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 32 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 32 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:13:23,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:23,716 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:23,774 ERROR L243 seRefinementStrategy]: Caught known exception: A non-linear fact was asserted to arithmetic in a linear logic. [2018-01-24 17:13:23,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 17:13:23,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-01-24 17:13:23,775 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:13:23,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 17:13:23,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 17:13:23,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-01-24 17:13:23,776 INFO L87 Difference]: Start difference. First operand 227 states and 287 transitions. Second operand 21 states. [2018-01-24 17:13:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:13:24,559 INFO L93 Difference]: Finished difference Result 431 states and 527 transitions. [2018-01-24 17:13:24,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 17:13:24,559 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2018-01-24 17:13:24,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:13:24,561 INFO L225 Difference]: With dead ends: 431 [2018-01-24 17:13:24,561 INFO L226 Difference]: Without dead ends: 394 [2018-01-24 17:13:24,561 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=1081, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 17:13:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-01-24 17:13:24,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 227. [2018-01-24 17:13:24,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-01-24 17:13:24,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 285 transitions. [2018-01-24 17:13:24,581 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 285 transitions. Word has length 59 [2018-01-24 17:13:24,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:13:24,581 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 285 transitions. [2018-01-24 17:13:24,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 17:13:24,582 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 285 transitions. [2018-01-24 17:13:24,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-24 17:13:24,582 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:13:24,582 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, 1, 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:13:24,582 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:13:24,582 INFO L82 PathProgramCache]: Analyzing trace with hash 196634183, now seen corresponding path program 1 times [2018-01-24 17:13:24,582 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:13:24,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:24,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:24,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:24,583 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:13:24,591 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 17:13:24,591 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 17:13:24,591 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 17:13:24,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:24,596 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 17:13:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:24,628 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-01-24 17:13:24,628 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [58], [59], [60], [65], [67], [70], [73], [74], [77], [80], [81], [84], [87], [90], [94], [97], [113], [119], [120], [123], [124], [127], [131], [137], [138], [141], [142], [147], [149], [166], [167], [171], [172], [173] [2018-01-24 17:13:24,628 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:13:24,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:13:24,925 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:13:24,925 INFO L268 AbstractInterpreter]: Visited 53 different actions 153 times. Merged at 47 different actions 96 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 52 variables. [2018-01-24 17:13:24,926 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:13:24,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:24,926 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:13:24,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:24,931 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:24,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:24,987 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:13:24,988 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:13:24,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:24,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:24,994 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:13:24,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-01-24 17:13:25,022 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 22 treesize of output 16 [2018-01-24 17:13:25,024 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 16 treesize of output 7 [2018-01-24 17:13:25,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:13:25,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:13:25,032 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:13:25,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:7 [2018-01-24 17:13:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:25,077 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:13:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:25,291 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:13:25,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 10] imperfect sequences [] total 19 [2018-01-24 17:13:25,291 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:13:25,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 17:13:25,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 17:13:25,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-01-24 17:13:25,292 INFO L87 Difference]: Start difference. First operand 227 states and 285 transitions. Second operand 14 states. [2018-01-24 17:13:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:13:26,393 INFO L93 Difference]: Finished difference Result 499 states and 622 transitions. [2018-01-24 17:13:26,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-24 17:13:26,393 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-01-24 17:13:26,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:13:26,395 INFO L225 Difference]: With dead ends: 499 [2018-01-24 17:13:26,395 INFO L226 Difference]: Without dead ends: 498 [2018-01-24 17:13:26,396 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=605, Invalid=1747, Unknown=0, NotChecked=0, Total=2352 [2018-01-24 17:13:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-01-24 17:13:26,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 264. [2018-01-24 17:13:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-01-24 17:13:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 334 transitions. [2018-01-24 17:13:26,418 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 334 transitions. Word has length 59 [2018-01-24 17:13:26,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:13:26,418 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 334 transitions. [2018-01-24 17:13:26,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 17:13:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 334 transitions. [2018-01-24 17:13:26,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-24 17:13:26,418 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:13:26,419 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:13:26,419 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:13:26,419 INFO L82 PathProgramCache]: Analyzing trace with hash 740017122, now seen corresponding path program 2 times [2018-01-24 17:13:26,419 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:13:26,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:26,420 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:26,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:26,420 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:13:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:26,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:13:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 17:13:26,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:26,505 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:13:26,505 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:13:26,505 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:13:26,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:26,505 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:13:26,518 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:13:26,518 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:13:26,533 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:13:26,552 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:13:26,557 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:13:26,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 17:13:26,642 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:13:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 17:13:26,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:26,714 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 36 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 36 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:13:26,717 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:13:26,718 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:13:26,737 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:13:26,776 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:13:26,799 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:13:26,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 17:13:26,813 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:13:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 17:13:26,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:13:26,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7, 5, 5] total 9 [2018-01-24 17:13:26,824 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:13:26,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:13:26,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:13:26,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:13:26,824 INFO L87 Difference]: Start difference. First operand 264 states and 334 transitions. Second operand 8 states. [2018-01-24 17:13:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:13:26,925 INFO L93 Difference]: Finished difference Result 420 states and 534 transitions. [2018-01-24 17:13:26,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:13:26,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-01-24 17:13:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:13:26,926 INFO L225 Difference]: With dead ends: 420 [2018-01-24 17:13:26,926 INFO L226 Difference]: Without dead ends: 238 [2018-01-24 17:13:26,927 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 229 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-01-24 17:13:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-24 17:13:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 231. [2018-01-24 17:13:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-01-24 17:13:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 291 transitions. [2018-01-24 17:13:26,944 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 291 transitions. Word has length 60 [2018-01-24 17:13:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:13:26,944 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 291 transitions. [2018-01-24 17:13:26,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:13:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 291 transitions. [2018-01-24 17:13:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-24 17:13:26,945 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:13:26,945 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:13:26,945 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:13:26,945 INFO L82 PathProgramCache]: Analyzing trace with hash 257738368, now seen corresponding path program 1 times [2018-01-24 17:13:26,945 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:13:26,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:26,946 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:13:26,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:13:26,946 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:13:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:26,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:13:27,390 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 24 DAG size of output 19 [2018-01-24 17:13:27,641 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 30 DAG size of output 24 Received shutdown request... [2018-01-24 17:13:27,979 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:13:27,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:27,979 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:13:27,979 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-01-24 17:13:27,980 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [94], [97], [99], [100], [103], [106], [113], [119], [120], [123], [124], [127], [131], [137], [139], [166], [167], [171], [172], [173] [2018-01-24 17:13:27,980 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:13:27,980 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:13:27,981 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 17:13:27,981 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 17:13:27,981 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:13:27,981 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:13:27,981 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:13:27,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:13:27,986 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:13:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:13:28,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:13:28,023 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 17:13:28,023 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 17:13:28,026 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 17:13:28,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:13:28 BoogieIcfgContainer [2018-01-24 17:13:28,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:13:28,027 INFO L168 Benchmark]: Toolchain (without parser) took 38044.96 ms. Allocated memory was 305.7 MB in the beginning and 1.0 GB in the end (delta: 738.2 MB). Free memory was 263.6 MB in the beginning and 541.4 MB in the end (delta: -277.8 MB). Peak memory consumption was 460.3 MB. Max. memory is 5.3 GB. [2018-01-24 17:13:28,028 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 305.7 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:13:28,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.63 ms. Allocated memory is still 305.7 MB. Free memory was 262.6 MB in the beginning and 251.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-24 17:13:28,028 INFO L168 Benchmark]: Boogie Preprocessor took 37.94 ms. Allocated memory is still 305.7 MB. Free memory was 251.5 MB in the beginning and 249.5 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:13:28,028 INFO L168 Benchmark]: RCFGBuilder took 502.32 ms. Allocated memory is still 305.7 MB. Free memory was 249.5 MB in the beginning and 219.5 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:13:28,029 INFO L168 Benchmark]: TraceAbstraction took 37261.14 ms. Allocated memory was 305.7 MB in the beginning and 1.0 GB in the end (delta: 738.2 MB). Free memory was 219.5 MB in the beginning and 541.4 MB in the end (delta: -322.0 MB). Peak memory consumption was 416.2 MB. Max. memory is 5.3 GB. [2018-01-24 17:13:28,030 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.13 ms. Allocated memory is still 305.7 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 233.63 ms. Allocated memory is still 305.7 MB. Free memory was 262.6 MB in the beginning and 251.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.94 ms. Allocated memory is still 305.7 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 502.32 ms. Allocated memory is still 305.7 MB. Free memory was 249.5 MB in the beginning and 219.5 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 37261.14 ms. Allocated memory was 305.7 MB in the beginning and 1.0 GB in the end (delta: 738.2 MB). Free memory was 219.5 MB in the beginning and 541.4 MB in the end (delta: -322.0 MB). Peak memory consumption was 416.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 324 LocStat_NO_SUPPORTING_DISEQUALITIES : 51 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 76 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 39 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.435841 RENAME_VARIABLES(MILLISECONDS) : 0.342713 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.398585 PROJECTAWAY(MILLISECONDS) : 0.326585 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001787 DISJOIN(MILLISECONDS) : 0.723918 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.372990 ADD_EQUALITY(MILLISECONDS) : 0.020949 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.024015 #CONJOIN_DISJUNCTIVE : 109 #RENAME_VARIABLES : 190 #UNFREEZE : 0 #CONJOIN : 199 #PROJECTAWAY : 129 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 31 #RENAME_VARIABLES_DISJUNCTIVE : 173 #ADD_EQUALITY : 95 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 347 LocStat_NO_SUPPORTING_DISEQUALITIES : 48 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 40 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 103 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 48 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.574973 RENAME_VARIABLES(MILLISECONDS) : 0.601562 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.285788 PROJECTAWAY(MILLISECONDS) : 0.243569 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001956 DISJOIN(MILLISECONDS) : 0.606634 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.650907 ADD_EQUALITY(MILLISECONDS) : 0.015106 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012194 #CONJOIN_DISJUNCTIVE : 153 #RENAME_VARIABLES : 276 #UNFREEZE : 0 #CONJOIN : 286 #PROJECTAWAY : 180 #ADD_WEAK_EQUALITY : 34 #DISJOIN : 32 #RENAME_VARIABLES_DISJUNCTIVE : 247 #ADD_EQUALITY : 114 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 36 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 360 LocStat_NO_SUPPORTING_DISEQUALITIES : 48 LocStat_NO_DISJUNCTIONS : -72 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 42 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 105 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 50 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.879819 RENAME_VARIABLES(MILLISECONDS) : 0.542298 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.421147 PROJECTAWAY(MILLISECONDS) : 0.418446 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002774 DISJOIN(MILLISECONDS) : 0.837671 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.590497 ADD_EQUALITY(MILLISECONDS) : 0.013699 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013250 #CONJOIN_DISJUNCTIVE : 165 #RENAME_VARIABLES : 300 #UNFREEZE : 0 #CONJOIN : 298 #PROJECTAWAY : 193 #ADD_WEAK_EQUALITY : 34 #DISJOIN : 32 #RENAME_VARIABLES_DISJUNCTIVE : 271 #ADD_EQUALITY : 116 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 307 LocStat_NO_SUPPORTING_DISEQUALITIES : 56 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 73 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.483934 RENAME_VARIABLES(MILLISECONDS) : 0.286825 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.450412 PROJECTAWAY(MILLISECONDS) : 0.078220 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001441 DISJOIN(MILLISECONDS) : 0.607738 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.319099 ADD_EQUALITY(MILLISECONDS) : 0.010179 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.022054 #CONJOIN_DISJUNCTIVE : 97 #RENAME_VARIABLES : 169 #UNFREEZE : 0 #CONJOIN : 190 #PROJECTAWAY : 116 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 27 #RENAME_VARIABLES_DISJUNCTIVE : 149 #ADD_EQUALITY : 92 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 307 LocStat_NO_SUPPORTING_DISEQUALITIES : 55 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 75 TransStat_NO_SUPPORTING_DISEQUALITIES : 10 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.817309 RENAME_VARIABLES(MILLISECONDS) : 0.266311 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.376371 PROJECTAWAY(MILLISECONDS) : 0.043636 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001119 DISJOIN(MILLISECONDS) : 0.590976 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.294100 ADD_EQUALITY(MILLISECONDS) : 0.013340 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006786 #CONJOIN_DISJUNCTIVE : 97 #RENAME_VARIABLES : 170 #UNFREEZE : 0 #CONJOIN : 191 #PROJECTAWAY : 118 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 28 #RENAME_VARIABLES_DISJUNCTIVE : 149 #ADD_EQUALITY : 94 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 36 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 540 LocStat_NO_SUPPORTING_DISEQUALITIES : 125 LocStat_NO_DISJUNCTIONS : -72 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 41 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 95 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 47 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.692351 RENAME_VARIABLES(MILLISECONDS) : 0.384095 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.664595 PROJECTAWAY(MILLISECONDS) : 0.442253 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001140 DISJOIN(MILLISECONDS) : 0.138696 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.418561 ADD_EQUALITY(MILLISECONDS) : 0.011142 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.020429 #CONJOIN_DISJUNCTIVE : 95 #RENAME_VARIABLES : 139 #UNFREEZE : 0 #CONJOIN : 222 #PROJECTAWAY : 113 #ADD_WEAK_EQUALITY : 65 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 125 #ADD_EQUALITY : 135 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 36 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 540 LocStat_NO_SUPPORTING_DISEQUALITIES : 122 LocStat_NO_DISJUNCTIONS : -72 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 41 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 97 TransStat_NO_SUPPORTING_DISEQUALITIES : 14 TransStat_NO_DISJUNCTIONS : 48 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.730512 RENAME_VARIABLES(MILLISECONDS) : 0.331888 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.700853 PROJECTAWAY(MILLISECONDS) : 0.398859 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001111 DISJOIN(MILLISECONDS) : 0.150967 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.366134 ADD_EQUALITY(MILLISECONDS) : 0.010631 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007781 #CONJOIN_DISJUNCTIVE : 95 #RENAME_VARIABLES : 140 #UNFREEZE : 0 #CONJOIN : 223 #PROJECTAWAY : 115 #ADD_WEAK_EQUALITY : 65 #DISJOIN : 16 #RENAME_VARIABLES_DISJUNCTIVE : 125 #ADD_EQUALITY : 137 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 41 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 486 LocStat_NO_SUPPORTING_DISEQUALITIES : 91 LocStat_NO_DISJUNCTIONS : -82 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 47 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 109 TransStat_NO_SUPPORTING_DISEQUALITIES : 14 TransStat_NO_DISJUNCTIONS : 54 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.794992 RENAME_VARIABLES(MILLISECONDS) : 0.349680 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.360098 PROJECTAWAY(MILLISECONDS) : 0.046707 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000766 DISJOIN(MILLISECONDS) : 0.353588 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.388071 ADD_EQUALITY(MILLISECONDS) : 0.006397 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004768 #CONJOIN_DISJUNCTIVE : 221 #RENAME_VARIABLES : 413 #UNFREEZE : 0 #CONJOIN : 380 #PROJECTAWAY : 262 #ADD_WEAK_EQUALITY : 65 #DISJOIN : 35 #RENAME_VARIABLES_DISJUNCTIVE : 373 #ADD_EQUALITY : 149 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 43 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 505 LocStat_NO_SUPPORTING_DISEQUALITIES : 91 LocStat_NO_DISJUNCTIONS : -86 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 49 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 114 TransStat_NO_SUPPORTING_DISEQUALITIES : 14 TransStat_NO_DISJUNCTIONS : 56 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.460567 RENAME_VARIABLES(MILLISECONDS) : 0.190798 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.208895 PROJECTAWAY(MILLISECONDS) : 0.024756 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000200 DISJOIN(MILLISECONDS) : 0.311647 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.210579 ADD_EQUALITY(MILLISECONDS) : 0.008149 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006894 #CONJOIN_DISJUNCTIVE : 227 #RENAME_VARIABLES : 419 #UNFREEZE : 0 #CONJOIN : 387 #PROJECTAWAY : 262 #ADD_WEAK_EQUALITY : 65 #DISJOIN : 31 #RENAME_VARIABLES_DISJUNCTIVE : 381 #ADD_EQUALITY : 154 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 46 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 543 LocStat_NO_SUPPORTING_DISEQUALITIES : 91 LocStat_NO_DISJUNCTIONS : -92 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 53 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 119 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 59 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.774618 RENAME_VARIABLES(MILLISECONDS) : 0.338655 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.355003 PROJECTAWAY(MILLISECONDS) : 0.040167 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000147 DISJOIN(MILLISECONDS) : 0.514928 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.368924 ADD_EQUALITY(MILLISECONDS) : 0.005481 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012869 #CONJOIN_DISJUNCTIVE : 238 #RENAME_VARIABLES : 433 #UNFREEZE : 0 #CONJOIN : 399 #PROJECTAWAY : 271 #ADD_WEAK_EQUALITY : 65 #DISJOIN : 30 #RENAME_VARIABLES_DISJUNCTIVE : 397 #ADD_EQUALITY : 159 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 47 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 556 LocStat_NO_SUPPORTING_DISEQUALITIES : 93 LocStat_NO_DISJUNCTIONS : -94 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 53 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 121 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 60 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.513371 RENAME_VARIABLES(MILLISECONDS) : 0.195428 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.219152 PROJECTAWAY(MILLISECONDS) : 0.023972 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000154 DISJOIN(MILLISECONDS) : 0.331468 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.227817 ADD_EQUALITY(MILLISECONDS) : 0.006117 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011194 #CONJOIN_DISJUNCTIVE : 240 #RENAME_VARIABLES : 439 #UNFREEZE : 0 #CONJOIN : 406 #PROJECTAWAY : 278 #ADD_WEAK_EQUALITY : 65 #DISJOIN : 31 #RENAME_VARIABLES_DISJUNCTIVE : 401 #ADD_EQUALITY : 159 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 11 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 47 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 556 LocStat_NO_SUPPORTING_DISEQUALITIES : 91 LocStat_NO_DISJUNCTIONS : -94 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 53 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 123 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 61 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.458078 RENAME_VARIABLES(MILLISECONDS) : 0.189121 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.204977 PROJECTAWAY(MILLISECONDS) : 0.036569 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000151 DISJOIN(MILLISECONDS) : 0.303311 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.210817 ADD_EQUALITY(MILLISECONDS) : 0.007431 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003036 #CONJOIN_DISJUNCTIVE : 240 #RENAME_VARIABLES : 443 #UNFREEZE : 0 #CONJOIN : 410 #PROJECTAWAY : 283 #ADD_WEAK_EQUALITY : 65 #DISJOIN : 34 #RENAME_VARIABLES_DISJUNCTIVE : 401 #ADD_EQUALITY : 161 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 49 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 587 LocStat_NO_SUPPORTING_DISEQUALITIES : 91 LocStat_NO_DISJUNCTIONS : -98 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 55 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 128 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 63 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.433222 RENAME_VARIABLES(MILLISECONDS) : 0.183198 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.196439 PROJECTAWAY(MILLISECONDS) : 0.021358 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000145 DISJOIN(MILLISECONDS) : 0.338822 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.204268 ADD_EQUALITY(MILLISECONDS) : 0.008119 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003017 #CONJOIN_DISJUNCTIVE : 250 #RENAME_VARIABLES : 459 #UNFREEZE : 0 #CONJOIN : 423 #PROJECTAWAY : 293 #ADD_WEAK_EQUALITY : 65 #DISJOIN : 36 #RENAME_VARIABLES_DISJUNCTIVE : 417 #ADD_EQUALITY : 166 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 48 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 585 LocStat_NO_SUPPORTING_DISEQUALITIES : 91 LocStat_NO_DISJUNCTIONS : -96 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 55 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 126 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 62 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.452259 RENAME_VARIABLES(MILLISECONDS) : 0.185148 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.196407 PROJECTAWAY(MILLISECONDS) : 0.021319 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000156 DISJOIN(MILLISECONDS) : 0.282755 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.208954 ADD_EQUALITY(MILLISECONDS) : 0.005457 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014304 #CONJOIN_DISJUNCTIVE : 250 #RENAME_VARIABLES : 455 #UNFREEZE : 0 #CONJOIN : 419 #PROJECTAWAY : 284 #ADD_WEAK_EQUALITY : 65 #DISJOIN : 33 #RENAME_VARIABLES_DISJUNCTIVE : 417 #ADD_EQUALITY : 164 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 11 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 49 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 541 LocStat_NO_SUPPORTING_DISEQUALITIES : 92 LocStat_NO_DISJUNCTIONS : -98 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 56 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 135 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 65 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.429834 RENAME_VARIABLES(MILLISECONDS) : 0.181292 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.195354 PROJECTAWAY(MILLISECONDS) : 0.020249 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000597 DISJOIN(MILLISECONDS) : 0.296341 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.200224 ADD_EQUALITY(MILLISECONDS) : 0.005269 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005920 #CONJOIN_DISJUNCTIVE : 276 #RENAME_VARIABLES : 519 #UNFREEZE : 0 #CONJOIN : 472 #PROJECTAWAY : 318 #ADD_WEAK_EQUALITY : 66 #DISJOIN : 35 #RENAME_VARIABLES_DISJUNCTIVE : 471 #ADD_EQUALITY : 167 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 51 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 637 LocStat_NO_SUPPORTING_DISEQUALITIES : 93 LocStat_NO_DISJUNCTIONS : -102 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 57 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 128 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 64 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.452972 RENAME_VARIABLES(MILLISECONDS) : 0.193663 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.217928 PROJECTAWAY(MILLISECONDS) : 0.020257 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000147 DISJOIN(MILLISECONDS) : 0.278202 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.212786 ADD_EQUALITY(MILLISECONDS) : 0.010494 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009334 #CONJOIN_DISJUNCTIVE : 259 #RENAME_VARIABLES : 471 #UNFREEZE : 0 #CONJOIN : 430 #PROJECTAWAY : 298 #ADD_WEAK_EQUALITY : 65 #DISJOIN : 35 #RENAME_VARIABLES_DISJUNCTIVE : 433 #ADD_EQUALITY : 166 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 11 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 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 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 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 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 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 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 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 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 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 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 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 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 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 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 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 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 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 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 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 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 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 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 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 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 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 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 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 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 101 locations, 41 error locations. TIMEOUT Result, 37.2s OverallTime, 34 OverallIterations, 3 TraceHistogramMax, 19.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2534 SDtfs, 7330 SDslu, 7970 SDs, 0 SdLazy, 7008 SolverSat, 649 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 2451 GetRequests, 1859 SyntacticMatches, 53 SemanticMatches, 539 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 5313 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.1s AbstIntTime, 17 AbstIntIterations, 2 AbstIntStrong, 0.9521640859140859 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 7.790909090909091 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 2030 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 2245 NumberOfCodeBlocks, 2245 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 2570 ConstructedInterpolants, 172 QuantifiedInterpolants, 844920 SizeOfPredicates, 150 NumberOfNonLiveVariables, 4343 ConjunctsInSsa, 273 ConjunctsInUnsatCore, 62 InterpolantComputations, 28 PerfectInterpolantSequences, 320/601 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/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-5-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-5-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-6-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-6-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-7-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-7-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-8-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-8-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-9-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-9-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-10-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-10-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-11-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-11-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-12-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-12-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-13-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-13-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-14-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-14-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-15-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-15-2018-01-24_17-13-28-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-13-28-051.csv Completed graceful shutdown