./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 534681b11e8e68e6058985d885b01f2cbfa43e5b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-11-28 16:56:19,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:56:19,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:56:19,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:56:19,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:56:19,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:56:19,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:56:19,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:56:19,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:56:19,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:56:19,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:56:19,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:56:19,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:56:19,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:56:19,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:56:19,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:56:19,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:56:19,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:56:19,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:56:19,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:56:19,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:56:19,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:56:19,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:56:19,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:56:19,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:56:19,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:56:19,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:56:19,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:56:19,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:56:19,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:56:19,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:56:19,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:56:19,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:56:19,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:56:19,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:56:19,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:56:19,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:56:19,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:56:19,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:56:19,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:56:19,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:56:19,124 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 16:56:19,142 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:56:19,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:56:19,145 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:56:19,145 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:56:19,145 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:56:19,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:56:19,145 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:56:19,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:56:19,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:56:19,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:56:19,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:56:19,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:56:19,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:56:19,149 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:56:19,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:56:19,149 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:56:19,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:56:19,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:56:19,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:56:19,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:56:19,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:56:19,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:56:19,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:56:19,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:56:19,154 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:56:19,154 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:56:19,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:56:19,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:56:19,155 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:56:19,155 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 534681b11e8e68e6058985d885b01f2cbfa43e5b [2019-11-28 16:56:19,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:56:19,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:56:19,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:56:19,471 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:56:19,472 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:56:19,473 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-28 16:56:19,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5435b1901/29fbd6f34ca7450a9fb97d3ad779403b/FLAG9742b0286 [2019-11-28 16:56:20,068 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:56:20,069 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-28 16:56:20,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5435b1901/29fbd6f34ca7450a9fb97d3ad779403b/FLAG9742b0286 [2019-11-28 16:56:20,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5435b1901/29fbd6f34ca7450a9fb97d3ad779403b [2019-11-28 16:56:20,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:56:20,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:56:20,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:56:20,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:56:20,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:56:20,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:56:20" (1/1) ... [2019-11-28 16:56:20,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f3499a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:20, skipping insertion in model container [2019-11-28 16:56:20,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:56:20" (1/1) ... [2019-11-28 16:56:20,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:56:20,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:56:20,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:56:20,936 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:56:20,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:56:21,047 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:56:21,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:21 WrapperNode [2019-11-28 16:56:21,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:56:21,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:56:21,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:56:21,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:56:21,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:21" (1/1) ... [2019-11-28 16:56:21,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:21" (1/1) ... [2019-11-28 16:56:21,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:56:21,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:56:21,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:56:21,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:56:21,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:21" (1/1) ... [2019-11-28 16:56:21,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:21" (1/1) ... [2019-11-28 16:56:21,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:21" (1/1) ... [2019-11-28 16:56:21,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:21" (1/1) ... [2019-11-28 16:56:21,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:21" (1/1) ... [2019-11-28 16:56:21,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:21" (1/1) ... [2019-11-28 16:56:21,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:21" (1/1) ... [2019-11-28 16:56:21,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:56:21,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:56:21,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:56:21,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:56:21,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:56:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 16:56:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 16:56:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 16:56:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:56:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 16:56:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 16:56:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:56:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:56:21,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:56:21,873 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:56:21,873 INFO L287 CfgBuilder]: Removed 75 assume(true) statements. [2019-11-28 16:56:21,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:56:21 BoogieIcfgContainer [2019-11-28 16:56:21,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:56:21,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:56:21,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:56:21,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:56:21,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:56:20" (1/3) ... [2019-11-28 16:56:21,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315ebfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:56:21, skipping insertion in model container [2019-11-28 16:56:21,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:21" (2/3) ... [2019-11-28 16:56:21,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315ebfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:56:21, skipping insertion in model container [2019-11-28 16:56:21,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:56:21" (3/3) ... [2019-11-28 16:56:21,883 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2019-11-28 16:56:21,893 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:56:21,901 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-28 16:56:21,913 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-28 16:56:21,939 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:56:21,940 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:56:21,940 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:56:21,940 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:56:21,940 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:56:21,941 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:56:21,941 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:56:21,941 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:56:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-11-28 16:56:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 16:56:21,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:21,980 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 16:56:21,981 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:21,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:21,988 INFO L82 PathProgramCache]: Analyzing trace with hash 890218827, now seen corresponding path program 1 times [2019-11-28 16:56:21,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:21,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228936368] [2019-11-28 16:56:21,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:22,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228936368] [2019-11-28 16:56:22,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:56:22,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 16:56:22,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481157751] [2019-11-28 16:56:22,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:56:22,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:22,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:56:22,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:56:22,162 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 2 states. [2019-11-28 16:56:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:22,192 INFO L93 Difference]: Finished difference Result 196 states and 316 transitions. [2019-11-28 16:56:22,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:56:22,194 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-28 16:56:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:22,207 INFO L225 Difference]: With dead ends: 196 [2019-11-28 16:56:22,207 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 16:56:22,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:56:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 16:56:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-28 16:56:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-28 16:56:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-11-28 16:56:22,290 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 6 [2019-11-28 16:56:22,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:22,290 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-11-28 16:56:22,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:56:22,291 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-11-28 16:56:22,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 16:56:22,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:22,292 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:22,293 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:22,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:22,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1806865150, now seen corresponding path program 1 times [2019-11-28 16:56:22,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:22,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8205050] [2019-11-28 16:56:22,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:22,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8205050] [2019-11-28 16:56:22,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:56:22,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:56:22,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483118874] [2019-11-28 16:56:22,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:56:22,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:22,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:56:22,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:56:22,361 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 3 states. [2019-11-28 16:56:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:22,402 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2019-11-28 16:56:22,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:56:22,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 16:56:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:22,407 INFO L225 Difference]: With dead ends: 182 [2019-11-28 16:56:22,407 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 16:56:22,410 INFO L630 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-11-28 16:56:22,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 16:56:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2019-11-28 16:56:22,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-28 16:56:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2019-11-28 16:56:22,422 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 7 [2019-11-28 16:56:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:22,423 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2019-11-28 16:56:22,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:56:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2019-11-28 16:56:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 16:56:22,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:22,424 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:22,424 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:22,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:22,425 INFO L82 PathProgramCache]: Analyzing trace with hash 663763925, now seen corresponding path program 1 times [2019-11-28 16:56:22,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:22,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618265232] [2019-11-28 16:56:22,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:22,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618265232] [2019-11-28 16:56:22,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:56:22,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:56:22,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299351845] [2019-11-28 16:56:22,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:56:22,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:22,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:56:22,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:56:22,543 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 5 states. [2019-11-28 16:56:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:22,723 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2019-11-28 16:56:22,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:56:22,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 16:56:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:22,729 INFO L225 Difference]: With dead ends: 253 [2019-11-28 16:56:22,732 INFO L226 Difference]: Without dead ends: 247 [2019-11-28 16:56:22,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 16:56:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-11-28 16:56:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 96. [2019-11-28 16:56:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 16:56:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2019-11-28 16:56:22,762 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 13 [2019-11-28 16:56:22,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:22,762 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2019-11-28 16:56:22,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:56:22,763 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2019-11-28 16:56:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:56:22,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:22,765 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:22,765 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:22,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:22,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2036062252, now seen corresponding path program 1 times [2019-11-28 16:56:22,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:22,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238770344] [2019-11-28 16:56:22,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 16:56:22,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238770344] [2019-11-28 16:56:22,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:56:22,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:56:22,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515758828] [2019-11-28 16:56:22,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:56:22,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:22,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:56:22,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:56:22,892 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 5 states. [2019-11-28 16:56:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:23,112 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-11-28 16:56:23,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:56:23,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-28 16:56:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:23,116 INFO L225 Difference]: With dead ends: 125 [2019-11-28 16:56:23,116 INFO L226 Difference]: Without dead ends: 123 [2019-11-28 16:56:23,117 INFO L630 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-11-28 16:56:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-28 16:56:23,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2019-11-28 16:56:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-28 16:56:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2019-11-28 16:56:23,131 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 20 [2019-11-28 16:56:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:23,131 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2019-11-28 16:56:23,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:56:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2019-11-28 16:56:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:56:23,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:23,133 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:23,133 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:23,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2014113239, now seen corresponding path program 1 times [2019-11-28 16:56:23,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:23,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98599758] [2019-11-28 16:56:23,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 16:56:23,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98599758] [2019-11-28 16:56:23,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:56:23,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:56:23,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190947947] [2019-11-28 16:56:23,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:56:23,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:23,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:56:23,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:56:23,254 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 5 states. [2019-11-28 16:56:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:23,424 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-11-28 16:56:23,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:56:23,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-28 16:56:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:23,425 INFO L225 Difference]: With dead ends: 94 [2019-11-28 16:56:23,426 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 16:56:23,426 INFO L630 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-11-28 16:56:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 16:56:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-28 16:56:23,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-28 16:56:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-11-28 16:56:23,434 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 20 [2019-11-28 16:56:23,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:23,434 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-11-28 16:56:23,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:56:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-11-28 16:56:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 16:56:23,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:23,436 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:23,436 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:23,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:23,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1486605840, now seen corresponding path program 1 times [2019-11-28 16:56:23,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:23,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142248728] [2019-11-28 16:56:23,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:23,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142248728] [2019-11-28 16:56:23,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:56:23,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 16:56:23,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96170957] [2019-11-28 16:56:23,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 16:56:23,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:23,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 16:56:23,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:56:23,571 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 6 states. [2019-11-28 16:56:23,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:23,934 INFO L93 Difference]: Finished difference Result 210 states and 230 transitions. [2019-11-28 16:56:23,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 16:56:23,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-28 16:56:23,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:23,936 INFO L225 Difference]: With dead ends: 210 [2019-11-28 16:56:23,937 INFO L226 Difference]: Without dead ends: 208 [2019-11-28 16:56:23,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:56:23,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-28 16:56:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 98. [2019-11-28 16:56:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 16:56:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-11-28 16:56:23,946 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 23 [2019-11-28 16:56:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:23,947 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-11-28 16:56:23,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 16:56:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-11-28 16:56:23,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 16:56:23,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:23,948 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:23,948 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:23,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:23,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1760261746, now seen corresponding path program 1 times [2019-11-28 16:56:23,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:23,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738400922] [2019-11-28 16:56:23,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:24,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738400922] [2019-11-28 16:56:24,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:56:24,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 16:56:24,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649140657] [2019-11-28 16:56:24,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 16:56:24,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:24,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 16:56:24,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:56:24,008 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 6 states. [2019-11-28 16:56:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:24,292 INFO L93 Difference]: Finished difference Result 208 states and 228 transitions. [2019-11-28 16:56:24,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 16:56:24,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-28 16:56:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:24,294 INFO L225 Difference]: With dead ends: 208 [2019-11-28 16:56:24,294 INFO L226 Difference]: Without dead ends: 206 [2019-11-28 16:56:24,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:56:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-28 16:56:24,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 104. [2019-11-28 16:56:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 16:56:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2019-11-28 16:56:24,302 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 23 [2019-11-28 16:56:24,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:24,303 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2019-11-28 16:56:24,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 16:56:24,303 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2019-11-28 16:56:24,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 16:56:24,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:24,304 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:24,305 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:24,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:24,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2060804288, now seen corresponding path program 1 times [2019-11-28 16:56:24,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:24,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531666607] [2019-11-28 16:56:24,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:56:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:56:24,367 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 16:56:24,368 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 16:56:24,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:56:24 BoogieIcfgContainer [2019-11-28 16:56:24,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:56:24,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:56:24,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:56:24,407 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:56:24,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:56:21" (3/4) ... [2019-11-28 16:56:24,409 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 16:56:24,464 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:56:24,464 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:56:24,467 INFO L168 Benchmark]: Toolchain (without parser) took 4037.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 957.7 MB in the beginning and 846.0 MB in the end (delta: 111.7 MB). Peak memory consumption was 241.2 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:24,467 INFO L168 Benchmark]: CDTParser took 0.67 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:56:24,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:24,468 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:56:24,469 INFO L168 Benchmark]: Boogie Preprocessor took 47.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:24,470 INFO L168 Benchmark]: RCFGBuilder took 710.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:24,471 INFO L168 Benchmark]: TraceAbstraction took 2531.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 852.7 MB in the end (delta: 194.0 MB). Peak memory consumption was 194.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:24,471 INFO L168 Benchmark]: Witness Printer took 57.13 ms. Allocated memory is still 1.2 GB. Free memory was 852.7 MB in the beginning and 846.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:24,475 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.67 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 618.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 710.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2531.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 852.7 MB in the end (delta: 194.0 MB). Peak memory consumption was 194.0 MB. Max. memory is 11.5 GB. * Witness Printer took 57.13 ms. Allocated memory is still 1.2 GB. Free memory was 852.7 MB in the beginning and 846.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] node->next = node [L633] node->value = __VERIFIER_nondet_int() [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] item->slist = node [L638] item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L604] COND FALSE !(!(shape)) [L605] shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L612] EXPR shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L613] EXPR shape->slist [L613] COND FALSE !(!(shape->slist)) [L614] EXPR shape->slist [L614] EXPR shape->slist->next [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 99 locations, 13 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 606 SDtfs, 1418 SDslu, 979 SDs, 0 SdLazy, 502 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 396 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 9999 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 10/10 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...