./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:44:16,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:44:16,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:44:16,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:44:16,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:44:16,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:44:16,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:44:16,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:44:16,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:44:16,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:44:16,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:44:16,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:44:16,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:44:16,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:44:16,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:44:16,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:44:16,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:44:16,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:44:16,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:44:16,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:44:16,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:44:16,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:44:16,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:44:16,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:44:16,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:44:16,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:44:16,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:44:16,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:44:16,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:44:16,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:44:16,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:44:16,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:44:16,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:44:16,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:44:16,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:44:16,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:44:16,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:44:16,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:44:16,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:44:16,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:44:16,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:44:16,439 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:44:16,464 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:44:16,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:44:16,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:44:16,465 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:44:16,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:44:16,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:44:16,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:44:16,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:44:16,467 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:44:16,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:44:16,468 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:44:16,468 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:44:16,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:44:16,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:44:16,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:44:16,468 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:44:16,469 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:44:16,469 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:44:16,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:44:16,469 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:44:16,469 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:44:16,469 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:44:16,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:44:16,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:44:16,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:44:16,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:16,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:44:16,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:44:16,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:44:16,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:44:16,472 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 [2022-02-20 23:44:16,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:44:16,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:44:16,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:44:16,698 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:44:16,698 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:44:16,699 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.2.i [2022-02-20 23:44:16,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0b10664/0d66abc78ae940b887e8878373018ea5/FLAGd8c28b5c3 [2022-02-20 23:44:17,153 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:44:17,155 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.2.i [2022-02-20 23:44:17,171 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0b10664/0d66abc78ae940b887e8878373018ea5/FLAGd8c28b5c3 [2022-02-20 23:44:17,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0b10664/0d66abc78ae940b887e8878373018ea5 [2022-02-20 23:44:17,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:44:17,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:44:17,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:17,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:44:17,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:44:17,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:17" (1/1) ... [2022-02-20 23:44:17,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab4e469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:17, skipping insertion in model container [2022-02-20 23:44:17,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:17" (1/1) ... [2022-02-20 23:44:17,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:44:17,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:44:17,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:17,440 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:44:17,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:17,518 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:44:17,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:17 WrapperNode [2022-02-20 23:44:17,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:17,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:17,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:44:17,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:44:17,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:17" (1/1) ... [2022-02-20 23:44:17,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:17" (1/1) ... [2022-02-20 23:44:17,551 INFO L137 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-02-20 23:44:17,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:17,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:44:17,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:44:17,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:44:17,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:17" (1/1) ... [2022-02-20 23:44:17,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:17" (1/1) ... [2022-02-20 23:44:17,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:17" (1/1) ... [2022-02-20 23:44:17,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:17" (1/1) ... [2022-02-20 23:44:17,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:17" (1/1) ... [2022-02-20 23:44:17,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:17" (1/1) ... [2022-02-20 23:44:17,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:17" (1/1) ... [2022-02-20 23:44:17,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:44:17,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:44:17,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:44:17,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:44:17,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:17" (1/1) ... [2022-02-20 23:44:17,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:17,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:17,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:44:17,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:44:17,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:44:17,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:44:17,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:44:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:44:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:44:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:44:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:44:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:44:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:44:17,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:44:17,737 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:44:17,738 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:44:17,975 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:44:17,980 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:44:17,980 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:44:17,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:17 BoogieIcfgContainer [2022-02-20 23:44:17,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:44:17,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:44:17,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:44:17,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:44:17,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:44:17" (1/3) ... [2022-02-20 23:44:17,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8c8086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:17, skipping insertion in model container [2022-02-20 23:44:17,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:17" (2/3) ... [2022-02-20 23:44:17,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8c8086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:17, skipping insertion in model container [2022-02-20 23:44:17,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:17" (3/3) ... [2022-02-20 23:44:17,988 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.2.i [2022-02-20 23:44:17,991 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:44:17,991 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-02-20 23:44:18,019 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:44:18,023 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:44:18,024 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-02-20 23:44:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:44:18,054 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:18,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:44:18,055 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:18,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:18,062 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2022-02-20 23:44:18,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:18,070 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770516175] [2022-02-20 23:44:18,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:18,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:18,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~S~0.base, ~S~0.offset := 0, 0;~pc1~0 := 1;~pc4~0 := 1;~t1~0.base, ~t1~0.offset := 0, 0;~x1~0.base, ~x1~0.offset := 0, 0;~garbage~0.base, ~garbage~0.offset := 0, 0;~t4~0.base, ~t4~0.offset := 0, 0;~x4~0.base, ~x4~0.offset := 0, 0;~res4~0 := 0; {67#true} is VALID [2022-02-20 23:44:18,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet10#1, main_#t~short11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {67#true} is VALID [2022-02-20 23:44:18,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume !true; {68#false} is VALID [2022-02-20 23:44:18,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {68#false} assume !!(~garbage~0.base != 0 || ~garbage~0.offset != 0); {68#false} is VALID [2022-02-20 23:44:18,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {68#false} assume !(1 == #valid[~garbage~0.base]); {68#false} is VALID [2022-02-20 23:44:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:18,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:18,193 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770516175] [2022-02-20 23:44:18,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770516175] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:18,193 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:18,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:18,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876748685] [2022-02-20 23:44:18,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:18,200 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:44:18,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:18,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:18,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:44:18,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:18,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:44:18,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:44:18,230 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:18,301 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-02-20 23:44:18,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:44:18,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:44:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2022-02-20 23:44:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2022-02-20 23:44:18,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 83 transitions. [2022-02-20 23:44:18,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:18,398 INFO L225 Difference]: With dead ends: 64 [2022-02-20 23:44:18,399 INFO L226 Difference]: Without dead ends: 62 [2022-02-20 23:44:18,400 INFO L932 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 [2022-02-20 23:44:18,404 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:18,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-20 23:44:18,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-02-20 23:44:18,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:18,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,433 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,434 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:18,437 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-02-20 23:44:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-02-20 23:44:18,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:18,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:18,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 62 states. [2022-02-20 23:44:18,438 INFO L87 Difference]: Start difference. First operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 62 states. [2022-02-20 23:44:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:18,441 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-02-20 23:44:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-02-20 23:44:18,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:18,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:18,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:18,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-02-20 23:44:18,446 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2022-02-20 23:44:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:18,446 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-02-20 23:44:18,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-02-20 23:44:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:44:18,448 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:18,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:18,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:44:18,448 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2022-02-20 23:44:18,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:18,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567166705] [2022-02-20 23:44:18,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:18,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:18,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {321#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~S~0.base, ~S~0.offset := 0, 0;~pc1~0 := 1;~pc4~0 := 1;~t1~0.base, ~t1~0.offset := 0, 0;~x1~0.base, ~x1~0.offset := 0, 0;~garbage~0.base, ~garbage~0.offset := 0, 0;~t4~0.base, ~t4~0.offset := 0, 0;~x4~0.base, ~x4~0.offset := 0, 0;~res4~0 := 0; {321#true} is VALID [2022-02-20 23:44:18,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {321#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet10#1, main_#t~short11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {321#true} is VALID [2022-02-20 23:44:18,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {321#true} main_#t~short11#1 := (~S~0.base != 0 || ~S~0.offset != 0) || 1 != ~pc4~0; {321#true} is VALID [2022-02-20 23:44:18,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {321#true} assume main_#t~short11#1; {323#|ULTIMATE.start_main_#t~short11#1|} is VALID [2022-02-20 23:44:18,483 INFO L290 TraceCheckUtils]: 4: Hoare triple {323#|ULTIMATE.start_main_#t~short11#1|} assume !main_#t~short11#1;havoc main_#t~nondet10#1;havoc main_#t~short11#1; {322#false} is VALID [2022-02-20 23:44:18,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {322#false} assume !!(~garbage~0.base != 0 || ~garbage~0.offset != 0); {322#false} is VALID [2022-02-20 23:44:18,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {322#false} assume !(1 == #valid[~garbage~0.base]); {322#false} is VALID [2022-02-20 23:44:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:18,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:18,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567166705] [2022-02-20 23:44:18,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567166705] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:18,484 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:18,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:44:18,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462032172] [2022-02-20 23:44:18,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:18,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:44:18,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:18,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:18,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:18,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:18,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:18,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:18,492 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:18,573 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-02-20 23:44:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:18,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:44:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 23:44:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 23:44:18,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2022-02-20 23:44:18,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:18,641 INFO L225 Difference]: With dead ends: 63 [2022-02-20 23:44:18,641 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 23:44:18,641 INFO L932 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 [2022-02-20 23:44:18,646 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:18,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 23:44:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-02-20 23:44:18,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:18,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,658 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,659 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:18,666 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-02-20 23:44:18,666 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-02-20 23:44:18,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:18,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:18,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 63 states. [2022-02-20 23:44:18,668 INFO L87 Difference]: Start difference. First operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 63 states. [2022-02-20 23:44:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:18,671 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-02-20 23:44:18,671 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-02-20 23:44:18,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:18,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:18,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:18,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2022-02-20 23:44:18,674 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2022-02-20 23:44:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:18,674 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2022-02-20 23:44:18,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-02-20 23:44:18,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:44:18,675 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:18,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:18,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:44:18,675 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:18,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:18,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2022-02-20 23:44:18,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:18,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739056005] [2022-02-20 23:44:18,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:18,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:18,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {578#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~S~0.base, ~S~0.offset := 0, 0;~pc1~0 := 1;~pc4~0 := 1;~t1~0.base, ~t1~0.offset := 0, 0;~x1~0.base, ~x1~0.offset := 0, 0;~garbage~0.base, ~garbage~0.offset := 0, 0;~t4~0.base, ~t4~0.offset := 0, 0;~x4~0.base, ~x4~0.offset := 0, 0;~res4~0 := 0; {580#(and (= ~garbage~0.offset 0) (= 0 ~garbage~0.base))} is VALID [2022-02-20 23:44:18,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#(and (= ~garbage~0.offset 0) (= 0 ~garbage~0.base))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet10#1, main_#t~short11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {580#(and (= ~garbage~0.offset 0) (= 0 ~garbage~0.base))} is VALID [2022-02-20 23:44:18,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {580#(and (= ~garbage~0.offset 0) (= 0 ~garbage~0.base))} main_#t~short11#1 := (~S~0.base != 0 || ~S~0.offset != 0) || 1 != ~pc4~0; {580#(and (= ~garbage~0.offset 0) (= 0 ~garbage~0.base))} is VALID [2022-02-20 23:44:18,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {580#(and (= ~garbage~0.offset 0) (= 0 ~garbage~0.base))} assume !main_#t~short11#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_#t~short11#1 := 0 != main_#t~nondet10#1; {580#(and (= ~garbage~0.offset 0) (= 0 ~garbage~0.base))} is VALID [2022-02-20 23:44:18,706 INFO L290 TraceCheckUtils]: 4: Hoare triple {580#(and (= ~garbage~0.offset 0) (= 0 ~garbage~0.base))} assume !main_#t~short11#1;havoc main_#t~nondet10#1;havoc main_#t~short11#1; {580#(and (= ~garbage~0.offset 0) (= 0 ~garbage~0.base))} is VALID [2022-02-20 23:44:18,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {580#(and (= ~garbage~0.offset 0) (= 0 ~garbage~0.base))} assume !!(~garbage~0.base != 0 || ~garbage~0.offset != 0); {579#false} is VALID [2022-02-20 23:44:18,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {579#false} assume !(1 == #valid[~garbage~0.base]); {579#false} is VALID [2022-02-20 23:44:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:18,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:18,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739056005] [2022-02-20 23:44:18,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739056005] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:18,708 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:18,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:18,708 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830815114] [2022-02-20 23:44:18,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:18,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:44:18,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:18,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:18,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:18,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:18,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:18,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:18,725 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:18,828 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2022-02-20 23:44:18,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:18,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:44:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-02-20 23:44:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-02-20 23:44:18,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2022-02-20 23:44:18,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:18,939 INFO L225 Difference]: With dead ends: 111 [2022-02-20 23:44:18,940 INFO L226 Difference]: Without dead ends: 111 [2022-02-20 23:44:18,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:18,941 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:18,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-20 23:44:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2022-02-20 23:44:18,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:18,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,945 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,946 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:18,948 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2022-02-20 23:44:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 145 transitions. [2022-02-20 23:44:18,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:18,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:18,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 111 states. [2022-02-20 23:44:18,950 INFO L87 Difference]: Start difference. First operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 111 states. [2022-02-20 23:44:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:18,952 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2022-02-20 23:44:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 145 transitions. [2022-02-20 23:44:18,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:18,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:18,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:18,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2022-02-20 23:44:18,955 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2022-02-20 23:44:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:18,956 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2022-02-20 23:44:18,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,956 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2022-02-20 23:44:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:18,956 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:18,957 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:18,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:44:18,957 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:18,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:18,957 INFO L85 PathProgramCache]: Analyzing trace with hash 177749355, now seen corresponding path program 1 times [2022-02-20 23:44:18,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:18,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13629071] [2022-02-20 23:44:18,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:18,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:18,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {1009#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~S~0.base, ~S~0.offset := 0, 0;~pc1~0 := 1;~pc4~0 := 1;~t1~0.base, ~t1~0.offset := 0, 0;~x1~0.base, ~x1~0.offset := 0, 0;~garbage~0.base, ~garbage~0.offset := 0, 0;~t4~0.base, ~t4~0.offset := 0, 0;~x4~0.base, ~x4~0.offset := 0, 0;~res4~0 := 0; {1011#(and (= ~S~0.base 0) (= ~pc4~0 1) (= ~S~0.offset 0))} is VALID [2022-02-20 23:44:18,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {1011#(and (= ~S~0.base 0) (= ~pc4~0 1) (= ~S~0.offset 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet10#1, main_#t~short11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {1011#(and (= ~S~0.base 0) (= ~pc4~0 1) (= ~S~0.offset 0))} is VALID [2022-02-20 23:44:18,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {1011#(and (= ~S~0.base 0) (= ~pc4~0 1) (= ~S~0.offset 0))} main_#t~short11#1 := (~S~0.base != 0 || ~S~0.offset != 0) || 1 != ~pc4~0; {1012#(not |ULTIMATE.start_main_#t~short11#1|)} is VALID [2022-02-20 23:44:18,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {1012#(not |ULTIMATE.start_main_#t~short11#1|)} assume main_#t~short11#1; {1010#false} is VALID [2022-02-20 23:44:18,992 INFO L290 TraceCheckUtils]: 4: Hoare triple {1010#false} assume !!main_#t~short11#1;havoc main_#t~nondet10#1;havoc main_#t~short11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; {1010#false} is VALID [2022-02-20 23:44:18,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {1010#false} assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;assume { :begin_inline_push } true;havoc push_#t~post3#1, push_#t~switch4#1, push_#t~malloc5#1.base, push_#t~malloc5#1.offset;push_#t~post3#1 := ~pc1~0;~pc1~0 := 1 + push_#t~post3#1;push_#t~switch4#1 := 1 == push_#t~post3#1; {1010#false} is VALID [2022-02-20 23:44:18,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {1010#false} assume push_#t~switch4#1;call push_#t~malloc5#1.base, push_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8);~x1~0.base, ~x1~0.offset := push_#t~malloc5#1.base, push_#t~malloc5#1.offset;havoc push_#t~malloc5#1.base, push_#t~malloc5#1.offset; {1010#false} is VALID [2022-02-20 23:44:18,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {1010#false} assume !(1 == #valid[~x1~0.base]); {1010#false} is VALID [2022-02-20 23:44:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:18,993 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:18,993 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13629071] [2022-02-20 23:44:18,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13629071] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:18,993 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:18,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:44:18,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699539017] [2022-02-20 23:44:18,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:18,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:18,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:18,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:18,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:19,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:44:19,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:19,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:44:19,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:19,000 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:19,156 INFO L93 Difference]: Finished difference Result 122 states and 174 transitions. [2022-02-20 23:44:19,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:44:19,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-02-20 23:44:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-02-20 23:44:19,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 117 transitions. [2022-02-20 23:44:19,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:19,238 INFO L225 Difference]: With dead ends: 122 [2022-02-20 23:44:19,238 INFO L226 Difference]: Without dead ends: 122 [2022-02-20 23:44:19,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:19,239 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 33 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:19,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 208 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-02-20 23:44:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2022-02-20 23:44:19,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:19,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 110 states, 90 states have (on average 1.9) internal successors, (171), 109 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,244 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 110 states, 90 states have (on average 1.9) internal successors, (171), 109 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,244 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 110 states, 90 states have (on average 1.9) internal successors, (171), 109 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:19,247 INFO L93 Difference]: Finished difference Result 122 states and 174 transitions. [2022-02-20 23:44:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2022-02-20 23:44:19,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:19,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:19,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 90 states have (on average 1.9) internal successors, (171), 109 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 122 states. [2022-02-20 23:44:19,248 INFO L87 Difference]: Start difference. First operand has 110 states, 90 states have (on average 1.9) internal successors, (171), 109 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 122 states. [2022-02-20 23:44:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:19,251 INFO L93 Difference]: Finished difference Result 122 states and 174 transitions. [2022-02-20 23:44:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2022-02-20 23:44:19,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:19,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:19,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:19,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.9) internal successors, (171), 109 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 171 transitions. [2022-02-20 23:44:19,254 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 171 transitions. Word has length 8 [2022-02-20 23:44:19,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:19,254 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 171 transitions. [2022-02-20 23:44:19,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 171 transitions. [2022-02-20 23:44:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:19,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:19,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:19,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:44:19,255 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:19,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:19,256 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2022-02-20 23:44:19,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:19,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082828627] [2022-02-20 23:44:19,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:19,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:19,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {1493#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~S~0.base, ~S~0.offset := 0, 0;~pc1~0 := 1;~pc4~0 := 1;~t1~0.base, ~t1~0.offset := 0, 0;~x1~0.base, ~x1~0.offset := 0, 0;~garbage~0.base, ~garbage~0.offset := 0, 0;~t4~0.base, ~t4~0.offset := 0, 0;~x4~0.base, ~x4~0.offset := 0, 0;~res4~0 := 0; {1493#true} is VALID [2022-02-20 23:44:19,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet10#1, main_#t~short11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {1495#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:44:19,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {1495#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#t~short11#1 := (~S~0.base != 0 || ~S~0.offset != 0) || 1 != ~pc4~0; {1495#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:44:19,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {1495#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !main_#t~short11#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_#t~short11#1 := 0 != main_#t~nondet10#1; {1495#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:44:19,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {1495#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !main_#t~short11#1;havoc main_#t~nondet10#1;havoc main_#t~short11#1; {1495#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:44:19,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {1495#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(~garbage~0.base != 0 || ~garbage~0.offset != 0); {1495#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:44:19,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {1495#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} ~S~0.base, ~S~0.offset := 0, 0;~t1~0.base, ~t1~0.offset := 0, 0;~x1~0.base, ~x1~0.offset := 0, 0;~t4~0.base, ~t4~0.offset := 0, 0;~x4~0.base, ~x4~0.offset := 0, 0;main_#res#1 := (if !(~garbage~0.base == 0 && ~garbage~0.offset == 0) then 1 else 0); {1495#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:44:19,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {1495#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {1494#false} is VALID [2022-02-20 23:44:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:19,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:19,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082828627] [2022-02-20 23:44:19,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082828627] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:19,311 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:19,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:19,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756980795] [2022-02-20 23:44:19,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:19,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:19,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:19,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:19,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:19,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:19,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:19,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:19,319 INFO L87 Difference]: Start difference. First operand 110 states and 171 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:19,420 INFO L93 Difference]: Finished difference Result 207 states and 321 transitions. [2022-02-20 23:44:19,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:19,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:19,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:19,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-20 23:44:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-20 23:44:19,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2022-02-20 23:44:19,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:19,515 INFO L225 Difference]: With dead ends: 207 [2022-02-20 23:44:19,515 INFO L226 Difference]: Without dead ends: 204 [2022-02-20 23:44:19,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:19,516 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:19,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-02-20 23:44:19,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 183. [2022-02-20 23:44:19,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:19,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand has 183 states, 163 states have (on average 1.8711656441717792) internal successors, (305), 182 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,523 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand has 183 states, 163 states have (on average 1.8711656441717792) internal successors, (305), 182 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,523 INFO L87 Difference]: Start difference. First operand 204 states. Second operand has 183 states, 163 states have (on average 1.8711656441717792) internal successors, (305), 182 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:19,528 INFO L93 Difference]: Finished difference Result 204 states and 316 transitions. [2022-02-20 23:44:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 316 transitions. [2022-02-20 23:44:19,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:19,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:19,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 163 states have (on average 1.8711656441717792) internal successors, (305), 182 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 204 states. [2022-02-20 23:44:19,530 INFO L87 Difference]: Start difference. First operand has 183 states, 163 states have (on average 1.8711656441717792) internal successors, (305), 182 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 204 states. [2022-02-20 23:44:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:19,537 INFO L93 Difference]: Finished difference Result 204 states and 316 transitions. [2022-02-20 23:44:19,537 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 316 transitions. [2022-02-20 23:44:19,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:19,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:19,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:19,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 163 states have (on average 1.8711656441717792) internal successors, (305), 182 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 305 transitions. [2022-02-20 23:44:19,544 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 305 transitions. Word has length 8 [2022-02-20 23:44:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:19,545 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 305 transitions. [2022-02-20 23:44:19,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 305 transitions. [2022-02-20 23:44:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:19,545 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:19,545 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:19,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:44:19,546 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:19,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:19,546 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2022-02-20 23:44:19,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:19,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798858465] [2022-02-20 23:44:19,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:19,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:19,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {2296#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~S~0.base, ~S~0.offset := 0, 0;~pc1~0 := 1;~pc4~0 := 1;~t1~0.base, ~t1~0.offset := 0, 0;~x1~0.base, ~x1~0.offset := 0, 0;~garbage~0.base, ~garbage~0.offset := 0, 0;~t4~0.base, ~t4~0.offset := 0, 0;~x4~0.base, ~x4~0.offset := 0, 0;~res4~0 := 0; {2296#true} is VALID [2022-02-20 23:44:19,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {2296#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet10#1, main_#t~short11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {2296#true} is VALID [2022-02-20 23:44:19,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {2296#true} main_#t~short11#1 := (~S~0.base != 0 || ~S~0.offset != 0) || 1 != ~pc4~0; {2296#true} is VALID [2022-02-20 23:44:19,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {2296#true} assume !main_#t~short11#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_#t~short11#1 := 0 != main_#t~nondet10#1; {2296#true} is VALID [2022-02-20 23:44:19,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {2296#true} assume !!main_#t~short11#1;havoc main_#t~nondet10#1;havoc main_#t~short11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; {2296#true} is VALID [2022-02-20 23:44:19,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {2296#true} assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;assume { :begin_inline_push } true;havoc push_#t~post3#1, push_#t~switch4#1, push_#t~malloc5#1.base, push_#t~malloc5#1.offset;push_#t~post3#1 := ~pc1~0;~pc1~0 := 1 + push_#t~post3#1;push_#t~switch4#1 := 1 == push_#t~post3#1; {2296#true} is VALID [2022-02-20 23:44:19,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {2296#true} assume push_#t~switch4#1;call push_#t~malloc5#1.base, push_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8);~x1~0.base, ~x1~0.offset := push_#t~malloc5#1.base, push_#t~malloc5#1.offset;havoc push_#t~malloc5#1.base, push_#t~malloc5#1.offset; {2298#(= (select |#valid| ~x1~0.base) 1)} is VALID [2022-02-20 23:44:19,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {2298#(= (select |#valid| ~x1~0.base) 1)} assume !(1 == #valid[~x1~0.base]); {2297#false} is VALID [2022-02-20 23:44:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:19,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:19,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798858465] [2022-02-20 23:44:19,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798858465] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:19,576 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:19,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:19,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432770194] [2022-02-20 23:44:19,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:19,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:19,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:19,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:19,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:19,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:19,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:19,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:19,583 INFO L87 Difference]: Start difference. First operand 183 states and 305 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:19,725 INFO L93 Difference]: Finished difference Result 274 states and 434 transitions. [2022-02-20 23:44:19,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:19,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:19,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2022-02-20 23:44:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2022-02-20 23:44:19,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2022-02-20 23:44:19,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:19,840 INFO L225 Difference]: With dead ends: 274 [2022-02-20 23:44:19,840 INFO L226 Difference]: Without dead ends: 274 [2022-02-20 23:44:19,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:19,842 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:19,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 172 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-02-20 23:44:19,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 253. [2022-02-20 23:44:19,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:19,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand has 253 states, 235 states have (on average 1.7872340425531914) internal successors, (420), 252 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,859 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand has 253 states, 235 states have (on average 1.7872340425531914) internal successors, (420), 252 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,859 INFO L87 Difference]: Start difference. First operand 274 states. Second operand has 253 states, 235 states have (on average 1.7872340425531914) internal successors, (420), 252 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:19,865 INFO L93 Difference]: Finished difference Result 274 states and 434 transitions. [2022-02-20 23:44:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 434 transitions. [2022-02-20 23:44:19,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:19,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:19,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 235 states have (on average 1.7872340425531914) internal successors, (420), 252 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 274 states. [2022-02-20 23:44:19,866 INFO L87 Difference]: Start difference. First operand has 253 states, 235 states have (on average 1.7872340425531914) internal successors, (420), 252 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 274 states. [2022-02-20 23:44:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:19,872 INFO L93 Difference]: Finished difference Result 274 states and 434 transitions. [2022-02-20 23:44:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 434 transitions. [2022-02-20 23:44:19,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:19,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:19,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:19,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 235 states have (on average 1.7872340425531914) internal successors, (420), 252 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 420 transitions. [2022-02-20 23:44:19,878 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 420 transitions. Word has length 8 [2022-02-20 23:44:19,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:19,878 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 420 transitions. [2022-02-20 23:44:19,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,878 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 420 transitions. [2022-02-20 23:44:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:19,878 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:19,879 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:19,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:44:19,879 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:19,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:19,880 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2022-02-20 23:44:19,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:19,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610280666] [2022-02-20 23:44:19,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:19,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:19,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {3376#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~S~0.base, ~S~0.offset := 0, 0;~pc1~0 := 1;~pc4~0 := 1;~t1~0.base, ~t1~0.offset := 0, 0;~x1~0.base, ~x1~0.offset := 0, 0;~garbage~0.base, ~garbage~0.offset := 0, 0;~t4~0.base, ~t4~0.offset := 0, 0;~x4~0.base, ~x4~0.offset := 0, 0;~res4~0 := 0; {3376#true} is VALID [2022-02-20 23:44:19,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {3376#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet10#1, main_#t~short11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {3376#true} is VALID [2022-02-20 23:44:19,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {3376#true} main_#t~short11#1 := (~S~0.base != 0 || ~S~0.offset != 0) || 1 != ~pc4~0; {3376#true} is VALID [2022-02-20 23:44:19,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {3376#true} assume !main_#t~short11#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_#t~short11#1 := 0 != main_#t~nondet10#1; {3376#true} is VALID [2022-02-20 23:44:19,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {3376#true} assume !!main_#t~short11#1;havoc main_#t~nondet10#1;havoc main_#t~short11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; {3376#true} is VALID [2022-02-20 23:44:19,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {3376#true} assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;assume { :begin_inline_push } true;havoc push_#t~post3#1, push_#t~switch4#1, push_#t~malloc5#1.base, push_#t~malloc5#1.offset;push_#t~post3#1 := ~pc1~0;~pc1~0 := 1 + push_#t~post3#1;push_#t~switch4#1 := 1 == push_#t~post3#1; {3376#true} is VALID [2022-02-20 23:44:19,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {3376#true} assume push_#t~switch4#1;call push_#t~malloc5#1.base, push_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8);~x1~0.base, ~x1~0.offset := push_#t~malloc5#1.base, push_#t~malloc5#1.offset;havoc push_#t~malloc5#1.base, push_#t~malloc5#1.offset; {3378#(and (= ~x1~0.offset 0) (<= 8 (select |#length| ~x1~0.base)))} is VALID [2022-02-20 23:44:19,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {3378#(and (= ~x1~0.offset 0) (<= 8 (select |#length| ~x1~0.base)))} assume !(4 + ~x1~0.offset <= #length[~x1~0.base] && 0 <= ~x1~0.offset); {3377#false} is VALID [2022-02-20 23:44:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:19,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:19,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610280666] [2022-02-20 23:44:19,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610280666] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:19,957 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:19,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:19,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857078352] [2022-02-20 23:44:19,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:19,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:19,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:19,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:19,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:19,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:19,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:19,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:19,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:19,964 INFO L87 Difference]: Start difference. First operand 253 states and 420 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:20,098 INFO L93 Difference]: Finished difference Result 269 states and 421 transitions. [2022-02-20 23:44:20,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:20,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:20,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2022-02-20 23:44:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2022-02-20 23:44:20,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 145 transitions. [2022-02-20 23:44:20,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:20,194 INFO L225 Difference]: With dead ends: 269 [2022-02-20 23:44:20,194 INFO L226 Difference]: Without dead ends: 269 [2022-02-20 23:44:20,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:20,194 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:20,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:20,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-02-20 23:44:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 251. [2022-02-20 23:44:20,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:20,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand has 251 states, 235 states have (on average 1.7361702127659575) internal successors, (408), 250 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,198 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand has 251 states, 235 states have (on average 1.7361702127659575) internal successors, (408), 250 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,199 INFO L87 Difference]: Start difference. First operand 269 states. Second operand has 251 states, 235 states have (on average 1.7361702127659575) internal successors, (408), 250 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:20,204 INFO L93 Difference]: Finished difference Result 269 states and 421 transitions. [2022-02-20 23:44:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 421 transitions. [2022-02-20 23:44:20,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:20,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:20,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 251 states, 235 states have (on average 1.7361702127659575) internal successors, (408), 250 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 269 states. [2022-02-20 23:44:20,205 INFO L87 Difference]: Start difference. First operand has 251 states, 235 states have (on average 1.7361702127659575) internal successors, (408), 250 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 269 states. [2022-02-20 23:44:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:20,210 INFO L93 Difference]: Finished difference Result 269 states and 421 transitions. [2022-02-20 23:44:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 421 transitions. [2022-02-20 23:44:20,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:20,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:20,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:20,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 235 states have (on average 1.7361702127659575) internal successors, (408), 250 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 408 transitions. [2022-02-20 23:44:20,216 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 408 transitions. Word has length 8 [2022-02-20 23:44:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:20,216 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 408 transitions. [2022-02-20 23:44:20,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 408 transitions. [2022-02-20 23:44:20,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:44:20,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:20,217 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:20,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:44:20,217 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:20,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:20,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2022-02-20 23:44:20,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:20,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062424864] [2022-02-20 23:44:20,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:20,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:20,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {4439#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~S~0.base, ~S~0.offset := 0, 0;~pc1~0 := 1;~pc4~0 := 1;~t1~0.base, ~t1~0.offset := 0, 0;~x1~0.base, ~x1~0.offset := 0, 0;~garbage~0.base, ~garbage~0.offset := 0, 0;~t4~0.base, ~t4~0.offset := 0, 0;~x4~0.base, ~x4~0.offset := 0, 0;~res4~0 := 0; {4441#(= ~pc1~0 1)} is VALID [2022-02-20 23:44:20,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {4441#(= ~pc1~0 1)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet10#1, main_#t~short11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {4441#(= ~pc1~0 1)} is VALID [2022-02-20 23:44:20,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {4441#(= ~pc1~0 1)} main_#t~short11#1 := (~S~0.base != 0 || ~S~0.offset != 0) || 1 != ~pc4~0; {4441#(= ~pc1~0 1)} is VALID [2022-02-20 23:44:20,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {4441#(= ~pc1~0 1)} assume !main_#t~short11#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_#t~short11#1 := 0 != main_#t~nondet10#1; {4441#(= ~pc1~0 1)} is VALID [2022-02-20 23:44:20,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {4441#(= ~pc1~0 1)} assume !!main_#t~short11#1;havoc main_#t~nondet10#1;havoc main_#t~short11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; {4441#(= ~pc1~0 1)} is VALID [2022-02-20 23:44:20,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {4441#(= ~pc1~0 1)} assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;assume { :begin_inline_push } true;havoc push_#t~post3#1, push_#t~switch4#1, push_#t~malloc5#1.base, push_#t~malloc5#1.offset;push_#t~post3#1 := ~pc1~0;~pc1~0 := 1 + push_#t~post3#1;push_#t~switch4#1 := 1 == push_#t~post3#1; {4442#|ULTIMATE.start_push_#t~switch4#1|} is VALID [2022-02-20 23:44:20,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {4442#|ULTIMATE.start_push_#t~switch4#1|} assume !push_#t~switch4#1;push_#t~switch4#1 := push_#t~switch4#1 || 2 == push_#t~post3#1; {4440#false} is VALID [2022-02-20 23:44:20,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {4440#false} assume push_#t~switch4#1; {4440#false} is VALID [2022-02-20 23:44:20,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {4440#false} assume !(1 == #valid[~x1~0.base]); {4440#false} is VALID [2022-02-20 23:44:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:20,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:20,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062424864] [2022-02-20 23:44:20,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062424864] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:20,240 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:20,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:44:20,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031757945] [2022-02-20 23:44:20,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:20,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:44:20,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:20,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:20,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:44:20,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:20,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:44:20,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:20,247 INFO L87 Difference]: Start difference. First operand 251 states and 408 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:20,392 INFO L93 Difference]: Finished difference Result 296 states and 411 transitions. [2022-02-20 23:44:20,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:44:20,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:44:20,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 222 transitions. [2022-02-20 23:44:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 222 transitions. [2022-02-20 23:44:20,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 222 transitions. [2022-02-20 23:44:20,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:20,531 INFO L225 Difference]: With dead ends: 296 [2022-02-20 23:44:20,531 INFO L226 Difference]: Without dead ends: 296 [2022-02-20 23:44:20,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:20,532 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 105 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:20,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 283 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:20,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-02-20 23:44:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 188. [2022-02-20 23:44:20,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:20,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 296 states. Second operand has 188 states, 176 states have (on average 1.6534090909090908) internal successors, (291), 187 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,543 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand has 188 states, 176 states have (on average 1.6534090909090908) internal successors, (291), 187 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,544 INFO L87 Difference]: Start difference. First operand 296 states. Second operand has 188 states, 176 states have (on average 1.6534090909090908) internal successors, (291), 187 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:20,548 INFO L93 Difference]: Finished difference Result 296 states and 411 transitions. [2022-02-20 23:44:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 411 transitions. [2022-02-20 23:44:20,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:20,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:20,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 176 states have (on average 1.6534090909090908) internal successors, (291), 187 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 296 states. [2022-02-20 23:44:20,549 INFO L87 Difference]: Start difference. First operand has 188 states, 176 states have (on average 1.6534090909090908) internal successors, (291), 187 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 296 states. [2022-02-20 23:44:20,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:20,553 INFO L93 Difference]: Finished difference Result 296 states and 411 transitions. [2022-02-20 23:44:20,553 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 411 transitions. [2022-02-20 23:44:20,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:20,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:20,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:20,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 176 states have (on average 1.6534090909090908) internal successors, (291), 187 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 291 transitions. [2022-02-20 23:44:20,556 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 291 transitions. Word has length 9 [2022-02-20 23:44:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:20,557 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 291 transitions. [2022-02-20 23:44:20,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 291 transitions. [2022-02-20 23:44:20,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:44:20,557 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:20,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:20,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:44:20,557 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:20,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:20,558 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2022-02-20 23:44:20,558 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:20,558 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760663038] [2022-02-20 23:44:20,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:20,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:20,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {5523#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~S~0.base, ~S~0.offset := 0, 0;~pc1~0 := 1;~pc4~0 := 1;~t1~0.base, ~t1~0.offset := 0, 0;~x1~0.base, ~x1~0.offset := 0, 0;~garbage~0.base, ~garbage~0.offset := 0, 0;~t4~0.base, ~t4~0.offset := 0, 0;~x4~0.base, ~x4~0.offset := 0, 0;~res4~0 := 0; {5525#(= ~pc4~0 1)} is VALID [2022-02-20 23:44:20,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {5525#(= ~pc4~0 1)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet10#1, main_#t~short11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {5525#(= ~pc4~0 1)} is VALID [2022-02-20 23:44:20,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {5525#(= ~pc4~0 1)} main_#t~short11#1 := (~S~0.base != 0 || ~S~0.offset != 0) || 1 != ~pc4~0; {5525#(= ~pc4~0 1)} is VALID [2022-02-20 23:44:20,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {5525#(= ~pc4~0 1)} assume !main_#t~short11#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_#t~short11#1 := 0 != main_#t~nondet10#1; {5525#(= ~pc4~0 1)} is VALID [2022-02-20 23:44:20,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {5525#(= ~pc4~0 1)} assume !!main_#t~short11#1;havoc main_#t~nondet10#1;havoc main_#t~short11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; {5525#(= ~pc4~0 1)} is VALID [2022-02-20 23:44:20,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {5525#(= ~pc4~0 1)} assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1;assume { :begin_inline_pop } true;havoc pop_#t~post6#1, pop_#t~switch7#1, pop_#t~mem8#1.base, pop_#t~mem8#1.offset, pop_#t~mem9#1;pop_#t~post6#1 := ~pc4~0;~pc4~0 := 1 + pop_#t~post6#1;pop_#t~switch7#1 := 1 == pop_#t~post6#1; {5526#|ULTIMATE.start_pop_#t~switch7#1|} is VALID [2022-02-20 23:44:20,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {5526#|ULTIMATE.start_pop_#t~switch7#1|} assume !pop_#t~switch7#1;pop_#t~switch7#1 := pop_#t~switch7#1 || 2 == pop_#t~post6#1; {5524#false} is VALID [2022-02-20 23:44:20,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {5524#false} assume !pop_#t~switch7#1;pop_#t~switch7#1 := pop_#t~switch7#1 || 3 == pop_#t~post6#1; {5524#false} is VALID [2022-02-20 23:44:20,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {5524#false} assume pop_#t~switch7#1; {5524#false} is VALID [2022-02-20 23:44:20,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {5524#false} assume !(1 == #valid[~t4~0.base]); {5524#false} is VALID [2022-02-20 23:44:20,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:20,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:20,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760663038] [2022-02-20 23:44:20,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760663038] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:20,594 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:20,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:44:20,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615479920] [2022-02-20 23:44:20,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:20,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:44:20,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:20,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:20,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:44:20,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:20,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:44:20,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:20,602 INFO L87 Difference]: Start difference. First operand 188 states and 291 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:20,759 INFO L93 Difference]: Finished difference Result 385 states and 562 transitions. [2022-02-20 23:44:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:44:20,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:44:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2022-02-20 23:44:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2022-02-20 23:44:20,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 187 transitions. [2022-02-20 23:44:20,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:20,876 INFO L225 Difference]: With dead ends: 385 [2022-02-20 23:44:20,876 INFO L226 Difference]: Without dead ends: 385 [2022-02-20 23:44:20,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:20,877 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 108 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:20,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 232 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:20,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-02-20 23:44:20,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 259. [2022-02-20 23:44:20,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:20,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 385 states. Second operand has 259 states, 247 states have (on average 1.591093117408907) internal successors, (393), 258 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,881 INFO L74 IsIncluded]: Start isIncluded. First operand 385 states. Second operand has 259 states, 247 states have (on average 1.591093117408907) internal successors, (393), 258 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,881 INFO L87 Difference]: Start difference. First operand 385 states. Second operand has 259 states, 247 states have (on average 1.591093117408907) internal successors, (393), 258 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:20,887 INFO L93 Difference]: Finished difference Result 385 states and 562 transitions. [2022-02-20 23:44:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 562 transitions. [2022-02-20 23:44:20,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:20,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:20,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 259 states, 247 states have (on average 1.591093117408907) internal successors, (393), 258 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 385 states. [2022-02-20 23:44:20,889 INFO L87 Difference]: Start difference. First operand has 259 states, 247 states have (on average 1.591093117408907) internal successors, (393), 258 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 385 states. [2022-02-20 23:44:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:20,895 INFO L93 Difference]: Finished difference Result 385 states and 562 transitions. [2022-02-20 23:44:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 562 transitions. [2022-02-20 23:44:20,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:20,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:20,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:20,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 247 states have (on average 1.591093117408907) internal successors, (393), 258 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2022-02-20 23:44:20,899 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 10 [2022-02-20 23:44:20,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:20,900 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2022-02-20 23:44:20,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2022-02-20 23:44:20,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:44:20,900 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:20,900 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:20,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:44:20,901 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:20,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:20,901 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2022-02-20 23:44:20,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:20,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803683623] [2022-02-20 23:44:20,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:20,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:44:20,919 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:44:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:44:20,943 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:44:20,948 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:44:20,949 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2022-02-20 23:44:20,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (18 of 20 remaining) [2022-02-20 23:44:20,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (17 of 20 remaining) [2022-02-20 23:44:20,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (16 of 20 remaining) [2022-02-20 23:44:20,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (15 of 20 remaining) [2022-02-20 23:44:20,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (14 of 20 remaining) [2022-02-20 23:44:20,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (13 of 20 remaining) [2022-02-20 23:44:20,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (12 of 20 remaining) [2022-02-20 23:44:20,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (11 of 20 remaining) [2022-02-20 23:44:20,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (10 of 20 remaining) [2022-02-20 23:44:20,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (9 of 20 remaining) [2022-02-20 23:44:20,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (8 of 20 remaining) [2022-02-20 23:44:20,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (7 of 20 remaining) [2022-02-20 23:44:20,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (6 of 20 remaining) [2022-02-20 23:44:20,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (5 of 20 remaining) [2022-02-20 23:44:20,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (4 of 20 remaining) [2022-02-20 23:44:20,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (3 of 20 remaining) [2022-02-20 23:44:20,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2022-02-20 23:44:20,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2022-02-20 23:44:20,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2022-02-20 23:44:20,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:44:20,958 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:20,960 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:44:20,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:44:20 BoogieIcfgContainer [2022-02-20 23:44:20,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:44:20,983 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:44:20,983 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:44:20,983 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:44:20,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:17" (3/4) ... [2022-02-20 23:44:20,986 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 23:44:20,986 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:44:20,986 INFO L158 Benchmark]: Toolchain (without parser) took 3800.13ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 104.5MB in the beginning and 97.5MB in the end (delta: 7.0MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2022-02-20 23:44:20,986 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory was 46.1MB in the beginning and 46.1MB in the end (delta: 38.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:20,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.29ms. Allocated memory is still 138.4MB. Free memory was 104.2MB in the beginning and 104.4MB in the end (delta: -184.5kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:44:20,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.05ms. Allocated memory is still 138.4MB. Free memory was 104.4MB in the beginning and 101.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:20,987 INFO L158 Benchmark]: Boogie Preprocessor took 34.59ms. Allocated memory is still 138.4MB. Free memory was 101.9MB in the beginning and 100.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:20,987 INFO L158 Benchmark]: RCFGBuilder took 394.90ms. Allocated memory is still 138.4MB. Free memory was 100.2MB in the beginning and 80.8MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 23:44:20,987 INFO L158 Benchmark]: TraceAbstraction took 2999.93ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 80.5MB in the beginning and 98.6MB in the end (delta: -18.0MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2022-02-20 23:44:20,988 INFO L158 Benchmark]: Witness Printer took 2.56ms. Allocated memory is still 174.1MB. Free memory was 98.6MB in the beginning and 97.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:20,989 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory was 46.1MB in the beginning and 46.1MB in the end (delta: 38.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.29ms. Allocated memory is still 138.4MB. Free memory was 104.2MB in the beginning and 104.4MB in the end (delta: -184.5kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.05ms. Allocated memory is still 138.4MB. Free memory was 104.4MB in the beginning and 101.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.59ms. Allocated memory is still 138.4MB. Free memory was 101.9MB in the beginning and 100.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 394.90ms. Allocated memory is still 138.4MB. Free memory was 100.2MB in the beginning and 80.8MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2999.93ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 80.5MB in the beginning and 98.6MB in the end (delta: -18.0MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * Witness Printer took 2.56ms. Allocated memory is still 174.1MB. Free memory was 98.6MB in the beginning and 97.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] S || 1 != pc4 || __VERIFIER_nondet_int() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc4 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc4 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 504 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 504 mSDsluCounter, 1565 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 658 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189 IncrementalHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 907 mSDtfsCounter, 189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=259occurred in iteration=9, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 324 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 23:44:21,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:44:22,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:44:22,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:44:22,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:44:22,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:44:22,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:44:22,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:44:22,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:44:22,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:44:22,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:44:22,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:44:22,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:44:22,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:44:22,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:44:22,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:44:22,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:44:22,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:44:22,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:44:22,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:44:22,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:44:22,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:44:22,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:44:22,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:44:22,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:44:22,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:44:22,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:44:22,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:44:22,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:44:22,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:44:22,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:44:22,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:44:22,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:44:22,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:44:22,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:44:22,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:44:22,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:44:22,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:44:22,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:44:22,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:44:22,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:44:22,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:44:22,726 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:44:22,754 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:44:22,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:44:22,755 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:44:22,755 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:44:22,756 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:44:22,756 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:44:22,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:44:22,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:44:22,757 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:44:22,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:44:22,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:44:22,758 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:44:22,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:44:22,759 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:44:22,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:44:22,759 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:44:22,759 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:44:22,759 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:44:22,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:44:22,760 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:44:22,760 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:44:22,760 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:44:22,760 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:44:22,760 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:44:22,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:44:22,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:44:22,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:44:22,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:22,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:44:22,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:44:22,761 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:44:22,761 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:44:22,761 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:44:22,762 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 [2022-02-20 23:44:23,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:44:23,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:44:23,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:44:23,044 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:44:23,046 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:44:23,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.2.i [2022-02-20 23:44:23,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/558f9a637/69f05da437b44866ae1dc513cc5ba3c0/FLAG179cd6e5b [2022-02-20 23:44:23,448 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:44:23,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.2.i [2022-02-20 23:44:23,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/558f9a637/69f05da437b44866ae1dc513cc5ba3c0/FLAG179cd6e5b [2022-02-20 23:44:23,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/558f9a637/69f05da437b44866ae1dc513cc5ba3c0 [2022-02-20 23:44:23,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:44:23,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:44:23,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:23,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:44:23,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:44:23,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:23" (1/1) ... [2022-02-20 23:44:23,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354041f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:23, skipping insertion in model container [2022-02-20 23:44:23,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:23" (1/1) ... [2022-02-20 23:44:23,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:44:23,514 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:44:23,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:23,811 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:44:23,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:23,894 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:44:23,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:23 WrapperNode [2022-02-20 23:44:23,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:23,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:23,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:44:23,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:44:23,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:23" (1/1) ... [2022-02-20 23:44:23,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:23" (1/1) ... [2022-02-20 23:44:23,967 INFO L137 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2022-02-20 23:44:23,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:23,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:44:23,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:44:23,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:44:23,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:23" (1/1) ... [2022-02-20 23:44:23,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:23" (1/1) ... [2022-02-20 23:44:23,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:23" (1/1) ... [2022-02-20 23:44:23,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:23" (1/1) ... [2022-02-20 23:44:23,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:23" (1/1) ... [2022-02-20 23:44:23,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:23" (1/1) ... [2022-02-20 23:44:24,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:23" (1/1) ... [2022-02-20 23:44:24,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:44:24,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:44:24,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:44:24,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:44:24,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:23" (1/1) ... [2022-02-20 23:44:24,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:24,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:24,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:44:24,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:44:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:44:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:44:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:44:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:44:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:44:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:44:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:44:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:44:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:44:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:44:24,133 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:44:24,134 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:44:24,450 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:44:24,455 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:44:24,455 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:44:24,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:24 BoogieIcfgContainer [2022-02-20 23:44:24,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:44:24,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:44:24,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:44:24,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:44:24,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:44:23" (1/3) ... [2022-02-20 23:44:24,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f3bebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:24, skipping insertion in model container [2022-02-20 23:44:24,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:23" (2/3) ... [2022-02-20 23:44:24,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f3bebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:24, skipping insertion in model container [2022-02-20 23:44:24,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:24" (3/3) ... [2022-02-20 23:44:24,463 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.2.i [2022-02-20 23:44:24,467 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:44:24,467 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-02-20 23:44:24,508 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:44:24,514 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:44:24,514 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-02-20 23:44:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:24,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:44:24,530 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:24,531 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:44:24,531 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:24,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:24,535 INFO L85 PathProgramCache]: Analyzing trace with hash 28701640, now seen corresponding path program 1 times [2022-02-20 23:44:24,543 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:24,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5554566] [2022-02-20 23:44:24,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:24,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:24,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:24,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:24,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:44:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:24,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:44:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:24,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:24,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {65#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);~S~0.base, ~S~0.offset := 0bv32, 0bv32;~pc1~0 := 1bv32;~pc4~0 := 1bv32;~t1~0.base, ~t1~0.offset := 0bv32, 0bv32;~x1~0.base, ~x1~0.offset := 0bv32, 0bv32;~garbage~0.base, ~garbage~0.offset := 0bv32, 0bv32;~t4~0.base, ~t4~0.offset := 0bv32, 0bv32;~x4~0.base, ~x4~0.offset := 0bv32, 0bv32;~res4~0 := 0bv32; {70#(and (= ~garbage~0.base (_ bv0 32)) (= ~garbage~0.offset (_ bv0 32)))} is VALID [2022-02-20 23:44:24,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {70#(and (= ~garbage~0.base (_ bv0 32)) (= ~garbage~0.offset (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet10#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {70#(and (= ~garbage~0.base (_ bv0 32)) (= ~garbage~0.offset (_ bv0 32)))} is VALID [2022-02-20 23:44:24,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {70#(and (= ~garbage~0.base (_ bv0 32)) (= ~garbage~0.offset (_ bv0 32)))} assume !(((~S~0.base != 0bv32 || ~S~0.offset != 0bv32) || 1bv32 != ~pc4~0) || 0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {70#(and (= ~garbage~0.base (_ bv0 32)) (= ~garbage~0.offset (_ bv0 32)))} is VALID [2022-02-20 23:44:24,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {70#(and (= ~garbage~0.base (_ bv0 32)) (= ~garbage~0.offset (_ bv0 32)))} assume !!(~garbage~0.base != 0bv32 || ~garbage~0.offset != 0bv32); {66#false} is VALID [2022-02-20 23:44:24,672 INFO L290 TraceCheckUtils]: 4: Hoare triple {66#false} assume !(1bv1 == #valid[~garbage~0.base]); {66#false} is VALID [2022-02-20 23:44:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:24,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:24,673 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:24,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5554566] [2022-02-20 23:44:24,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5554566] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:24,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:24,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:24,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274860859] [2022-02-20 23:44:24,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:24,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:44:24,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:24,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:24,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:24,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:24,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:24,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:24,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:24,701 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:24,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:24,977 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2022-02-20 23:44:24,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:24,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:44:24,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-02-20 23:44:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-02-20 23:44:24,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2022-02-20 23:44:25,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:25,164 INFO L225 Difference]: With dead ends: 107 [2022-02-20 23:44:25,164 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 23:44:25,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:25,167 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 63 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:25,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 134 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:25,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 23:44:25,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2022-02-20 23:44:25,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:25,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 87 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 86 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:25,188 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 87 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 86 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:25,189 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 87 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 86 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:25,195 INFO L93 Difference]: Finished difference Result 105 states and 137 transitions. [2022-02-20 23:44:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 137 transitions. [2022-02-20 23:44:25,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:25,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:25,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 86 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 105 states. [2022-02-20 23:44:25,199 INFO L87 Difference]: Start difference. First operand has 87 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 86 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 105 states. [2022-02-20 23:44:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:25,210 INFO L93 Difference]: Finished difference Result 105 states and 137 transitions. [2022-02-20 23:44:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 137 transitions. [2022-02-20 23:44:25,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:25,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:25,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:25,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 86 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2022-02-20 23:44:25,214 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 5 [2022-02-20 23:44:25,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:25,214 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2022-02-20 23:44:25,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2022-02-20 23:44:25,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:44:25,215 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:25,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:44:25,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:44:25,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:25,421 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:25,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:25,422 INFO L85 PathProgramCache]: Analyzing trace with hash 889749439, now seen corresponding path program 1 times [2022-02-20 23:44:25,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:25,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791403677] [2022-02-20 23:44:25,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:25,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:25,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:25,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:25,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:44:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:25,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:44:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:25,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:25,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {486#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);~S~0.base, ~S~0.offset := 0bv32, 0bv32;~pc1~0 := 1bv32;~pc4~0 := 1bv32;~t1~0.base, ~t1~0.offset := 0bv32, 0bv32;~x1~0.base, ~x1~0.offset := 0bv32, 0bv32;~garbage~0.base, ~garbage~0.offset := 0bv32, 0bv32;~t4~0.base, ~t4~0.offset := 0bv32, 0bv32;~x4~0.base, ~x4~0.offset := 0bv32, 0bv32;~res4~0 := 0bv32; {486#true} is VALID [2022-02-20 23:44:25,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {486#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet10#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {494#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:44:25,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {494#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(((~S~0.base != 0bv32 || ~S~0.offset != 0bv32) || 1bv32 != ~pc4~0) || 0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {494#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:44:25,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {494#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(~garbage~0.base != 0bv32 || ~garbage~0.offset != 0bv32); {494#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:44:25,500 INFO L290 TraceCheckUtils]: 4: Hoare triple {494#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} ~S~0.base, ~S~0.offset := 0bv32, 0bv32;~t1~0.base, ~t1~0.offset := 0bv32, 0bv32;~x1~0.base, ~x1~0.offset := 0bv32, 0bv32;~t4~0.base, ~t4~0.offset := 0bv32, 0bv32;~x4~0.base, ~x4~0.offset := 0bv32, 0bv32;main_#res#1 := (if !(~garbage~0.base == 0bv32 && ~garbage~0.offset == 0bv32) then 1bv32 else 0bv32); {494#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:44:25,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {494#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {487#false} is VALID [2022-02-20 23:44:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:25,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:25,500 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:25,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791403677] [2022-02-20 23:44:25,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791403677] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:25,501 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:25,501 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:25,501 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003620575] [2022-02-20 23:44:25,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:25,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:44:25,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:25,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:25,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:25,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:25,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:25,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:25,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:25,518 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:25,813 INFO L93 Difference]: Finished difference Result 163 states and 243 transitions. [2022-02-20 23:44:25,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:25,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:44:25,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-02-20 23:44:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:25,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-02-20 23:44:25,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2022-02-20 23:44:25,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:25,952 INFO L225 Difference]: With dead ends: 163 [2022-02-20 23:44:25,952 INFO L226 Difference]: Without dead ends: 160 [2022-02-20 23:44:25,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:25,953 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 62 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:25,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:25,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-02-20 23:44:25,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2022-02-20 23:44:25,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:25,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 140 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 139 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:25,960 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 140 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 139 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:25,960 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 140 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 139 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:25,965 INFO L93 Difference]: Finished difference Result 160 states and 239 transitions. [2022-02-20 23:44:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 239 transitions. [2022-02-20 23:44:25,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:25,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:25,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 139 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 160 states. [2022-02-20 23:44:25,966 INFO L87 Difference]: Start difference. First operand has 140 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 139 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 160 states. [2022-02-20 23:44:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:25,971 INFO L93 Difference]: Finished difference Result 160 states and 239 transitions. [2022-02-20 23:44:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 239 transitions. [2022-02-20 23:44:25,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:25,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:25,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:25,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:25,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 139 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 229 transitions. [2022-02-20 23:44:25,984 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 229 transitions. Word has length 6 [2022-02-20 23:44:25,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:25,985 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 229 transitions. [2022-02-20 23:44:25,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 229 transitions. [2022-02-20 23:44:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:44:25,985 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:25,986 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:44:25,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:26,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:26,192 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:26,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:26,193 INFO L85 PathProgramCache]: Analyzing trace with hash 889692424, now seen corresponding path program 1 times [2022-02-20 23:44:26,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:26,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713560680] [2022-02-20 23:44:26,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:26,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:26,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:26,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:26,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:44:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:26,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:44:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:26,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:26,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:44:26,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {1129#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);~S~0.base, ~S~0.offset := 0bv32, 0bv32;~pc1~0 := 1bv32;~pc4~0 := 1bv32;~t1~0.base, ~t1~0.offset := 0bv32, 0bv32;~x1~0.base, ~x1~0.offset := 0bv32, 0bv32;~garbage~0.base, ~garbage~0.offset := 0bv32, 0bv32;~t4~0.base, ~t4~0.offset := 0bv32, 0bv32;~x4~0.base, ~x4~0.offset := 0bv32, 0bv32;~res4~0 := 0bv32; {1129#true} is VALID [2022-02-20 23:44:26,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {1129#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet10#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {1129#true} is VALID [2022-02-20 23:44:26,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {1129#true} assume !!(((~S~0.base != 0bv32 || ~S~0.offset != 0bv32) || 1bv32 != ~pc4~0) || 0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {1129#true} is VALID [2022-02-20 23:44:26,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {1129#true} assume 0bv32 != main_#t~nondet11#1;havoc main_#t~nondet11#1;assume { :begin_inline_push } true;havoc push_#t~post3#1, push_#t~switch4#1, push_#t~malloc5#1.base, push_#t~malloc5#1.offset;push_#t~post3#1 := ~pc1~0;~pc1~0 := ~bvadd32(1bv32, push_#t~post3#1);push_#t~switch4#1 := 1bv32 == push_#t~post3#1; {1129#true} is VALID [2022-02-20 23:44:26,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {1129#true} assume push_#t~switch4#1;call push_#t~malloc5#1.base, push_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8bv32);~x1~0.base, ~x1~0.offset := push_#t~malloc5#1.base, push_#t~malloc5#1.offset;havoc push_#t~malloc5#1.base, push_#t~malloc5#1.offset; {1146#(= (select |#valid| ~x1~0.base) (_ bv1 1))} is VALID [2022-02-20 23:44:26,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {1146#(= (select |#valid| ~x1~0.base) (_ bv1 1))} assume !(1bv1 == #valid[~x1~0.base]); {1130#false} is VALID [2022-02-20 23:44:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:26,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:26,294 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:26,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713560680] [2022-02-20 23:44:26,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713560680] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:26,294 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:26,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:26,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716468193] [2022-02-20 23:44:26,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:26,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:44:26,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:26,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:26,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:26,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:26,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:26,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:26,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:26,303 INFO L87 Difference]: Start difference. First operand 140 states and 229 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:26,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:26,588 INFO L93 Difference]: Finished difference Result 211 states and 330 transitions. [2022-02-20 23:44:26,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:26,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:44:26,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2022-02-20 23:44:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2022-02-20 23:44:26,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2022-02-20 23:44:26,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:26,710 INFO L225 Difference]: With dead ends: 211 [2022-02-20 23:44:26,710 INFO L226 Difference]: Without dead ends: 211 [2022-02-20 23:44:26,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:26,711 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 64 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:26,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 163 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-02-20 23:44:26,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 190. [2022-02-20 23:44:26,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:26,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand has 190 states, 172 states have (on average 1.8372093023255813) internal successors, (316), 189 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:26,718 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand has 190 states, 172 states have (on average 1.8372093023255813) internal successors, (316), 189 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:26,718 INFO L87 Difference]: Start difference. First operand 211 states. Second operand has 190 states, 172 states have (on average 1.8372093023255813) internal successors, (316), 189 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:26,724 INFO L93 Difference]: Finished difference Result 211 states and 330 transitions. [2022-02-20 23:44:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 330 transitions. [2022-02-20 23:44:26,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:26,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:26,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 172 states have (on average 1.8372093023255813) internal successors, (316), 189 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 211 states. [2022-02-20 23:44:26,726 INFO L87 Difference]: Start difference. First operand has 190 states, 172 states have (on average 1.8372093023255813) internal successors, (316), 189 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 211 states. [2022-02-20 23:44:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:26,731 INFO L93 Difference]: Finished difference Result 211 states and 330 transitions. [2022-02-20 23:44:26,732 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 330 transitions. [2022-02-20 23:44:26,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:26,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:26,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:26,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 172 states have (on average 1.8372093023255813) internal successors, (316), 189 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 316 transitions. [2022-02-20 23:44:26,743 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 316 transitions. Word has length 6 [2022-02-20 23:44:26,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:26,744 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 316 transitions. [2022-02-20 23:44:26,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 316 transitions. [2022-02-20 23:44:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:44:26,744 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:26,745 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:44:26,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:26,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:26,951 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:26,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:26,952 INFO L85 PathProgramCache]: Analyzing trace with hash 889692425, now seen corresponding path program 1 times [2022-02-20 23:44:26,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:26,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689185186] [2022-02-20 23:44:26,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:26,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:26,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:26,953 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:26,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:44:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:26,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:44:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:27,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:27,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:44:27,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {1972#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);~S~0.base, ~S~0.offset := 0bv32, 0bv32;~pc1~0 := 1bv32;~pc4~0 := 1bv32;~t1~0.base, ~t1~0.offset := 0bv32, 0bv32;~x1~0.base, ~x1~0.offset := 0bv32, 0bv32;~garbage~0.base, ~garbage~0.offset := 0bv32, 0bv32;~t4~0.base, ~t4~0.offset := 0bv32, 0bv32;~x4~0.base, ~x4~0.offset := 0bv32, 0bv32;~res4~0 := 0bv32; {1972#true} is VALID [2022-02-20 23:44:27,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {1972#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet10#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {1972#true} is VALID [2022-02-20 23:44:27,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {1972#true} assume !!(((~S~0.base != 0bv32 || ~S~0.offset != 0bv32) || 1bv32 != ~pc4~0) || 0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {1972#true} is VALID [2022-02-20 23:44:27,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {1972#true} assume 0bv32 != main_#t~nondet11#1;havoc main_#t~nondet11#1;assume { :begin_inline_push } true;havoc push_#t~post3#1, push_#t~switch4#1, push_#t~malloc5#1.base, push_#t~malloc5#1.offset;push_#t~post3#1 := ~pc1~0;~pc1~0 := ~bvadd32(1bv32, push_#t~post3#1);push_#t~switch4#1 := 1bv32 == push_#t~post3#1; {1972#true} is VALID [2022-02-20 23:44:27,037 INFO L290 TraceCheckUtils]: 4: Hoare triple {1972#true} assume push_#t~switch4#1;call push_#t~malloc5#1.base, push_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8bv32);~x1~0.base, ~x1~0.offset := push_#t~malloc5#1.base, push_#t~malloc5#1.offset;havoc push_#t~malloc5#1.base, push_#t~malloc5#1.offset; {1989#(and (= (select |#length| ~x1~0.base) (_ bv8 32)) (= ~x1~0.offset (_ bv0 32)))} is VALID [2022-02-20 23:44:27,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {1989#(and (= (select |#length| ~x1~0.base) (_ bv8 32)) (= ~x1~0.offset (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~x1~0.offset), #length[~x1~0.base]) && ~bvule32(~x1~0.offset, ~bvadd32(4bv32, ~x1~0.offset))) && ~bvule32(0bv32, ~x1~0.offset)); {1973#false} is VALID [2022-02-20 23:44:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:27,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:27,040 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:27,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689185186] [2022-02-20 23:44:27,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689185186] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:27,040 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:27,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:27,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587291208] [2022-02-20 23:44:27,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:27,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:44:27,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:27,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:27,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:27,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:27,048 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:27,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:27,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:27,049 INFO L87 Difference]: Start difference. First operand 190 states and 316 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:27,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:27,326 INFO L93 Difference]: Finished difference Result 206 states and 321 transitions. [2022-02-20 23:44:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:27,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:44:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2022-02-20 23:44:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:27,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2022-02-20 23:44:27,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 139 transitions. [2022-02-20 23:44:27,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:27,447 INFO L225 Difference]: With dead ends: 206 [2022-02-20 23:44:27,447 INFO L226 Difference]: Without dead ends: 206 [2022-02-20 23:44:27,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:27,447 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 63 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:27,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 169 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:27,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-02-20 23:44:27,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 188. [2022-02-20 23:44:27,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:27,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 188 states, 172 states have (on average 1.7906976744186047) internal successors, (308), 187 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:27,458 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 188 states, 172 states have (on average 1.7906976744186047) internal successors, (308), 187 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:27,458 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 188 states, 172 states have (on average 1.7906976744186047) internal successors, (308), 187 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:27,462 INFO L93 Difference]: Finished difference Result 206 states and 321 transitions. [2022-02-20 23:44:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 321 transitions. [2022-02-20 23:44:27,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:27,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:27,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 172 states have (on average 1.7906976744186047) internal successors, (308), 187 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 206 states. [2022-02-20 23:44:27,464 INFO L87 Difference]: Start difference. First operand has 188 states, 172 states have (on average 1.7906976744186047) internal successors, (308), 187 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 206 states. [2022-02-20 23:44:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:27,468 INFO L93 Difference]: Finished difference Result 206 states and 321 transitions. [2022-02-20 23:44:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 321 transitions. [2022-02-20 23:44:27,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:27,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:27,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:27,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:27,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 172 states have (on average 1.7906976744186047) internal successors, (308), 187 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 308 transitions. [2022-02-20 23:44:27,473 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 308 transitions. Word has length 6 [2022-02-20 23:44:27,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:27,473 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 308 transitions. [2022-02-20 23:44:27,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 308 transitions. [2022-02-20 23:44:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:44:27,474 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:27,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:27,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:27,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:27,680 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:27,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:27,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1810669365, now seen corresponding path program 1 times [2022-02-20 23:44:27,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:27,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563769926] [2022-02-20 23:44:27,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:27,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:27,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:27,682 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:27,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:44:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:27,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:44:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:27,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:27,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {2798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);~S~0.base, ~S~0.offset := 0bv32, 0bv32;~pc1~0 := 1bv32;~pc4~0 := 1bv32;~t1~0.base, ~t1~0.offset := 0bv32, 0bv32;~x1~0.base, ~x1~0.offset := 0bv32, 0bv32;~garbage~0.base, ~garbage~0.offset := 0bv32, 0bv32;~t4~0.base, ~t4~0.offset := 0bv32, 0bv32;~x4~0.base, ~x4~0.offset := 0bv32, 0bv32;~res4~0 := 0bv32; {2803#(= (_ bv1 32) ~pc1~0)} is VALID [2022-02-20 23:44:27,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {2803#(= (_ bv1 32) ~pc1~0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet10#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {2803#(= (_ bv1 32) ~pc1~0)} is VALID [2022-02-20 23:44:27,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {2803#(= (_ bv1 32) ~pc1~0)} assume !!(((~S~0.base != 0bv32 || ~S~0.offset != 0bv32) || 1bv32 != ~pc4~0) || 0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2803#(= (_ bv1 32) ~pc1~0)} is VALID [2022-02-20 23:44:27,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {2803#(= (_ bv1 32) ~pc1~0)} assume 0bv32 != main_#t~nondet11#1;havoc main_#t~nondet11#1;assume { :begin_inline_push } true;havoc push_#t~post3#1, push_#t~switch4#1, push_#t~malloc5#1.base, push_#t~malloc5#1.offset;push_#t~post3#1 := ~pc1~0;~pc1~0 := ~bvadd32(1bv32, push_#t~post3#1);push_#t~switch4#1 := 1bv32 == push_#t~post3#1; {2813#|ULTIMATE.start_push_#t~switch4#1|} is VALID [2022-02-20 23:44:27,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {2813#|ULTIMATE.start_push_#t~switch4#1|} assume !push_#t~switch4#1;push_#t~switch4#1 := push_#t~switch4#1 || 2bv32 == push_#t~post3#1; {2799#false} is VALID [2022-02-20 23:44:27,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {2799#false} assume push_#t~switch4#1; {2799#false} is VALID [2022-02-20 23:44:27,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {2799#false} assume !(1bv1 == #valid[~x1~0.base]); {2799#false} is VALID [2022-02-20 23:44:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:27,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:27,754 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:27,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563769926] [2022-02-20 23:44:27,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563769926] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:27,754 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:27,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:44:27,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85105526] [2022-02-20 23:44:27,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:27,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:44:27,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:27,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:27,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:27,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:44:27,760 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:27,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:44:27,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:27,761 INFO L87 Difference]: Start difference. First operand 188 states and 308 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:28,031 INFO L93 Difference]: Finished difference Result 240 states and 333 transitions. [2022-02-20 23:44:28,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:44:28,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:44:28,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 210 transitions. [2022-02-20 23:44:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 210 transitions. [2022-02-20 23:44:28,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 210 transitions. [2022-02-20 23:44:28,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:28,204 INFO L225 Difference]: With dead ends: 240 [2022-02-20 23:44:28,204 INFO L226 Difference]: Without dead ends: 240 [2022-02-20 23:44:28,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:28,205 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 101 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:28,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 268 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:28,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-02-20 23:44:28,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 144. [2022-02-20 23:44:28,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:28,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 144 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 143 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,209 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 144 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 143 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,210 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 144 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 143 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:28,214 INFO L93 Difference]: Finished difference Result 240 states and 333 transitions. [2022-02-20 23:44:28,214 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2022-02-20 23:44:28,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:28,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:28,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 143 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 240 states. [2022-02-20 23:44:28,215 INFO L87 Difference]: Start difference. First operand has 144 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 143 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 240 states. [2022-02-20 23:44:28,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:28,219 INFO L93 Difference]: Finished difference Result 240 states and 333 transitions. [2022-02-20 23:44:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2022-02-20 23:44:28,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:28,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:28,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:28,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 143 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 229 transitions. [2022-02-20 23:44:28,223 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 229 transitions. Word has length 7 [2022-02-20 23:44:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:28,223 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 229 transitions. [2022-02-20 23:44:28,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 229 transitions. [2022-02-20 23:44:28,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:28,224 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:28,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:28,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:28,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:28,430 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:28,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:28,430 INFO L85 PathProgramCache]: Analyzing trace with hash 347531241, now seen corresponding path program 1 times [2022-02-20 23:44:28,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:28,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699840736] [2022-02-20 23:44:28,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:28,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:28,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:28,432 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:28,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:44:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:28,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:44:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:28,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:28,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {3688#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);~S~0.base, ~S~0.offset := 0bv32, 0bv32;~pc1~0 := 1bv32;~pc4~0 := 1bv32;~t1~0.base, ~t1~0.offset := 0bv32, 0bv32;~x1~0.base, ~x1~0.offset := 0bv32, 0bv32;~garbage~0.base, ~garbage~0.offset := 0bv32, 0bv32;~t4~0.base, ~t4~0.offset := 0bv32, 0bv32;~x4~0.base, ~x4~0.offset := 0bv32, 0bv32;~res4~0 := 0bv32; {3693#(= (_ bv1 32) ~pc4~0)} is VALID [2022-02-20 23:44:28,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {3693#(= (_ bv1 32) ~pc4~0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet10#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {3693#(= (_ bv1 32) ~pc4~0)} is VALID [2022-02-20 23:44:28,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {3693#(= (_ bv1 32) ~pc4~0)} assume !!(((~S~0.base != 0bv32 || ~S~0.offset != 0bv32) || 1bv32 != ~pc4~0) || 0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {3693#(= (_ bv1 32) ~pc4~0)} is VALID [2022-02-20 23:44:28,513 INFO L290 TraceCheckUtils]: 3: Hoare triple {3693#(= (_ bv1 32) ~pc4~0)} assume !(0bv32 != main_#t~nondet11#1);havoc main_#t~nondet11#1;assume { :begin_inline_pop } true;havoc pop_#t~post6#1, pop_#t~switch7#1, pop_#t~mem8#1.base, pop_#t~mem8#1.offset, pop_#t~mem9#1;pop_#t~post6#1 := ~pc4~0;~pc4~0 := ~bvadd32(1bv32, pop_#t~post6#1);pop_#t~switch7#1 := 1bv32 == pop_#t~post6#1; {3703#|ULTIMATE.start_pop_#t~switch7#1|} is VALID [2022-02-20 23:44:28,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {3703#|ULTIMATE.start_pop_#t~switch7#1|} assume !pop_#t~switch7#1;pop_#t~switch7#1 := pop_#t~switch7#1 || 2bv32 == pop_#t~post6#1; {3689#false} is VALID [2022-02-20 23:44:28,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {3689#false} assume !pop_#t~switch7#1;pop_#t~switch7#1 := pop_#t~switch7#1 || 3bv32 == pop_#t~post6#1; {3689#false} is VALID [2022-02-20 23:44:28,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {3689#false} assume pop_#t~switch7#1; {3689#false} is VALID [2022-02-20 23:44:28,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {3689#false} assume !(1bv1 == #valid[~t4~0.base]); {3689#false} is VALID [2022-02-20 23:44:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:28,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:28,514 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:28,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699840736] [2022-02-20 23:44:28,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699840736] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:28,515 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:28,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:44:28,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216256756] [2022-02-20 23:44:28,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:28,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:28,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:28,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:28,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:44:28,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:28,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:44:28,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:28,524 INFO L87 Difference]: Start difference. First operand 144 states and 229 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:28,803 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2022-02-20 23:44:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:44:28,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:28,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2022-02-20 23:44:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2022-02-20 23:44:28,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 158 transitions. [2022-02-20 23:44:28,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:28,945 INFO L225 Difference]: With dead ends: 283 [2022-02-20 23:44:28,945 INFO L226 Difference]: Without dead ends: 283 [2022-02-20 23:44:28,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:28,946 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:28,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 196 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-02-20 23:44:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 198. [2022-02-20 23:44:28,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:28,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 198 states, 186 states have (on average 1.6559139784946237) internal successors, (308), 197 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,950 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 198 states, 186 states have (on average 1.6559139784946237) internal successors, (308), 197 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,950 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 198 states, 186 states have (on average 1.6559139784946237) internal successors, (308), 197 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:28,954 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2022-02-20 23:44:28,955 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 430 transitions. [2022-02-20 23:44:28,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:28,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:28,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 186 states have (on average 1.6559139784946237) internal successors, (308), 197 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 283 states. [2022-02-20 23:44:28,956 INFO L87 Difference]: Start difference. First operand has 198 states, 186 states have (on average 1.6559139784946237) internal successors, (308), 197 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 283 states. [2022-02-20 23:44:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:28,960 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2022-02-20 23:44:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 430 transitions. [2022-02-20 23:44:28,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:28,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:28,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:28,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 186 states have (on average 1.6559139784946237) internal successors, (308), 197 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 308 transitions. [2022-02-20 23:44:28,963 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 308 transitions. Word has length 8 [2022-02-20 23:44:28,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:28,964 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 308 transitions. [2022-02-20 23:44:28,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:28,964 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 308 transitions. [2022-02-20 23:44:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:44:28,964 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:28,964 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:28,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:29,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:29,170 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:29,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:29,171 INFO L85 PathProgramCache]: Analyzing trace with hash -527615340, now seen corresponding path program 1 times [2022-02-20 23:44:29,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:29,171 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857644527] [2022-02-20 23:44:29,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:29,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:29,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:29,172 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:29,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:44:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:29,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:44:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:29,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:29,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {4764#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);~S~0.base, ~S~0.offset := 0bv32, 0bv32;~pc1~0 := 1bv32;~pc4~0 := 1bv32;~t1~0.base, ~t1~0.offset := 0bv32, 0bv32;~x1~0.base, ~x1~0.offset := 0bv32, 0bv32;~garbage~0.base, ~garbage~0.offset := 0bv32, 0bv32;~t4~0.base, ~t4~0.offset := 0bv32, 0bv32;~x4~0.base, ~x4~0.offset := 0bv32, 0bv32;~res4~0 := 0bv32; {4769#(= (_ bv1 32) ~pc4~0)} is VALID [2022-02-20 23:44:29,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {4769#(= (_ bv1 32) ~pc4~0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet10#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {4769#(= (_ bv1 32) ~pc4~0)} is VALID [2022-02-20 23:44:29,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {4769#(= (_ bv1 32) ~pc4~0)} assume !!(((~S~0.base != 0bv32 || ~S~0.offset != 0bv32) || 1bv32 != ~pc4~0) || 0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {4769#(= (_ bv1 32) ~pc4~0)} is VALID [2022-02-20 23:44:29,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {4769#(= (_ bv1 32) ~pc4~0)} assume !(0bv32 != main_#t~nondet11#1);havoc main_#t~nondet11#1;assume { :begin_inline_pop } true;havoc pop_#t~post6#1, pop_#t~switch7#1, pop_#t~mem8#1.base, pop_#t~mem8#1.offset, pop_#t~mem9#1;pop_#t~post6#1 := ~pc4~0;~pc4~0 := ~bvadd32(1bv32, pop_#t~post6#1);pop_#t~switch7#1 := 1bv32 == pop_#t~post6#1; {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} is VALID [2022-02-20 23:44:29,283 INFO L290 TraceCheckUtils]: 4: Hoare triple {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} assume pop_#t~switch7#1;~t4~0.base, ~t4~0.offset := ~S~0.base, ~S~0.offset; {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} is VALID [2022-02-20 23:44:29,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} assume { :end_inline_pop } true; {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} is VALID [2022-02-20 23:44:29,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} assume !!(((~S~0.base != 0bv32 || ~S~0.offset != 0bv32) || 1bv32 != ~pc4~0) || 0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} is VALID [2022-02-20 23:44:29,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} assume !(0bv32 != main_#t~nondet11#1);havoc main_#t~nondet11#1;assume { :begin_inline_pop } true;havoc pop_#t~post6#1, pop_#t~switch7#1, pop_#t~mem8#1.base, pop_#t~mem8#1.offset, pop_#t~mem9#1;pop_#t~post6#1 := ~pc4~0;~pc4~0 := ~bvadd32(1bv32, pop_#t~post6#1);pop_#t~switch7#1 := 1bv32 == pop_#t~post6#1; {4792#(= (_ bv2 32) |ULTIMATE.start_pop_#t~post6#1|)} is VALID [2022-02-20 23:44:29,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {4792#(= (_ bv2 32) |ULTIMATE.start_pop_#t~post6#1|)} assume !pop_#t~switch7#1;pop_#t~switch7#1 := pop_#t~switch7#1 || 2bv32 == pop_#t~post6#1; {4796#|ULTIMATE.start_pop_#t~switch7#1|} is VALID [2022-02-20 23:44:29,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {4796#|ULTIMATE.start_pop_#t~switch7#1|} assume !pop_#t~switch7#1;pop_#t~switch7#1 := pop_#t~switch7#1 || 3bv32 == pop_#t~post6#1; {4765#false} is VALID [2022-02-20 23:44:29,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {4765#false} assume pop_#t~switch7#1; {4765#false} is VALID [2022-02-20 23:44:29,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {4765#false} assume !(1bv1 == #valid[~t4~0.base]); {4765#false} is VALID [2022-02-20 23:44:29,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:29,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:44:29,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {4765#false} assume !(1bv1 == #valid[~t4~0.base]); {4765#false} is VALID [2022-02-20 23:44:29,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {4765#false} assume pop_#t~switch7#1; {4765#false} is VALID [2022-02-20 23:44:29,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {4796#|ULTIMATE.start_pop_#t~switch7#1|} assume !pop_#t~switch7#1;pop_#t~switch7#1 := pop_#t~switch7#1 || 3bv32 == pop_#t~post6#1; {4765#false} is VALID [2022-02-20 23:44:29,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {4792#(= (_ bv2 32) |ULTIMATE.start_pop_#t~post6#1|)} assume !pop_#t~switch7#1;pop_#t~switch7#1 := pop_#t~switch7#1 || 2bv32 == pop_#t~post6#1; {4796#|ULTIMATE.start_pop_#t~switch7#1|} is VALID [2022-02-20 23:44:29,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} assume !(0bv32 != main_#t~nondet11#1);havoc main_#t~nondet11#1;assume { :begin_inline_pop } true;havoc pop_#t~post6#1, pop_#t~switch7#1, pop_#t~mem8#1.base, pop_#t~mem8#1.offset, pop_#t~mem9#1;pop_#t~post6#1 := ~pc4~0;~pc4~0 := ~bvadd32(1bv32, pop_#t~post6#1);pop_#t~switch7#1 := 1bv32 == pop_#t~post6#1; {4792#(= (_ bv2 32) |ULTIMATE.start_pop_#t~post6#1|)} is VALID [2022-02-20 23:44:29,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} assume !!(((~S~0.base != 0bv32 || ~S~0.offset != 0bv32) || 1bv32 != ~pc4~0) || 0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} is VALID [2022-02-20 23:44:29,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} assume { :end_inline_pop } true; {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} is VALID [2022-02-20 23:44:29,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} assume pop_#t~switch7#1;~t4~0.base, ~t4~0.offset := ~S~0.base, ~S~0.offset; {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} is VALID [2022-02-20 23:44:29,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {4769#(= (_ bv1 32) ~pc4~0)} assume !(0bv32 != main_#t~nondet11#1);havoc main_#t~nondet11#1;assume { :begin_inline_pop } true;havoc pop_#t~post6#1, pop_#t~switch7#1, pop_#t~mem8#1.base, pop_#t~mem8#1.offset, pop_#t~mem9#1;pop_#t~post6#1 := ~pc4~0;~pc4~0 := ~bvadd32(1bv32, pop_#t~post6#1);pop_#t~switch7#1 := 1bv32 == pop_#t~post6#1; {4779#(= (bvadd (_ bv4294967295 32) ~pc4~0) (_ bv1 32))} is VALID [2022-02-20 23:44:29,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {4769#(= (_ bv1 32) ~pc4~0)} assume !!(((~S~0.base != 0bv32 || ~S~0.offset != 0bv32) || 1bv32 != ~pc4~0) || 0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {4769#(= (_ bv1 32) ~pc4~0)} is VALID [2022-02-20 23:44:29,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {4769#(= (_ bv1 32) ~pc4~0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet10#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~next~0#1.base, main_~next~0#1.offset; {4769#(= (_ bv1 32) ~pc4~0)} is VALID [2022-02-20 23:44:29,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {4764#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);~S~0.base, ~S~0.offset := 0bv32, 0bv32;~pc1~0 := 1bv32;~pc4~0 := 1bv32;~t1~0.base, ~t1~0.offset := 0bv32, 0bv32;~x1~0.base, ~x1~0.offset := 0bv32, 0bv32;~garbage~0.base, ~garbage~0.offset := 0bv32, 0bv32;~t4~0.base, ~t4~0.offset := 0bv32, 0bv32;~x4~0.base, ~x4~0.offset := 0bv32, 0bv32;~res4~0 := 0bv32; {4769#(= (_ bv1 32) ~pc4~0)} is VALID [2022-02-20 23:44:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:29,367 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:29,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857644527] [2022-02-20 23:44:29,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857644527] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:44:29,367 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:44:29,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-02-20 23:44:29,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164267384] [2022-02-20 23:44:29,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:44:29,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:44:29,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:29,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:29,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:29,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:44:29,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:29,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:44:29,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:44:29,378 INFO L87 Difference]: Start difference. First operand 198 states and 308 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:29,983 INFO L93 Difference]: Finished difference Result 461 states and 690 transitions. [2022-02-20 23:44:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:44:29,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:44:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 252 transitions. [2022-02-20 23:44:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 252 transitions. [2022-02-20 23:44:29,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 252 transitions. [2022-02-20 23:44:30,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:30,193 INFO L225 Difference]: With dead ends: 461 [2022-02-20 23:44:30,193 INFO L226 Difference]: Without dead ends: 461 [2022-02-20 23:44:30,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:44:30,193 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 221 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:30,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 471 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:30,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-02-20 23:44:30,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 258. [2022-02-20 23:44:30,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:30,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 461 states. Second operand has 258 states, 246 states have (on average 1.6016260162601625) internal successors, (394), 257 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,198 INFO L74 IsIncluded]: Start isIncluded. First operand 461 states. Second operand has 258 states, 246 states have (on average 1.6016260162601625) internal successors, (394), 257 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,198 INFO L87 Difference]: Start difference. First operand 461 states. Second operand has 258 states, 246 states have (on average 1.6016260162601625) internal successors, (394), 257 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:30,206 INFO L93 Difference]: Finished difference Result 461 states and 690 transitions. [2022-02-20 23:44:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 690 transitions. [2022-02-20 23:44:30,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:30,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:30,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 246 states have (on average 1.6016260162601625) internal successors, (394), 257 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 461 states. [2022-02-20 23:44:30,208 INFO L87 Difference]: Start difference. First operand has 258 states, 246 states have (on average 1.6016260162601625) internal successors, (394), 257 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 461 states. [2022-02-20 23:44:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:30,216 INFO L93 Difference]: Finished difference Result 461 states and 690 transitions. [2022-02-20 23:44:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 690 transitions. [2022-02-20 23:44:30,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:30,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:30,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:30,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 246 states have (on average 1.6016260162601625) internal successors, (394), 257 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 394 transitions. [2022-02-20 23:44:30,221 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 394 transitions. Word has length 12 [2022-02-20 23:44:30,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:30,221 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 394 transitions. [2022-02-20 23:44:30,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,221 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 394 transitions. [2022-02-20 23:44:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:44:30,221 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:30,222 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:30,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:30,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:30,428 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2022-02-20 23:44:30,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:30,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2027186576, now seen corresponding path program 1 times [2022-02-20 23:44:30,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:30,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352891411] [2022-02-20 23:44:30,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:30,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:30,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:30,430 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:30,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:44:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:44:30,487 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:44:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:44:30,533 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 23:44:30,534 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:44:30,534 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2022-02-20 23:44:30,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (18 of 20 remaining) [2022-02-20 23:44:30,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (17 of 20 remaining) [2022-02-20 23:44:30,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (16 of 20 remaining) [2022-02-20 23:44:30,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (15 of 20 remaining) [2022-02-20 23:44:30,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (14 of 20 remaining) [2022-02-20 23:44:30,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (13 of 20 remaining) [2022-02-20 23:44:30,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (12 of 20 remaining) [2022-02-20 23:44:30,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (11 of 20 remaining) [2022-02-20 23:44:30,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (10 of 20 remaining) [2022-02-20 23:44:30,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (9 of 20 remaining) [2022-02-20 23:44:30,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (8 of 20 remaining) [2022-02-20 23:44:30,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (7 of 20 remaining) [2022-02-20 23:44:30,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (6 of 20 remaining) [2022-02-20 23:44:30,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (5 of 20 remaining) [2022-02-20 23:44:30,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (4 of 20 remaining) [2022-02-20 23:44:30,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (3 of 20 remaining) [2022-02-20 23:44:30,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2022-02-20 23:44:30,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2022-02-20 23:44:30,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2022-02-20 23:44:30,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:30,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:30,741 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:30,742 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:44:30,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:44:30 BoogieIcfgContainer [2022-02-20 23:44:30,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:44:30,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:44:30,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:44:30,762 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:44:30,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:24" (3/4) ... [2022-02-20 23:44:30,764 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 23:44:30,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:44:30,765 INFO L158 Benchmark]: Toolchain (without parser) took 7296.21ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 33.7MB in the beginning and 55.5MB in the end (delta: -21.8MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-02-20 23:44:30,765 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 38.4MB in the beginning and 38.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:30,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.56ms. Allocated memory is still 56.6MB. Free memory was 33.6MB in the beginning and 30.5MB in the end (delta: 3.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 23:44:30,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.36ms. Allocated memory is still 56.6MB. Free memory was 30.3MB in the beginning and 28.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:30,766 INFO L158 Benchmark]: Boogie Preprocessor took 36.86ms. Allocated memory is still 56.6MB. Free memory was 28.0MB in the beginning and 25.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:30,766 INFO L158 Benchmark]: RCFGBuilder took 451.48ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 25.7MB in the beginning and 36.1MB in the end (delta: -10.3MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-02-20 23:44:30,766 INFO L158 Benchmark]: TraceAbstraction took 6303.85ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 35.5MB in the beginning and 55.5MB in the end (delta: -20.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:30,766 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 83.9MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:30,767 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 38.4MB in the beginning and 38.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.56ms. Allocated memory is still 56.6MB. Free memory was 33.6MB in the beginning and 30.5MB in the end (delta: 3.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.36ms. Allocated memory is still 56.6MB. Free memory was 30.3MB in the beginning and 28.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.86ms. Allocated memory is still 56.6MB. Free memory was 28.0MB in the beginning and 25.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 451.48ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 25.7MB in the beginning and 36.1MB in the end (delta: -10.3MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6303.85ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 35.5MB in the beginning and 55.5MB in the end (delta: -20.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 83.9MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND FALSE !(S || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 677 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 677 mSDsluCounter, 1517 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 735 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 217 IncrementalHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 782 mSDtfsCounter, 217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=7, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 461 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 152 SizeOfPredicates, 5 NumberOfNonLiveVariables, 297 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 23:44:30,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample