./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ec50262c-1cc1-4bf6-807f-ad8ac54235ce/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ec50262c-1cc1-4bf6-807f-ad8ac54235ce/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ec50262c-1cc1-4bf6-807f-ad8ac54235ce/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ec50262c-1cc1-4bf6-807f-ad8ac54235ce/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ec50262c-1cc1-4bf6-807f-ad8ac54235ce/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ec50262c-1cc1-4bf6-807f-ad8ac54235ce/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f18f7f1f917468e24f0e5d26966f1156107884dd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-cad4683 [2019-10-22 11:20:55,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:20:55,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:20:55,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:20:55,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:20:55,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:20:55,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:20:55,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:20:55,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:20:55,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:20:55,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:20:55,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:20:55,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:20:55,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:20:55,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:20:55,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:20:55,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:20:55,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:20:55,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:20:55,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:20:55,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:20:55,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:20:55,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:20:55,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:20:55,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:20:55,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:20:55,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:20:55,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:20:55,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:20:55,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:20:55,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:20:55,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:20:55,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:20:55,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:20:55,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:20:55,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:20:55,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:20:55,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:20:55,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:20:55,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:20:55,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:20:55,230 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ec50262c-1cc1-4bf6-807f-ad8ac54235ce/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:20:55,243 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:20:55,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:20:55,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:20:55,253 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:20:55,253 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:20:55,253 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:20:55,253 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:20:55,253 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:20:55,254 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:20:55,254 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:20:55,254 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:20:55,254 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:20:55,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:20:55,255 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:20:55,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:20:55,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:20:55,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:20:55,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:20:55,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:20:55,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:20:55,257 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:20:55,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:20:55,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:20:55,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:20:55,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:20:55,258 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:20:55,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:20:55,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:20:55,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:20:55,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:20:55,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:20:55,259 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:20:55,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:20:55,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:20:55,259 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:20:55,259 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ec50262c-1cc1-4bf6-807f-ad8ac54235ce/bin/utaipan 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 -> Taipan 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 -> f18f7f1f917468e24f0e5d26966f1156107884dd [2019-10-22 11:20:55,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:20:55,303 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:20:55,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:20:55,308 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:20:55,308 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:20:55,309 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ec50262c-1cc1-4bf6-807f-ad8ac54235ce/bin/utaipan/../../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2019-10-22 11:20:55,359 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec50262c-1cc1-4bf6-807f-ad8ac54235ce/bin/utaipan/data/8d2d8086d/488797c119034e8c9de1e548b65f2137/FLAG58514bf52 [2019-10-22 11:20:55,826 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:20:55,830 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ec50262c-1cc1-4bf6-807f-ad8ac54235ce/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2019-10-22 11:20:55,840 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec50262c-1cc1-4bf6-807f-ad8ac54235ce/bin/utaipan/data/8d2d8086d/488797c119034e8c9de1e548b65f2137/FLAG58514bf52 [2019-10-22 11:20:55,855 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ec50262c-1cc1-4bf6-807f-ad8ac54235ce/bin/utaipan/data/8d2d8086d/488797c119034e8c9de1e548b65f2137 [2019-10-22 11:20:55,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:20:55,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:20:55,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:55,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:20:55,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:20:55,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:55" (1/1) ... [2019-10-22 11:20:55,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563ae702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:55, skipping insertion in model container [2019-10-22 11:20:55,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:55" (1/1) ... [2019-10-22 11:20:55,879 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:20:55,919 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:20:56,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:56,231 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:20:56,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:56,323 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:20:56,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56 WrapperNode [2019-10-22 11:20:56,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:56,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:56,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:20:56,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:20:56,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:56,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:20:56,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:20:56,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:20:56,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:20:56,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:20:56,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:20:56,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:20:56,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec50262c-1cc1-4bf6-807f-ad8ac54235ce/bin/utaipan/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 [2019-10-22 11:20:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:20:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:20:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:20:56,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:20:56,775 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:20:56,775 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-10-22 11:20:56,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:56 BoogieIcfgContainer [2019-10-22 11:20:56,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:20:56,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:20:56,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:20:56,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:20:56,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:20:55" (1/3) ... [2019-10-22 11:20:56,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722dfa0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:56, skipping insertion in model container [2019-10-22 11:20:56,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (2/3) ... [2019-10-22 11:20:56,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722dfa0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:56, skipping insertion in model container [2019-10-22 11:20:56,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:56" (3/3) ... [2019-10-22 11:20:56,784 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list2.c_1.i [2019-10-22 11:20:56,793 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:20:56,800 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-22 11:20:56,810 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-22 11:20:56,832 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:20:56,832 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:20:56,832 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:20:56,832 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:20:56,833 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:20:56,833 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:20:56,834 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:20:56,834 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:20:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-10-22 11:20:56,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-10-22 11:20:56,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:56,853 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-10-22 11:20:56,855 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:56,860 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 11:20:56,868 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:56,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757737983] [2019-10-22 11:20:56,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:56,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:56,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:57,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757737983] [2019-10-22 11:20:57,029 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:57,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:20:57,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035738332] [2019-10-22 11:20:57,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:57,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:57,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:57,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:57,052 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2019-10-22 11:20:57,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:57,085 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-10-22 11:20:57,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:57,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-10-22 11:20:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:57,105 INFO L225 Difference]: With dead ends: 85 [2019-10-22 11:20:57,106 INFO L226 Difference]: Without dead ends: 36 [2019-10-22 11:20:57,115 INFO L600 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 [2019-10-22 11:20:57,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-22 11:20:57,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-22 11:20:57,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:20:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-10-22 11:20:57,152 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 4 [2019-10-22 11:20:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:57,152 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-10-22 11:20:57,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:57,152 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-10-22 11:20:57,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:20:57,153 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:57,153 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:57,153 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:57,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:57,154 INFO L82 PathProgramCache]: Analyzing trace with hash 170685048, now seen corresponding path program 1 times [2019-10-22 11:20:57,154 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:57,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784341824] [2019-10-22 11:20:57,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:57,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784341824] [2019-10-22 11:20:57,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:57,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:20:57,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274985821] [2019-10-22 11:20:57,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:20:57,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:57,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:20:57,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:20:57,265 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2019-10-22 11:20:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:57,339 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-10-22 11:20:57,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:20:57,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-22 11:20:57,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:57,340 INFO L225 Difference]: With dead ends: 64 [2019-10-22 11:20:57,341 INFO L226 Difference]: Without dead ends: 38 [2019-10-22 11:20:57,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:20:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-22 11:20:57,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-10-22 11:20:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:20:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-22 11:20:57,346 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 15 [2019-10-22 11:20:57,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:57,346 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-22 11:20:57,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:20:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-22 11:20:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:20:57,347 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:57,347 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:57,347 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:57,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:57,348 INFO L82 PathProgramCache]: Analyzing trace with hash 227943350, now seen corresponding path program 1 times [2019-10-22 11:20:57,348 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:57,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543848968] [2019-10-22 11:20:57,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:57,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543848968] [2019-10-22 11:20:57,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:57,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:20:57,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094815999] [2019-10-22 11:20:57,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:20:57,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:57,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:20:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:20:57,444 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 7 states. [2019-10-22 11:20:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:57,712 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-10-22 11:20:57,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:20:57,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-10-22 11:20:57,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:57,713 INFO L225 Difference]: With dead ends: 54 [2019-10-22 11:20:57,713 INFO L226 Difference]: Without dead ends: 52 [2019-10-22 11:20:57,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:20:57,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-22 11:20:57,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 34. [2019-10-22 11:20:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:20:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-22 11:20:57,719 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 15 [2019-10-22 11:20:57,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:57,719 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-22 11:20:57,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:20:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-22 11:20:57,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:20:57,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:57,720 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:57,720 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:57,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:57,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1186712674, now seen corresponding path program 1 times [2019-10-22 11:20:57,721 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:57,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569800132] [2019-10-22 11:20:57,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:57,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569800132] [2019-10-22 11:20:57,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:57,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:20:57,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092862906] [2019-10-22 11:20:57,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:20:57,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:57,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:20:57,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:20:57,806 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2019-10-22 11:20:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:57,867 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-10-22 11:20:57,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:20:57,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-22 11:20:57,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:57,871 INFO L225 Difference]: With dead ends: 63 [2019-10-22 11:20:57,871 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:20:57,871 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:20:57,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:20:57,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:20:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:20:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-10-22 11:20:57,875 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 19 [2019-10-22 11:20:57,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:57,875 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-10-22 11:20:57,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:20:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-10-22 11:20:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:20:57,879 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:57,879 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:57,880 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:57,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:57,880 INFO L82 PathProgramCache]: Analyzing trace with hash -93151004, now seen corresponding path program 1 times [2019-10-22 11:20:57,880 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:57,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011397902] [2019-10-22 11:20:57,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:58,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011397902] [2019-10-22 11:20:58,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-22 11:20:58,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340265730] [2019-10-22 11:20:58,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 11:20:58,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 11:20:58,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:20:58,050 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 12 states. [2019-10-22 11:20:58,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,351 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-10-22 11:20:58,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:20:58,352 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-10-22 11:20:58,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,352 INFO L225 Difference]: With dead ends: 50 [2019-10-22 11:20:58,353 INFO L226 Difference]: Without dead ends: 42 [2019-10-22 11:20:58,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:20:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-22 11:20:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-22 11:20:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 11:20:58,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-10-22 11:20:58,359 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-10-22 11:20:58,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,359 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-10-22 11:20:58,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 11:20:58,359 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-10-22 11:20:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:20:58,360 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,360 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:58,361 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:58,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,361 INFO L82 PathProgramCache]: Analyzing trace with hash -93091422, now seen corresponding path program 1 times [2019-10-22 11:20:58,361 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372798148] [2019-10-22 11:20:58,362 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,362 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:58,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372798148] [2019-10-22 11:20:58,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:20:58,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383623756] [2019-10-22 11:20:58,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:20:58,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:20:58,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:20:58,530 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2019-10-22 11:20:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,728 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-10-22 11:20:58,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:20:58,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-10-22 11:20:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,729 INFO L225 Difference]: With dead ends: 54 [2019-10-22 11:20:58,730 INFO L226 Difference]: Without dead ends: 46 [2019-10-22 11:20:58,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:20:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-22 11:20:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-10-22 11:20:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 11:20:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-10-22 11:20:58,735 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 19 [2019-10-22 11:20:58,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,735 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-10-22 11:20:58,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:20:58,735 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-10-22 11:20:58,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:20:58,736 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,736 INFO L380 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] [2019-10-22 11:20:58,737 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:58,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1793070580, now seen corresponding path program 1 times [2019-10-22 11:20:58,737 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644771349] [2019-10-22 11:20:58,738 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,738 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:58,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644771349] [2019-10-22 11:20:58,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:20:58,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435148810] [2019-10-22 11:20:58,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:20:58,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:20:58,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:20:58,873 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2019-10-22 11:20:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,117 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-10-22 11:20:59,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:20:59,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-10-22 11:20:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,118 INFO L225 Difference]: With dead ends: 56 [2019-10-22 11:20:59,118 INFO L226 Difference]: Without dead ends: 48 [2019-10-22 11:20:59,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:20:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-22 11:20:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-10-22 11:20:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 11:20:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-10-22 11:20:59,123 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 25 [2019-10-22 11:20:59,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,123 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-10-22 11:20:59,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:20:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-10-22 11:20:59,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:20:59,124 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,124 INFO L380 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] [2019-10-22 11:20:59,125 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1793130162, now seen corresponding path program 1 times [2019-10-22 11:20:59,125 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371111429] [2019-10-22 11:20:59,126 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,126 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371111429] [2019-10-22 11:20:59,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-22 11:20:59,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674617902] [2019-10-22 11:20:59,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 11:20:59,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 11:20:59,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:20:59,306 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 14 states. [2019-10-22 11:20:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,717 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-10-22 11:20:59,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 11:20:59,718 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-10-22 11:20:59,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,718 INFO L225 Difference]: With dead ends: 55 [2019-10-22 11:20:59,718 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 11:20:59,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2019-10-22 11:20:59,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 11:20:59,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-10-22 11:20:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-22 11:20:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-10-22 11:20:59,723 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 25 [2019-10-22 11:20:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,723 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-10-22 11:20:59,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 11:20:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-10-22 11:20:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:20:59,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,724 INFO L380 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] [2019-10-22 11:20:59,725 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1850388464, now seen corresponding path program 1 times [2019-10-22 11:20:59,725 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427113895] [2019-10-22 11:20:59,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427113895] [2019-10-22 11:20:59,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:20:59,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185717414] [2019-10-22 11:20:59,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:20:59,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:20:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:20:59,785 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2019-10-22 11:20:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,832 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-10-22 11:20:59,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:20:59,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-22 11:20:59,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,834 INFO L225 Difference]: With dead ends: 46 [2019-10-22 11:20:59,835 INFO L226 Difference]: Without dead ends: 42 [2019-10-22 11:20:59,835 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:20:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-22 11:20:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-22 11:20:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 11:20:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-10-22 11:20:59,840 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 25 [2019-10-22 11:20:59,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,840 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-10-22 11:20:59,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:20:59,840 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-10-22 11:20:59,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:20:59,841 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,841 INFO L380 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] [2019-10-22 11:20:59,841 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1400103152, now seen corresponding path program 1 times [2019-10-22 11:20:59,842 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133540060] [2019-10-22 11:20:59,842 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,842 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133540060] [2019-10-22 11:20:59,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-22 11:20:59,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523482362] [2019-10-22 11:20:59,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-22 11:20:59,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 11:20:59,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:20:59,964 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 13 states. [2019-10-22 11:21:00,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:00,350 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-10-22 11:21:00,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:21:00,351 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-10-22 11:21:00,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:00,351 INFO L225 Difference]: With dead ends: 50 [2019-10-22 11:21:00,351 INFO L226 Difference]: Without dead ends: 48 [2019-10-22 11:21:00,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2019-10-22 11:21:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-22 11:21:00,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2019-10-22 11:21:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:21:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-22 11:21:00,354 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2019-10-22 11:21:00,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:00,354 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-22 11:21:00,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-22 11:21:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-10-22 11:21:00,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:21:00,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:00,355 INFO L380 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] [2019-10-22 11:21:00,355 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:00,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:00,355 INFO L82 PathProgramCache]: Analyzing trace with hash 758876958, now seen corresponding path program 1 times [2019-10-22 11:21:00,358 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:00,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582843449] [2019-10-22 11:21:00,358 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:00,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:00,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:00,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582843449] [2019-10-22 11:21:00,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:00,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:21:00,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529281600] [2019-10-22 11:21:00,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:21:00,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:00,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:21:00,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:00,448 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2019-10-22 11:21:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:00,578 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-10-22 11:21:00,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:21:00,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-10-22 11:21:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:00,579 INFO L225 Difference]: With dead ends: 44 [2019-10-22 11:21:00,579 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:21:00,579 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:21:00,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:21:00,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-10-22 11:21:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 11:21:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-10-22 11:21:00,582 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 29 [2019-10-22 11:21:00,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:00,582 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-10-22 11:21:00,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:21:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-10-22 11:21:00,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:21:00,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:00,583 INFO L380 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] [2019-10-22 11:21:00,583 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:00,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:00,583 INFO L82 PathProgramCache]: Analyzing trace with hash -50469668, now seen corresponding path program 1 times [2019-10-22 11:21:00,583 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:00,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900628041] [2019-10-22 11:21:00,587 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:00,587 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:00,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:00,651 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:21:00,651 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:21:00,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:00 BoogieIcfgContainer [2019-10-22 11:21:00,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:00,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:00,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:00,688 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:00,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:56" (3/4) ... [2019-10-22 11:21:00,691 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:21:00,736 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ec50262c-1cc1-4bf6-807f-ad8ac54235ce/bin/utaipan/witness.graphml [2019-10-22 11:21:00,736 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:00,738 INFO L168 Benchmark]: Toolchain (without parser) took 4877.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 241.2 MB). Free memory was 943.2 MB in the beginning and 954.5 MB in the end (delta: -11.3 MB). Peak memory consumption was 229.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:00,738 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:00,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 943.2 MB in the beginning and 1.2 GB in the end (delta: -210.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:00,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:00,739 INFO L168 Benchmark]: Boogie Preprocessor took 28.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:00,739 INFO L168 Benchmark]: RCFGBuilder took 372.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:00,740 INFO L168 Benchmark]: TraceAbstraction took 3910.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 964.7 MB in the end (delta: 155.3 MB). Peak memory consumption was 219.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:00,740 INFO L168 Benchmark]: Witness Printer took 47.75 ms. Allocated memory is still 1.3 GB. Free memory was 964.7 MB in the beginning and 954.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:00,742 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 462.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 943.2 MB in the beginning and 1.2 GB in the end (delta: -210.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 372.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3910.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 964.7 MB in the end (delta: 155.3 MB). Peak memory consumption was 219.2 MB. Max. memory is 11.5 GB. * Witness Printer took 47.75 ms. Allocated memory is still 1.3 GB. Free memory was 964.7 MB in the beginning and 954.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L867] void * guard_malloc_counter = 0; [L887] struct list_head *elem = ((void *)0); [L900] static struct list_head head; VAL [elem={0:0}, guard_malloc_counter={0:0}, head={1:0}] [L903] struct list_head *dev1, *dev2; [L871] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:0}, head={1:0}] [L872] guard_malloc_counter++ [L873] COND FALSE !(!__VERIFIER_nondet_int()) [L875] return (void *) guard_malloc_counter; VAL [elem={0:0}, guard_malloc_counter={0:1}, head={1:0}] [L879] return __getMemory(size); [L904] dev1 = my_malloc(sizeof(*dev1)) [L871] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:1}, head={1:0}] [L872] guard_malloc_counter++ [L873] COND FALSE !(!__VERIFIER_nondet_int()) [L875] return (void *) guard_malloc_counter; VAL [elem={0:0}, guard_malloc_counter={0:2}, head={1:0}] [L879] return __getMemory(size); [L905] dev2 = my_malloc(sizeof(*dev2)) [L906] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:2}, head={1:0}] [L891] COND TRUE __VERIFIER_nondet_int() [L892] elem = new VAL [elem={0:2}, guard_malloc_counter={0:2}, head={1:0}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:2}, guard_malloc_counter={0:2}, head={1:0}] [L891] COND TRUE __VERIFIER_nondet_int() [L892] elem = new VAL [elem={0:1}, guard_malloc_counter={0:2}, head={1:0}] [L896] COND FALSE !(entry==elem) VAL [elem={0:1}, guard_malloc_counter={0:2}, head={1:0}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:1}, guard_malloc_counter={0:2}, head={1:0}] [L891] COND FALSE !(__VERIFIER_nondet_int()) [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:1}, guard_malloc_counter={0:2}, head={1:0}] [L6] __VERIFIER_error() VAL [elem={0:1}, guard_malloc_counter={0:2}, head={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 6 error locations. Result: UNSAFE, OverallTime: 3.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 316 SDtfs, 1037 SDslu, 725 SDs, 0 SdLazy, 1052 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 55 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 19201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...