./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8c45c2ff-0fb2-4ce4-8cad-9cbefd34bad1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8c45c2ff-0fb2-4ce4-8cad-9cbefd34bad1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8c45c2ff-0fb2-4ce4-8cad-9cbefd34bad1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8c45c2ff-0fb2-4ce4-8cad-9cbefd34bad1/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8c45c2ff-0fb2-4ce4-8cad-9cbefd34bad1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8c45c2ff-0fb2-4ce4-8cad-9cbefd34bad1/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 01:42:36,177 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:42:36,178 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:42:36,184 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:42:36,184 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:42:36,185 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:42:36,186 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:42:36,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:42:36,187 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:42:36,188 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:42:36,188 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:42:36,188 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:42:36,189 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:42:36,189 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:42:36,190 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:42:36,190 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:42:36,190 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:42:36,191 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:42:36,192 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:42:36,193 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:42:36,193 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:42:36,194 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:42:36,195 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:42:36,195 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:42:36,195 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:42:36,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:42:36,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:42:36,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:42:36,197 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:42:36,198 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:42:36,198 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:42:36,198 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:42:36,198 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:42:36,198 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:42:36,199 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:42:36,199 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:42:36,199 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8c45c2ff-0fb2-4ce4-8cad-9cbefd34bad1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 01:42:36,206 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:42:36,206 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:42:36,207 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 01:42:36,207 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 01:42:36,207 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 01:42:36,207 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 01:42:36,207 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 01:42:36,208 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:42:36,208 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:42:36,208 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:42:36,208 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:42:36,208 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:42:36,208 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 01:42:36,208 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 01:42:36,208 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 01:42:36,208 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:42:36,208 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 01:42:36,208 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 01:42:36,208 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 01:42:36,208 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:42:36,209 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:42:36,209 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 01:42:36,209 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 01:42:36,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:42:36,209 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:42:36,209 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 01:42:36,209 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 01:42:36,209 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 01:42:36,209 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 01:42:36,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 01:42:36,209 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8c45c2ff-0fb2-4ce4-8cad-9cbefd34bad1/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd [2018-12-02 01:42:36,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:42:36,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:42:36,235 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:42:36,236 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:42:36,236 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:42:36,237 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8c45c2ff-0fb2-4ce4-8cad-9cbefd34bad1/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i [2018-12-02 01:42:36,279 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8c45c2ff-0fb2-4ce4-8cad-9cbefd34bad1/bin-2019/uautomizer/data/da250f0e7/aa24973ea2cc4db7966668ff084d48af/FLAGbe2582a34 [2018-12-02 01:42:36,717 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:42:36,717 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8c45c2ff-0fb2-4ce4-8cad-9cbefd34bad1/sv-benchmarks/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i [2018-12-02 01:42:36,723 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8c45c2ff-0fb2-4ce4-8cad-9cbefd34bad1/bin-2019/uautomizer/data/da250f0e7/aa24973ea2cc4db7966668ff084d48af/FLAGbe2582a34 [2018-12-02 01:42:36,731 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8c45c2ff-0fb2-4ce4-8cad-9cbefd34bad1/bin-2019/uautomizer/data/da250f0e7/aa24973ea2cc4db7966668ff084d48af [2018-12-02 01:42:36,733 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:42:36,734 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:42:36,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:42:36,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:42:36,736 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:42:36,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:42:36" (1/1) ... [2018-12-02 01:42:36,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7453ceb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:36, skipping insertion in model container [2018-12-02 01:42:36,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:42:36" (1/1) ... [2018-12-02 01:42:36,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:42:36,762 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:42:36,910 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:42:36,915 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:42:36,976 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:42:36,995 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:42:36,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:36 WrapperNode [2018-12-02 01:42:36,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:42:36,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 01:42:36,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 01:42:36,996 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 01:42:37,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:36" (1/1) ... [2018-12-02 01:42:37,009 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:36" (1/1) ... [2018-12-02 01:42:37,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 01:42:37,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:42:37,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:42:37,014 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:42:37,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:36" (1/1) ... [2018-12-02 01:42:37,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:36" (1/1) ... [2018-12-02 01:42:37,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:36" (1/1) ... [2018-12-02 01:42:37,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:36" (1/1) ... [2018-12-02 01:42:37,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:36" (1/1) ... [2018-12-02 01:42:37,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:36" (1/1) ... [2018-12-02 01:42:37,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:36" (1/1) ... [2018-12-02 01:42:37,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:42:37,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:42:37,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:42:37,036 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:42:37,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c45c2ff-0fb2-4ce4-8cad-9cbefd34bad1/bin-2019/uautomizer/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-12-02 01:42:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 01:42:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 01:42:37,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 01:42:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 01:42:37,068 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 01:42:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 01:42:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 01:42:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 01:42:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:42:37,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:42:37,311 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:42:37,311 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-12-02 01:42:37,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:42:37 BoogieIcfgContainer [2018-12-02 01:42:37,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:42:37,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 01:42:37,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 01:42:37,314 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 01:42:37,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:42:36" (1/3) ... [2018-12-02 01:42:37,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2033e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:42:37, skipping insertion in model container [2018-12-02 01:42:37,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:36" (2/3) ... [2018-12-02 01:42:37,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2033e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:42:37, skipping insertion in model container [2018-12-02 01:42:37,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:42:37" (3/3) ... [2018-12-02 01:42:37,316 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01_false-unreach-call_false-valid-memcleanup.i [2018-12-02 01:42:37,322 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 01:42:37,327 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-12-02 01:42:37,336 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-12-02 01:42:37,353 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 01:42:37,354 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 01:42:37,354 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 01:42:37,354 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 01:42:37,354 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:42:37,354 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:42:37,354 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 01:42:37,354 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:42:37,354 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 01:42:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2018-12-02 01:42:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-02 01:42:37,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:37,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:42:37,371 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:37,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:37,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1861451205, now seen corresponding path program 1 times [2018-12-02 01:42:37,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:42:37,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:42:37,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:37,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:37,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:42:37,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:42:37,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:42:37,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:42:37,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:42:37,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:42:37,473 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2018-12-02 01:42:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:37,505 INFO L93 Difference]: Finished difference Result 186 states and 302 transitions. [2018-12-02 01:42:37,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:42:37,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-02 01:42:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:37,512 INFO L225 Difference]: With dead ends: 186 [2018-12-02 01:42:37,512 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 01:42:37,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:42:37,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 01:42:37,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2018-12-02 01:42:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-02 01:42:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-12-02 01:42:37,536 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 8 [2018-12-02 01:42:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:37,537 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-12-02 01:42:37,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:42:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-12-02 01:42:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 01:42:37,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:37,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:42:37,538 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:37,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:37,538 INFO L82 PathProgramCache]: Analyzing trace with hash -276606363, now seen corresponding path program 1 times [2018-12-02 01:42:37,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:42:37,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:42:37,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:37,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:37,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:42:37,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:42:37,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:42:37,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:42:37,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:42:37,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:42:37,563 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 3 states. [2018-12-02 01:42:37,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:37,575 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-12-02 01:42:37,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:42:37,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-02 01:42:37,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:37,576 INFO L225 Difference]: With dead ends: 84 [2018-12-02 01:42:37,576 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 01:42:37,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:42:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 01:42:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-02 01:42:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 01:42:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-12-02 01:42:37,581 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 14 [2018-12-02 01:42:37,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:37,581 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-12-02 01:42:37,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:42:37,581 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-12-02 01:42:37,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 01:42:37,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:37,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:42:37,582 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:37,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:37,582 INFO L82 PathProgramCache]: Analyzing trace with hash -276604441, now seen corresponding path program 1 times [2018-12-02 01:42:37,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:42:37,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:42:37,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:37,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:37,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:42:37,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:42:37,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:42:37,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:42:37,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:42:37,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:42:37,615 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 4 states. [2018-12-02 01:42:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:37,653 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-12-02 01:42:37,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:42:37,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-02 01:42:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:37,654 INFO L225 Difference]: With dead ends: 83 [2018-12-02 01:42:37,654 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 01:42:37,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:42:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 01:42:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-12-02 01:42:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 01:42:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-12-02 01:42:37,658 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 14 [2018-12-02 01:42:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:37,659 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2018-12-02 01:42:37,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:42:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-12-02 01:42:37,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 01:42:37,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:37,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:42:37,659 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:37,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:37,660 INFO L82 PathProgramCache]: Analyzing trace with hash -960000523, now seen corresponding path program 1 times [2018-12-02 01:42:37,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:42:37,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:42:37,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:37,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:37,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:42:37,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:42:37,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:42:37,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:42:37,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:42:37,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:42:37,701 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 4 states. [2018-12-02 01:42:37,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:37,779 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2018-12-02 01:42:37,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:42:37,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-02 01:42:37,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:37,780 INFO L225 Difference]: With dead ends: 199 [2018-12-02 01:42:37,780 INFO L226 Difference]: Without dead ends: 132 [2018-12-02 01:42:37,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:42:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-02 01:42:37,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 81. [2018-12-02 01:42:37,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-02 01:42:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-12-02 01:42:37,785 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 19 [2018-12-02 01:42:37,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:37,785 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-12-02 01:42:37,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:42:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-12-02 01:42:37,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 01:42:37,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:37,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:42:37,786 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:37,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:37,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1769347149, now seen corresponding path program 1 times [2018-12-02 01:42:37,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:42:37,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:42:37,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:37,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:37,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:42:37,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:42:37,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:42:37,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:42:37,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:42:37,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:42:37,822 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 5 states. [2018-12-02 01:42:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:37,904 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2018-12-02 01:42:37,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:42:37,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-02 01:42:37,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:37,906 INFO L225 Difference]: With dead ends: 126 [2018-12-02 01:42:37,906 INFO L226 Difference]: Without dead ends: 122 [2018-12-02 01:42:37,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:42:37,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-02 01:42:37,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2018-12-02 01:42:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 01:42:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-12-02 01:42:37,913 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 19 [2018-12-02 01:42:37,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:37,914 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-12-02 01:42:37,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:42:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-12-02 01:42:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 01:42:37,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:37,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:42:37,915 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:37,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:37,915 INFO L82 PathProgramCache]: Analyzing trace with hash 984817432, now seen corresponding path program 1 times [2018-12-02 01:42:37,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:42:37,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:42:37,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:37,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:37,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:42:37,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:42:37,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:42:37,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:42:37,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:42:37,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:42:37,954 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 4 states. [2018-12-02 01:42:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:37,995 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-12-02 01:42:37,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:42:37,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-02 01:42:37,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:37,996 INFO L225 Difference]: With dead ends: 136 [2018-12-02 01:42:37,996 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 01:42:37,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:42:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 01:42:38,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 76. [2018-12-02 01:42:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 01:42:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-12-02 01:42:38,001 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 20 [2018-12-02 01:42:38,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:38,002 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-12-02 01:42:38,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:42:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-12-02 01:42:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 01:42:38,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:38,003 INFO L402 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] [2018-12-02 01:42:38,003 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:38,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:38,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1725931075, now seen corresponding path program 1 times [2018-12-02 01:42:38,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:42:38,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:42:38,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:38,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:38,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:42:38,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:42:38,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:42:38,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:42:38,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:42:38,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:42:38,026 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 3 states. [2018-12-02 01:42:38,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:38,036 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2018-12-02 01:42:38,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:42:38,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 01:42:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:38,037 INFO L225 Difference]: With dead ends: 141 [2018-12-02 01:42:38,037 INFO L226 Difference]: Without dead ends: 100 [2018-12-02 01:42:38,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:42:38,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-02 01:42:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2018-12-02 01:42:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 01:42:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-12-02 01:42:38,042 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 24 [2018-12-02 01:42:38,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:38,042 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-12-02 01:42:38,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:42:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2018-12-02 01:42:38,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 01:42:38,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:38,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:42:38,043 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:38,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:38,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1964251274, now seen corresponding path program 1 times [2018-12-02 01:42:38,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:42:38,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:42:38,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:38,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:38,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:42:38,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:42:38,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:42:38,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:42:38,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:42:38,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:42:38,066 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 3 states. [2018-12-02 01:42:38,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:38,081 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2018-12-02 01:42:38,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:42:38,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 01:42:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:38,082 INFO L225 Difference]: With dead ends: 79 [2018-12-02 01:42:38,082 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 01:42:38,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:42:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 01:42:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-02 01:42:38,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 01:42:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-12-02 01:42:38,086 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 25 [2018-12-02 01:42:38,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:38,086 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-12-02 01:42:38,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:42:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-12-02 01:42:38,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 01:42:38,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:38,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:42:38,088 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:38,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash 639264193, now seen corresponding path program 1 times [2018-12-02 01:42:38,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:42:38,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:42:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:38,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:42:38,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:42:38,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:42:38,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:42:38,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:42:38,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:42:38,109 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 3 states. [2018-12-02 01:42:38,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:38,118 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-12-02 01:42:38,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:42:38,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 01:42:38,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:38,120 INFO L225 Difference]: With dead ends: 80 [2018-12-02 01:42:38,120 INFO L226 Difference]: Without dead ends: 78 [2018-12-02 01:42:38,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:42:38,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-02 01:42:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-02 01:42:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-02 01:42:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-12-02 01:42:38,125 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 27 [2018-12-02 01:42:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:38,125 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-12-02 01:42:38,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:42:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-12-02 01:42:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 01:42:38,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:38,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:42:38,127 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:38,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:38,127 INFO L82 PathProgramCache]: Analyzing trace with hash 639266115, now seen corresponding path program 1 times [2018-12-02 01:42:38,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:42:38,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:42:38,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:38,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:38,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:42:38,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:42:38,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:42:38,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:42:38,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:42:38,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:42:38,161 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 4 states. [2018-12-02 01:42:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:38,210 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2018-12-02 01:42:38,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:42:38,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-02 01:42:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:38,211 INFO L225 Difference]: With dead ends: 79 [2018-12-02 01:42:38,211 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 01:42:38,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:42:38,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 01:42:38,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-12-02 01:42:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 01:42:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-12-02 01:42:38,216 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 27 [2018-12-02 01:42:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:38,216 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-12-02 01:42:38,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:42:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-12-02 01:42:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 01:42:38,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:38,218 INFO L402 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-12-02 01:42:38,218 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:38,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:38,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1915606920, now seen corresponding path program 1 times [2018-12-02 01:42:38,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:42:38,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:42:38,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:38,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:38,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:42:38,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:42:38,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:42:38,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:42:38,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:42:38,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:42:38,273 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 6 states. [2018-12-02 01:42:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:38,387 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2018-12-02 01:42:38,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 01:42:38,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-02 01:42:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:38,387 INFO L225 Difference]: With dead ends: 179 [2018-12-02 01:42:38,388 INFO L226 Difference]: Without dead ends: 137 [2018-12-02 01:42:38,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-02 01:42:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-02 01:42:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2018-12-02 01:42:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-02 01:42:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2018-12-02 01:42:38,393 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 28 [2018-12-02 01:42:38,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:38,393 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2018-12-02 01:42:38,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:42:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2018-12-02 01:42:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 01:42:38,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:38,394 INFO L402 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-12-02 01:42:38,394 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:38,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:38,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2016202760, now seen corresponding path program 1 times [2018-12-02 01:42:38,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:42:38,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:42:38,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:38,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:38,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:42:38,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:42:38,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 01:42:38,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 01:42:38,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 01:42:38,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:42:38,598 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 8 states. [2018-12-02 01:42:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:38,968 INFO L93 Difference]: Finished difference Result 188 states and 212 transitions. [2018-12-02 01:42:38,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 01:42:38,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-02 01:42:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:38,969 INFO L225 Difference]: With dead ends: 188 [2018-12-02 01:42:38,970 INFO L226 Difference]: Without dead ends: 186 [2018-12-02 01:42:38,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-12-02 01:42:38,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-02 01:42:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 116. [2018-12-02 01:42:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-02 01:42:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2018-12-02 01:42:38,978 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 28 [2018-12-02 01:42:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:38,978 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2018-12-02 01:42:38,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 01:42:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2018-12-02 01:42:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 01:42:38,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:38,979 INFO L402 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-12-02 01:42:38,979 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:38,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1003425070, now seen corresponding path program 1 times [2018-12-02 01:42:38,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:42:38,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:42:38,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:38,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:38,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 01:42:39,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:42:39,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:42:39,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:42:39,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:42:39,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:42:39,019 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand 5 states. [2018-12-02 01:42:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:39,075 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-12-02 01:42:39,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:42:39,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-02 01:42:39,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:39,076 INFO L225 Difference]: With dead ends: 162 [2018-12-02 01:42:39,076 INFO L226 Difference]: Without dead ends: 144 [2018-12-02 01:42:39,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:42:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-02 01:42:39,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2018-12-02 01:42:39,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-02 01:42:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2018-12-02 01:42:39,084 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 30 [2018-12-02 01:42:39,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:39,084 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2018-12-02 01:42:39,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:42:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2018-12-02 01:42:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 01:42:39,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:39,085 INFO L402 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-12-02 01:42:39,085 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:39,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:39,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1179896658, now seen corresponding path program 1 times [2018-12-02 01:42:39,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:42:39,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:42:39,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:39,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:39,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 01:42:39,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:42:39,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:42:39,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:42:39,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:42:39,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:42:39,102 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand 3 states. [2018-12-02 01:42:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:39,135 INFO L93 Difference]: Finished difference Result 137 states and 163 transitions. [2018-12-02 01:42:39,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:42:39,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 01:42:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:39,136 INFO L225 Difference]: With dead ends: 137 [2018-12-02 01:42:39,136 INFO L226 Difference]: Without dead ends: 135 [2018-12-02 01:42:39,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:42:39,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-02 01:42:39,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-12-02 01:42:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-02 01:42:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 160 transitions. [2018-12-02 01:42:39,142 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 160 transitions. Word has length 30 [2018-12-02 01:42:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:39,142 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 160 transitions. [2018-12-02 01:42:39,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:42:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 160 transitions. [2018-12-02 01:42:39,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 01:42:39,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:39,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:42:39,143 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:39,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:39,143 INFO L82 PathProgramCache]: Analyzing trace with hash 425326620, now seen corresponding path program 1 times [2018-12-02 01:42:39,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:42:39,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:42:39,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:39,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:39,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:42:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:42:39,168 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 01:42:39,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:42:39 BoogieIcfgContainer [2018-12-02 01:42:39,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 01:42:39,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:42:39,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:42:39,187 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:42:39,187 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:42:37" (3/4) ... [2018-12-02 01:42:39,189 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 01:42:39,221 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8c45c2ff-0fb2-4ce4-8cad-9cbefd34bad1/bin-2019/uautomizer/witness.graphml [2018-12-02 01:42:39,221 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:42:39,222 INFO L168 Benchmark]: Toolchain (without parser) took 2488.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 950.6 MB in the beginning and 950.9 MB in the end (delta: -326.8 kB). Peak memory consumption was 117.1 MB. Max. memory is 11.5 GB. [2018-12-02 01:42:39,222 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:42:39,223 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -155.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-12-02 01:42:39,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 01:42:39,223 INFO L168 Benchmark]: Boogie Preprocessor took 22.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:42:39,223 INFO L168 Benchmark]: RCFGBuilder took 275.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-12-02 01:42:39,223 INFO L168 Benchmark]: TraceAbstraction took 1874.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 956.1 MB in the end (delta: 106.6 MB). Peak memory consumption was 106.6 MB. Max. memory is 11.5 GB. [2018-12-02 01:42:39,224 INFO L168 Benchmark]: Witness Printer took 34.06 ms. Allocated memory is still 1.1 GB. Free memory was 956.1 MB in the beginning and 950.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-12-02 01:42:39,225 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -155.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 275.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1874.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 956.1 MB in the end (delta: 106.6 MB). Peak memory consumption was 106.6 MB. Max. memory is 11.5 GB. * Witness Printer took 34.06 ms. Allocated memory is still 1.1 GB. Free memory was 956.1 MB in the beginning and 950.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] SLL* list = malloc(sizeof(SLL)); [L993] list->next = ((void*)0) [L994] list->prev = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list != ((void*)0))) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L995] list->inner = malloc(sizeof(SLL)) [L995] EXPR list->inner [L995] list->inner->next = ((void*)0) [L995] EXPR list->inner [L995] list->inner->inner = ((void*)0) [L995] EXPR list->inner [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={14:0}, list->inner={16:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L997] SLL* end = list; VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1015] COND FALSE !(!(((void*)0) != end)) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; [L1020] EXPR end->inner [L1020] SLL* inner = end->inner; [L1021] COND TRUE ((void*)0) != inner VAL [end={14:0}, inner={16:0}, len=0, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1023] COND TRUE len == 0 [L1024] len = 1 VAL [end={14:0}, inner={16:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1027] COND FALSE !(!(((void*)0) != inner)) VAL [end={14:0}, inner={16:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1028] EXPR inner->inner VAL [end={14:0}, inner={16:0}, inner->inner={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1028] COND FALSE !(!(((void*)0) == inner->inner)) [L1029] EXPR inner->next VAL [end={14:0}, inner={16:0}, inner->next={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1029] COND TRUE !(((void*)0) != inner->next) [L1029] __VERIFIER_error() VAL [end={14:0}, inner={16:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 88 locations, 13 error locations. UNSAFE Result, 1.8s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1045 SDtfs, 1024 SDslu, 1290 SDs, 0 SdLazy, 577 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 310 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 46474 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...