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.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:01:00,148 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:01:00,150 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:01:00,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:01:00,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:01:00,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:01:00,167 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:01:00,168 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:01:00,170 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:01:00,171 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:01:00,171 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:01:00,171 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:01:00,172 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:01:00,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:01:00,174 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:01:00,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:01:00,179 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:01:00,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:01:00,182 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:01:00,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:01:00,186 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:01:00,186 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:01:00,186 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:01:00,187 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:01:00,188 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:01:00,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:01:00,190 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:01:00,190 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:01:00,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:01:00,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:01:00,191 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:01:00,192 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.epf [2018-01-24 16:01:00,202 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:01:00,202 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:01:00,203 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:01:00,203 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:01:00,203 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:01:00,203 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:01:00,204 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:01:00,204 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:01:00,204 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:01:00,205 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:01:00,205 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:01:00,205 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:01:00,205 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:01:00,205 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:01:00,206 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:01:00,206 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:01:00,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:01:00,206 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:01:00,206 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:01:00,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:01:00,207 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:01:00,207 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:01:00,207 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:01:00,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:01:00,208 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:01:00,208 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:01:00,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:01:00,208 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:01:00,208 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:01:00,209 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:01:00,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:01:00,209 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:01:00,209 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:01:00,210 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:01:00,210 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:01:00,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:01:00,283 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:01:00,287 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:01:00,288 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:01:00,289 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:01:00,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-01-24 16:01:00,468 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:01:00,474 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:01:00,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:01:00,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:01:00,481 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:01:00,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:01:00" (1/1) ... [2018-01-24 16:01:00,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42577689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:00, skipping insertion in model container [2018-01-24 16:01:00,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:01:00" (1/1) ... [2018-01-24 16:01:00,502 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:01:00,555 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:01:00,666 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:01:00,682 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:01:00,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:00 WrapperNode [2018-01-24 16:01:00,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:01:00,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:01:00,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:01:00,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:01:00,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:00" (1/1) ... [2018-01-24 16:01:00,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:00" (1/1) ... [2018-01-24 16:01:00,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:00" (1/1) ... [2018-01-24 16:01:00,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:00" (1/1) ... [2018-01-24 16:01:00,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:00" (1/1) ... [2018-01-24 16:01:00,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:00" (1/1) ... [2018-01-24 16:01:00,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:00" (1/1) ... [2018-01-24 16:01:00,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:01:00,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:01:00,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:01:00,728 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:01:00,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:00" (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 16:01:00,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:01:00,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:01:00,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 16:01:00,773 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-01-24 16:01:00,773 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-01-24 16:01:00,774 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-01-24 16:01:00,774 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-01-24 16:01:00,774 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-01-24 16:01:00,774 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 16:01:00,774 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:01:00,774 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:01:00,774 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:01:00,775 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:01:00,775 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:01:00,775 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:01:00,775 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:01:00,775 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:01:00,775 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:01:00,776 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 16:01:00,776 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-01-24 16:01:00,776 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-01-24 16:01:00,776 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-01-24 16:01:00,776 INFO L128 BoogieDeclarations]: Found specification of procedure probe_19 [2018-01-24 16:01:00,777 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-01-24 16:01:00,777 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 16:01:00,777 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:01:00,777 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:01:00,777 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:01:01,030 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:01:01,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:01:01 BoogieIcfgContainer [2018-01-24 16:01:01,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:01:01,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:01:01,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:01:01,034 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:01:01,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:01:00" (1/3) ... [2018-01-24 16:01:01,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49492490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:01:01, skipping insertion in model container [2018-01-24 16:01:01,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:00" (2/3) ... [2018-01-24 16:01:01,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49492490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:01:01, skipping insertion in model container [2018-01-24 16:01:01,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:01:01" (3/3) ... [2018-01-24 16:01:01,037 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-01-24 16:01:01,046 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:01:01,053 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-24 16:01:01,089 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:01:01,090 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:01:01,090 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:01:01,090 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:01:01,090 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:01:01,090 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:01:01,090 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:01:01,090 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:01:01,091 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:01:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-01-24 16:01:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:01:01,117 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:01,117 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:01,118 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 16:01:01,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506467, now seen corresponding path program 1 times [2018-01-24 16:01:01,123 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:01,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:01,169 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:01,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:01,170 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:01,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:01,370 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 16:01:01,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:01,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:01:01,373 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:01,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:01:01,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:01:01,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:01:01,455 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 6 states. [2018-01-24 16:01:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:01,905 INFO L93 Difference]: Finished difference Result 139 states and 163 transitions. [2018-01-24 16:01:01,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:01:01,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-24 16:01:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:01,917 INFO L225 Difference]: With dead ends: 139 [2018-01-24 16:01:01,917 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 16:01:01,920 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:01:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 16:01:01,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2018-01-24 16:01:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 16:01:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-01-24 16:01:01,961 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-01-24 16:01:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:01,961 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-01-24 16:01:01,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:01:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-01-24 16:01:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:01:01,963 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:01,963 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:01,964 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 16:01:01,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506468, now seen corresponding path program 1 times [2018-01-24 16:01:01,964 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:01,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:01,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:01,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:01,967 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:01,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:02,113 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 16:01:02,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:02,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:01:02,114 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:02,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:01:02,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:01:02,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:01:02,116 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 6 states. [2018-01-24 16:01:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:02,409 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2018-01-24 16:01:02,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:01:02,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-24 16:01:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:02,411 INFO L225 Difference]: With dead ends: 129 [2018-01-24 16:01:02,412 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 16:01:02,412 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:01:02,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 16:01:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-01-24 16:01:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 16:01:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-01-24 16:01:02,426 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 15 [2018-01-24 16:01:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:02,426 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-01-24 16:01:02,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:01:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2018-01-24 16:01:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 16:01:02,427 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:02,427 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:02,427 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 16:01:02,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488357, now seen corresponding path program 1 times [2018-01-24 16:01:02,427 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:02,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:02,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:02,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:02,429 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:02,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:02,554 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 16:01:02,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:02,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:01:02,555 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:02,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:01:02,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:01:02,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:01:02,556 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 8 states. [2018-01-24 16:01:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:02,986 INFO L93 Difference]: Finished difference Result 149 states and 177 transitions. [2018-01-24 16:01:02,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 16:01:02,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-24 16:01:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:02,988 INFO L225 Difference]: With dead ends: 149 [2018-01-24 16:01:02,988 INFO L226 Difference]: Without dead ends: 147 [2018-01-24 16:01:02,989 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:01:02,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-24 16:01:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2018-01-24 16:01:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 16:01:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2018-01-24 16:01:03,007 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 17 [2018-01-24 16:01:03,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:03,008 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2018-01-24 16:01:03,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:01:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2018-01-24 16:01:03,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 16:01:03,009 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:03,009 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:03,010 INFO L371 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 16:01:03,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488358, now seen corresponding path program 1 times [2018-01-24 16:01:03,011 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:03,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:03,013 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:03,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:03,013 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:03,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:03,143 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 16:01:03,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:03,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:01:03,144 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:03,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:01:03,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:01:03,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:01:03,145 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand 9 states. [2018-01-24 16:01:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:03,529 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2018-01-24 16:01:03,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 16:01:03,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-01-24 16:01:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:03,531 INFO L225 Difference]: With dead ends: 152 [2018-01-24 16:01:03,531 INFO L226 Difference]: Without dead ends: 149 [2018-01-24 16:01:03,532 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:01:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-24 16:01:03,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 82. [2018-01-24 16:01:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 16:01:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-01-24 16:01:03,549 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 17 [2018-01-24 16:01:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:03,549 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-01-24 16:01:03,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:01:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-01-24 16:01:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:01:03,551 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:03,551 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] [2018-01-24 16:01:03,551 INFO L371 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 16:01:03,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1193563309, now seen corresponding path program 1 times [2018-01-24 16:01:03,551 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:03,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:03,553 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:03,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:03,553 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:03,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 16:01:03,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:03,706 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:01:03,707 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 16:01:03,708 INFO L201 CegarAbsIntRunner]: [24], [27], [38], [44], [45], [46], [47], [51], [64], [66], [69], [70], [77], [106], [108], [109], [110], [111], [112], [114], [118], [119], [120] [2018-01-24 16:01:03,760 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:01:03,760 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:01:04,276 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 16:01:04,277 INFO L268 AbstractInterpreter]: Visited 18 different actions 18 times. Never merged. Never widened. Never found a fixpoint. Largest state had 21 variables. [2018-01-24 16:01:04,296 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 16:01:04,652 INFO L232 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 51.57% of their original sizes. [2018-01-24 16:01:04,652 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 16:01:04,866 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_probe_19_~a.offset 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| c_probe_19_~a.base) .cse3)) (.cse0 (select (select |c_#memory_$Pointer$.base| c_probe_19_~a.base) .cse3)) (.cse2 (select |c_#valid| 0))) (and (not (= 0 c_probe_19_~a.base)) (= .cse0 .cse1) (= 1 (select |c_#valid| c_probe_19_~a.base)) (not (= |c_#valid| |c_#length|)) (= .cse1 .cse2) (= 0 .cse0) (= (select |c_#length| c_probe_19_~a.base) 8) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (or (not (= v_weq0_1 c_probe_19_~a.base)) (not (= v_weq1_1 (+ c_probe_19_~a.offset 4))) (= (select (select |c_#memory_$Pointer$.base| v_weq0_1) v_weq1_1) (select (select |c_#memory_$Pointer$.offset| v_weq0_1) v_weq1_1)))) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 (+ c_probe_19_~a.offset 4))) (= (select (select |c_#memory_$Pointer$.base| c_probe_19_~a.base) v_weq0_1) (select (select |c_#memory_$Pointer$.offset| c_probe_19_~a.base) v_weq0_1)))) (= .cse2 c_probe_19_~a.offset)))) is different from false [2018-01-24 16:01:04,885 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 16:01:04,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:01:04,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-24 16:01:04,886 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:04,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 16:01:04,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 16:01:04,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=138, Unknown=1, NotChecked=24, Total=210 [2018-01-24 16:01:04,888 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 15 states. [2018-01-24 16:01:07,756 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_probe_19_~a.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_probe_19_~a.base) .cse3)) (.cse2 (select (select |c_#memory_$Pointer$.offset| c_probe_19_~a.base) .cse3)) (.cse1 (select |c_#valid| 0))) (and (= 1 (select |c_#valid| c_probe_19_~a.base)) (= 0 .cse0) (= |c_probe_19_#t~ret7.offset| 0) (= (select |c_#length| c_probe_19_~a.base) 8) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (or (not (= v_weq0_1 c_probe_19_~a.base)) (not (= v_weq1_1 (+ c_probe_19_~a.offset 4))) (= (select (select |c_#memory_$Pointer$.base| v_weq0_1) v_weq1_1) (select (select |c_#memory_$Pointer$.offset| v_weq0_1) v_weq1_1)))) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 (+ c_probe_19_~a.offset 4))) (= (select (select |c_#memory_$Pointer$.base| c_probe_19_~a.base) v_weq0_1) (select (select |c_#memory_$Pointer$.offset| c_probe_19_~a.base) v_weq0_1)))) (= |c_#NULL.base| .cse1) (= .cse1 c_probe_19_~a.offset) (not (= 0 c_probe_19_~a.base)) (= .cse0 .cse2) (= |c_#NULL.offset| |c_#NULL.base|) (= |c_old(#NULL.offset)| |c_#NULL.offset|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#NULL.base)| |c_#NULL.base|) (not (= |c_#valid| |c_#length|)) (= .cse2 .cse1) (= |c_probe_19_#t~ret7.base| .cse1) (= 0 |c_#NULL.offset|) (= 0 |c_probe_19_#t~ret7.base|) (forall ((v_weq0_1 Int)) (or (= (select |c_old(#valid)| v_weq0_1) (select |c_#valid| v_weq0_1)) (and (= |c_#NULL.offset| |c_#NULL.base|) (= v_weq0_1 |c_#NULL.offset|) (= 0 v_weq0_1) (= |c_#NULL.base| (select |c_#valid| 0)))))))) is different from false [2018-01-24 16:01:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:11,306 INFO L93 Difference]: Finished difference Result 204 states and 219 transitions. [2018-01-24 16:01:11,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 16:01:11,328 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-01-24 16:01:11,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:11,329 INFO L225 Difference]: With dead ends: 204 [2018-01-24 16:01:11,329 INFO L226 Difference]: Without dead ends: 136 [2018-01-24 16:01:11,330 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=341, Unknown=2, NotChecked=82, Total=552 [2018-01-24 16:01:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-24 16:01:11,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 111. [2018-01-24 16:01:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-24 16:01:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2018-01-24 16:01:11,349 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 26 [2018-01-24 16:01:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:11,349 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2018-01-24 16:01:11,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 16:01:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2018-01-24 16:01:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:01:11,351 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:11,351 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 16:01:11,351 INFO L371 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 16:01:11,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443383, now seen corresponding path program 1 times [2018-01-24 16:01:11,351 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:11,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:11,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:11,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:11,353 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:11,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:11,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:11,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:01:11,433 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:11,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:01:11,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:01:11,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:01:11,433 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand 8 states. [2018-01-24 16:01:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:11,597 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2018-01-24 16:01:11,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:01:11,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-01-24 16:01:11,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:11,598 INFO L225 Difference]: With dead ends: 125 [2018-01-24 16:01:11,599 INFO L226 Difference]: Without dead ends: 124 [2018-01-24 16:01:11,599 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:01:11,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-24 16:01:11,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2018-01-24 16:01:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-24 16:01:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2018-01-24 16:01:11,621 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 26 [2018-01-24 16:01:11,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:11,621 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2018-01-24 16:01:11,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:01:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2018-01-24 16:01:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:01:11,622 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:11,623 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 16:01:11,623 INFO L371 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 16:01:11,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443382, now seen corresponding path program 1 times [2018-01-24 16:01:11,623 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:11,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:11,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:11,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:11,625 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:11,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:11,679 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 16:01:11,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:11,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:01:11,680 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:11,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:01:11,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:01:11,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:01:11,680 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand 6 states. [2018-01-24 16:01:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:11,758 INFO L93 Difference]: Finished difference Result 147 states and 163 transitions. [2018-01-24 16:01:11,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:01:11,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 16:01:11,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:11,760 INFO L225 Difference]: With dead ends: 147 [2018-01-24 16:01:11,760 INFO L226 Difference]: Without dead ends: 106 [2018-01-24 16:01:11,760 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:01:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-24 16:01:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2018-01-24 16:01:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 16:01:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-01-24 16:01:11,773 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 26 [2018-01-24 16:01:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:11,774 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-01-24 16:01:11,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:01:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-01-24 16:01:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:01:11,775 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:11,775 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:11,775 INFO L371 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 16:01:11,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1472265041, now seen corresponding path program 1 times [2018-01-24 16:01:11,775 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:11,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:11,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:11,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:11,777 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:11,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:11,885 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 16:01:11,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:11,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:01:11,885 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:11,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:01:11,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:01:11,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:01:11,886 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 6 states. [2018-01-24 16:01:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:12,107 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-01-24 16:01:12,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:01:12,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 16:01:12,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:12,109 INFO L225 Difference]: With dead ends: 118 [2018-01-24 16:01:12,109 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 16:01:12,109 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:01:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 16:01:12,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2018-01-24 16:01:12,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 16:01:12,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-01-24 16:01:12,124 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 28 [2018-01-24 16:01:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:12,125 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-01-24 16:01:12,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:01:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2018-01-24 16:01:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:01:12,126 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:12,126 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:12,126 INFO L371 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 16:01:12,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1472265042, now seen corresponding path program 1 times [2018-01-24 16:01:12,126 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:12,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:12,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:12,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:12,128 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:12,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:12,244 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 16:01:12,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:12,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:01:12,245 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:12,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:01:12,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:01:12,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:01:12,246 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 9 states. [2018-01-24 16:01:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:12,511 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2018-01-24 16:01:12,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:01:12,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-24 16:01:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:12,512 INFO L225 Difference]: With dead ends: 118 [2018-01-24 16:01:12,512 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 16:01:12,512 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-01-24 16:01:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 16:01:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2018-01-24 16:01:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 16:01:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-01-24 16:01:12,526 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 28 [2018-01-24 16:01:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:12,526 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-01-24 16:01:12,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:01:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-01-24 16:01:12,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:01:12,527 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:12,527 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] [2018-01-24 16:01:12,528 INFO L371 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 16:01:12,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860499, now seen corresponding path program 1 times [2018-01-24 16:01:12,528 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:12,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:12,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:12,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:12,529 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:12,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:12,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:12,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:01:12,623 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:12,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:01:12,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:01:12,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:01:12,623 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 8 states. [2018-01-24 16:01:12,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:12,869 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2018-01-24 16:01:12,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:01:12,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-01-24 16:01:12,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:12,871 INFO L225 Difference]: With dead ends: 122 [2018-01-24 16:01:12,871 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 16:01:12,871 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:01:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 16:01:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2018-01-24 16:01:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 16:01:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-01-24 16:01:12,882 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 30 [2018-01-24 16:01:12,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:12,882 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-01-24 16:01:12,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:01:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-01-24 16:01:12,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:01:12,883 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:12,883 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] [2018-01-24 16:01:12,884 INFO L371 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 16:01:12,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860500, now seen corresponding path program 1 times [2018-01-24 16:01:12,884 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:12,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:12,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:12,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:12,885 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:12,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:13,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:13,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 16:01:13,163 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:13,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 16:01:13,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 16:01:13,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:01:13,164 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 12 states. [2018-01-24 16:01:13,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:13,571 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2018-01-24 16:01:13,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 16:01:13,571 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-01-24 16:01:13,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:13,572 INFO L225 Difference]: With dead ends: 130 [2018-01-24 16:01:13,572 INFO L226 Difference]: Without dead ends: 128 [2018-01-24 16:01:13,572 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-01-24 16:01:13,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-24 16:01:13,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2018-01-24 16:01:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 16:01:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-01-24 16:01:13,586 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 30 [2018-01-24 16:01:13,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:13,587 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-01-24 16:01:13,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 16:01:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-01-24 16:01:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:01:13,588 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:13,588 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 16:01:13,588 INFO L371 AbstractCegarLoop]: === Iteration 12 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 16:01:13,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1708399928, now seen corresponding path program 1 times [2018-01-24 16:01:13,589 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:13,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:13,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:13,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:13,590 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:13,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:13,659 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 16:01:13,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:13,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:01:13,660 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:13,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:01:13,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:01:13,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:01:13,660 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 4 states. [2018-01-24 16:01:13,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:13,770 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-01-24 16:01:13,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:01:13,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-24 16:01:13,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:13,771 INFO L225 Difference]: With dead ends: 110 [2018-01-24 16:01:13,771 INFO L226 Difference]: Without dead ends: 93 [2018-01-24 16:01:13,771 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:01:13,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-24 16:01:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2018-01-24 16:01:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-24 16:01:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-01-24 16:01:13,786 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 28 [2018-01-24 16:01:13,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:13,786 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-01-24 16:01:13,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:01:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-01-24 16:01:13,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:01:13,787 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:13,787 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:13,787 INFO L371 AbstractCegarLoop]: === Iteration 13 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 16:01:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash -526031434, now seen corresponding path program 1 times [2018-01-24 16:01:13,787 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:13,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:13,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:13,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:13,789 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:13,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:13,857 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 16:01:13,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:13,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:01:13,857 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:13,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:01:13,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:01:13,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:01:13,858 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 7 states. [2018-01-24 16:01:13,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:13,911 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-24 16:01:13,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:01:13,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-24 16:01:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:13,912 INFO L225 Difference]: With dead ends: 93 [2018-01-24 16:01:13,912 INFO L226 Difference]: Without dead ends: 82 [2018-01-24 16:01:13,913 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:01:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-24 16:01:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-24 16:01:13,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 16:01:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-01-24 16:01:13,926 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 30 [2018-01-24 16:01:13,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:13,927 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-01-24 16:01:13,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:01:13,927 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-01-24 16:01:13,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 16:01:13,928 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:13,928 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:13,928 INFO L371 AbstractCegarLoop]: === Iteration 14 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 16:01:13,928 INFO L82 PathProgramCache]: Analyzing trace with hash 850149805, now seen corresponding path program 1 times [2018-01-24 16:01:13,928 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:13,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:13,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:13,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:13,930 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:13,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:13,965 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 16:01:13,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:13,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:01:13,966 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:13,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:01:13,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:01:13,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:01:13,966 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 5 states. [2018-01-24 16:01:13,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:13,982 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-01-24 16:01:13,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:01:13,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-24 16:01:13,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:13,984 INFO L225 Difference]: With dead ends: 126 [2018-01-24 16:01:13,984 INFO L226 Difference]: Without dead ends: 88 [2018-01-24 16:01:13,984 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:01:13,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-24 16:01:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-01-24 16:01:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-24 16:01:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-01-24 16:01:13,999 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 37 [2018-01-24 16:01:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:14,000 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-01-24 16:01:14,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:01:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-01-24 16:01:14,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 16:01:14,001 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:14,001 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:14,001 INFO L371 AbstractCegarLoop]: === Iteration 15 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 16:01:14,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1737653486, now seen corresponding path program 1 times [2018-01-24 16:01:14,001 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:14,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:14,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:14,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:14,002 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:14,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 16:01:14,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:14,385 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:01:14,385 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-24 16:01:14,386 INFO L201 CegarAbsIntRunner]: [24], [26], [29], [30], [36], [37], [38], [41], [42], [43], [44], [45], [46], [47], [51], [64], [66], [69], [70], [77], [79], [82], [94], [98], [106], [108], [109], [110], [111], [112], [114], [118], [119], [120], [121] [2018-01-24 16:01:14,387 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:01:14,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:01:15,456 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:01:15,456 INFO L268 AbstractInterpreter]: Visited 35 different actions 53 times. Merged at 10 different actions 12 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-24 16:01:15,463 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:01:15,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:15,463 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 16:01:15,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:15,482 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:01:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:15,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:15,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 16:01:15,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 16:01:15,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:01:15,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:01:15,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:01:15,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-24 16:01:16,049 WARN L1029 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2018-01-24 16:01:16,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 16:01:16,076 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 17 [2018-01-24 16:01:16,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:01:16,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:01:16,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:01:16,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-24 16:01:16,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 16:01:16,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-24 16:01:16,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:01:16,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:01:16,235 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 16:01:16,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-24 16:01:16,238 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 16:01:16,238 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:16,872 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 32 treesize of output 28 [2018-01-24 16:01:16,873 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:223) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 16:01:16,914 INFO L168 Benchmark]: Toolchain (without parser) took 16445.10 ms. Allocated memory was 303.6 MB in the beginning and 947.9 MB in the end (delta: 644.3 MB). Free memory was 262.6 MB in the beginning and 524.3 MB in the end (delta: -261.6 MB). Peak memory consumption was 382.7 MB. Max. memory is 5.3 GB. [2018-01-24 16:01:16,914 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:01:16,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.57 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 249.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:01:16,915 INFO L168 Benchmark]: Boogie Preprocessor took 35.06 ms. Allocated memory is still 303.6 MB. Free memory was 249.5 MB in the beginning and 247.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 16:01:16,915 INFO L168 Benchmark]: RCFGBuilder took 303.62 ms. Allocated memory is still 303.6 MB. Free memory was 247.5 MB in the beginning and 223.8 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. [2018-01-24 16:01:16,916 INFO L168 Benchmark]: TraceAbstraction took 15880.99 ms. Allocated memory was 303.6 MB in the beginning and 947.9 MB in the end (delta: 644.3 MB). Free memory was 223.8 MB in the beginning and 524.3 MB in the end (delta: -300.4 MB). Peak memory consumption was 343.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:01:16,917 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.16 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.57 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 249.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.06 ms. Allocated memory is still 303.6 MB. Free memory was 249.5 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 303.62 ms. Allocated memory is still 303.6 MB. Free memory was 247.5 MB in the beginning and 223.8 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 15880.99 ms. Allocated memory was 303.6 MB in the beginning and 947.9 MB in the end (delta: 644.3 MB). Free memory was 223.8 MB in the beginning and 524.3 MB in the end (delta: -300.4 MB). Peak memory consumption was 343.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 143 LocStat_NO_SUPPORTING_DISEQUALITIES : 20 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 4 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 59 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.962524 RENAME_VARIABLES(MILLISECONDS) : 2.435467 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.304894 PROJECTAWAY(MILLISECONDS) : 0.019854 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.148268 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.499895 ADD_EQUALITY(MILLISECONDS) : 0.046445 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007817 #CONJOIN_DISJUNCTIVE : 37 #RENAME_VARIABLES : 53 #UNFREEZE : 0 #CONJOIN : 85 #PROJECTAWAY : 55 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 52 #ADD_EQUALITY : 61 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 33 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 342 LocStat_NO_SUPPORTING_DISEQUALITIES : 96 LocStat_NO_DISJUNCTIONS : -66 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 47 TransStat_MAX_WEQGRAPH_SIZE : 4 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 94 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 48 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 15.988419 RENAME_VARIABLES(MILLISECONDS) : 1.474424 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 15.947589 PROJECTAWAY(MILLISECONDS) : 0.091325 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.032343 DISJOIN(MILLISECONDS) : 0.421994 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.498889 ADD_EQUALITY(MILLISECONDS) : 0.019675 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015269 #CONJOIN_DISJUNCTIVE : 96 #RENAME_VARIABLES : 171 #UNFREEZE : 0 #CONJOIN : 194 #PROJECTAWAY : 145 #ADD_WEAK_EQUALITY : 13 #DISJOIN : 18 #RENAME_VARIABLES_DISJUNCTIVE : 168 #ADD_EQUALITY : 98 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-01-16-927.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-01-16-927.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-01-16-927.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-01-16-927.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-01-16-927.csv Received shutdown request...