./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:52:29,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:52:29,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:52:29,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:52:29,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:52:29,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:52:29,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:52:29,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:52:29,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:52:29,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:52:29,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:52:29,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:52:29,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:52:29,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:52:29,711 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:52:29,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:52:29,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:52:29,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:52:29,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:52:29,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:52:29,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:52:29,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:52:29,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:52:29,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:52:29,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:52:29,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:52:29,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:52:29,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:52:29,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:52:29,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:52:29,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:52:29,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:52:29,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:52:29,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:52:29,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:52:29,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:52:29,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:52:29,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:52:29,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:52:29,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:52:29,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:52:29,728 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:52:29,741 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:52:29,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:52:29,742 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:52:29,742 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:52:29,742 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:52:29,743 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:52:29,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:52:29,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:52:29,743 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:52:29,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:52:29,744 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:52:29,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:52:29,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:52:29,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:52:29,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:52:29,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:52:29,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:52:29,745 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:52:29,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:52:29,745 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:52:29,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:52:29,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:52:29,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:52:29,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:52:29,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:52:29,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:52:29,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:52:29,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:52:29,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:52:29,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:52:29,747 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:52:29,748 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:52:29,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:52:29,748 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2022-02-20 16:52:29,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:52:29,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:52:29,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:52:29,926 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:52:29,927 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:52:29,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2022-02-20 16:52:29,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8206146e2/24621d53faf442799f770033581f2774/FLAGd6319c304 [2022-02-20 16:52:30,423 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:52:30,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2022-02-20 16:52:30,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8206146e2/24621d53faf442799f770033581f2774/FLAGd6319c304 [2022-02-20 16:52:30,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8206146e2/24621d53faf442799f770033581f2774 [2022-02-20 16:52:30,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:52:30,772 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:52:30,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:52:30,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:52:30,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:52:30,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:52:30" (1/1) ... [2022-02-20 16:52:30,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5098ddfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:30, skipping insertion in model container [2022-02-20 16:52:30,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:52:30" (1/1) ... [2022-02-20 16:52:30,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:52:30,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:52:31,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2022-02-20 16:52:31,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2022-02-20 16:52:31,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2022-02-20 16:52:31,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:52:31,111 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:52:31,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2022-02-20 16:52:31,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2022-02-20 16:52:31,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2022-02-20 16:52:31,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:52:31,178 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:52:31,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:31 WrapperNode [2022-02-20 16:52:31,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:52:31,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:52:31,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:52:31,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:52:31,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:31" (1/1) ... [2022-02-20 16:52:31,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:31" (1/1) ... [2022-02-20 16:52:31,235 INFO L137 Inliner]: procedures = 119, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2022-02-20 16:52:31,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:52:31,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:52:31,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:52:31,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:52:31,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:31" (1/1) ... [2022-02-20 16:52:31,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:31" (1/1) ... [2022-02-20 16:52:31,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:31" (1/1) ... [2022-02-20 16:52:31,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:31" (1/1) ... [2022-02-20 16:52:31,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:31" (1/1) ... [2022-02-20 16:52:31,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:31" (1/1) ... [2022-02-20 16:52:31,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:31" (1/1) ... [2022-02-20 16:52:31,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:52:31,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:52:31,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:52:31,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:52:31,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:31" (1/1) ... [2022-02-20 16:52:31,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:52:31,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:52:31,313 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 16:52:31,334 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 16:52:31,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:52:31,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:52:31,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:52:31,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:52:31,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:52:31,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:52:31,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:52:31,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:52:31,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:52:31,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:52:31,408 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:52:31,409 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:52:31,837 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:52:31,843 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:52:31,844 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 16:52:31,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:52:31 BoogieIcfgContainer [2022-02-20 16:52:31,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:52:31,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:52:31,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:52:31,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:52:31,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:52:30" (1/3) ... [2022-02-20 16:52:31,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1ba69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:52:31, skipping insertion in model container [2022-02-20 16:52:31,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:31" (2/3) ... [2022-02-20 16:52:31,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1ba69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:52:31, skipping insertion in model container [2022-02-20 16:52:31,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:52:31" (3/3) ... [2022-02-20 16:52:31,853 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2022-02-20 16:52:31,862 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:52:31,862 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-02-20 16:52:31,913 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:52:31,918 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 16:52:31,918 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 16:52:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.84) internal successors, (46), 28 states have internal predecessors, (46), 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 16:52:31,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:52:31,933 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:52:31,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:52:31,934 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:52:31,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:52:31,938 INFO L85 PathProgramCache]: Analyzing trace with hash 889968582, now seen corresponding path program 1 times [2022-02-20 16:52:31,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:52:31,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638721592] [2022-02-20 16:52:31,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:52:31,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:52:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:32,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#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(19, 2); {32#true} is VALID [2022-02-20 16:52:32,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet2#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {32#true} is VALID [2022-02-20 16:52:32,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume !true; {33#false} is VALID [2022-02-20 16:52:32,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#false} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {33#false} is VALID [2022-02-20 16:52:32,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#false} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {33#false} is VALID [2022-02-20 16:52:32,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-02-20 16:52:32,070 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 16:52:32,070 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:52:32,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638721592] [2022-02-20 16:52:32,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638721592] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:52:32,071 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:52:32,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:52:32,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045983243] [2022-02-20 16:52:32,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:52:32,076 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:52:32,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:52:32,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:52:32,087 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 16:52:32,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:52:32,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:52:32,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:52:32,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:52:32,105 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.84) internal successors, (46), 28 states have internal predecessors, (46), 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 3.0) internal successors, (6), 2 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 16:52:32,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:32,156 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2022-02-20 16:52:32,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:52:32,157 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:52:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:52:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:52:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2022-02-20 16:52:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:52:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2022-02-20 16:52:32,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 84 transitions. [2022-02-20 16:52:32,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:32,229 INFO L225 Difference]: With dead ends: 53 [2022-02-20 16:52:32,229 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:52:32,231 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 16:52:32,234 INFO L933 BasicCegarLoop]: 34 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, 34 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 16:52:32,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:52:32,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:52:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 16:52:32,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:52:32,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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 16:52:32,253 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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 16:52:32,254 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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 16:52:32,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:32,255 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-20 16:52:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-20 16:52:32,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:32,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:32,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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 23 states. [2022-02-20 16:52:32,257 INFO L87 Difference]: Start difference. First operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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 23 states. [2022-02-20 16:52:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:32,258 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-20 16:52:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-20 16:52:32,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:32,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:32,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:52:32,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:52:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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 16:52:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-02-20 16:52:32,261 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2022-02-20 16:52:32,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:52:32,261 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-02-20 16:52:32,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:52:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-20 16:52:32,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:52:32,262 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:52:32,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:52:32,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:52:32,263 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:52:32,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:52:32,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1806853233, now seen corresponding path program 1 times [2022-02-20 16:52:32,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:52:32,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050563591] [2022-02-20 16:52:32,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:52:32,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:52:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:32,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#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(19, 2); {165#true} is VALID [2022-02-20 16:52:32,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet2#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {167#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 16:52:32,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {167#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {167#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 16:52:32,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {167#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {167#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 16:52:32,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {167#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {168#(not (= |ULTIMATE.start_main_~end~0#1.base| 0))} is VALID [2022-02-20 16:52:32,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {168#(not (= |ULTIMATE.start_main_~end~0#1.base| 0))} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {166#false} is VALID [2022-02-20 16:52:32,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#false} assume !false; {166#false} is VALID [2022-02-20 16:52:32,315 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 16:52:32,315 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:52:32,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050563591] [2022-02-20 16:52:32,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050563591] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:52:32,316 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:52:32,316 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:52:32,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941634564] [2022-02-20 16:52:32,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:52:32,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 16:52:32,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:52:32,325 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), 4 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 16:52:32,331 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 16:52:32,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:52:32,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:52:32,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:52:32,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:52:32,333 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 16:52:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:32,415 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-02-20 16:52:32,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:52:32,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 16:52:32,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:52:32,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 16:52:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-02-20 16:52:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 16:52:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-02-20 16:52:32,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2022-02-20 16:52:32,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:32,449 INFO L225 Difference]: With dead ends: 31 [2022-02-20 16:52:32,449 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:52:32,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:52:32,450 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:52:32,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:52:32,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:52:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2022-02-20 16:52:32,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:52:32,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 21 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 16:52:32,454 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 21 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 16:52:32,454 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 21 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 16:52:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:32,455 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 16:52:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:52:32,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:32,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:32,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 29 states. [2022-02-20 16:52:32,456 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 29 states. [2022-02-20 16:52:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:32,458 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 16:52:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:52:32,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:32,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:32,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:52:32,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:52:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 16:52:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-02-20 16:52:32,462 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2022-02-20 16:52:32,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:52:32,462 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-02-20 16:52:32,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 16:52:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 16:52:32,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:52:32,465 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:52:32,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:52:32,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:52:32,466 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:52:32,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:52:32,467 INFO L85 PathProgramCache]: Analyzing trace with hash -856511048, now seen corresponding path program 1 times [2022-02-20 16:52:32,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:52:32,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045850348] [2022-02-20 16:52:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:52:32,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:52:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:32,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#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(19, 2); {287#true} is VALID [2022-02-20 16:52:32,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet2#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {289#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 16:52:32,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {289#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {289#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 16:52:32,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {289#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {289#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 16:52:32,611 INFO L290 TraceCheckUtils]: 4: Hoare triple {289#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {290#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:52:32,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {290#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {290#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:52:32,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {290#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {290#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:52:32,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {290#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} call main_#t~mem8#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); {291#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem8#1|)} is VALID [2022-02-20 16:52:32,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {291#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem8#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem8#1);havoc main_#t~mem8#1; {288#false} is VALID [2022-02-20 16:52:32,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-02-20 16:52:32,614 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 16:52:32,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:52:32,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045850348] [2022-02-20 16:52:32,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045850348] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:52:32,616 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:52:32,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:52:32,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844845099] [2022-02-20 16:52:32,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:52:32,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 16:52:32,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:52:32,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 16:52:32,625 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 16:52:32,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:52:32,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:52:32,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:52:32,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:52:32,627 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 16:52:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:32,793 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-02-20 16:52:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:52:32,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 16:52:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:52:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 16:52:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 16:52:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 16:52:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 16:52:32,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-02-20 16:52:32,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:32,838 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:52:32,838 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 16:52:32,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:52:32,839 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:52:32,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 67 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:52:32,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 16:52:32,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2022-02-20 16:52:32,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:52:32,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 28 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 16:52:32,843 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 28 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 16:52:32,843 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 28 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 16:52:32,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:32,845 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-02-20 16:52:32,845 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-02-20 16:52:32,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:32,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:32,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 45 states. [2022-02-20 16:52:32,846 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 45 states. [2022-02-20 16:52:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:32,847 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-02-20 16:52:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-02-20 16:52:32,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:32,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:32,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:52:32,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:52:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 16:52:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-02-20 16:52:32,849 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2022-02-20 16:52:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:52:32,849 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-02-20 16:52:32,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 16:52:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-02-20 16:52:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:52:32,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:52:32,850 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:52:32,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:52:32,851 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:52:32,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:52:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1594081566, now seen corresponding path program 1 times [2022-02-20 16:52:32,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:52:32,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883353435] [2022-02-20 16:52:32,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:52:32,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:52:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:33,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {471#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(19, 2); {471#true} is VALID [2022-02-20 16:52:33,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet2#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {473#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 4) |ULTIMATE.start_main_~end~0#1.offset|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:52:33,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {473#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 4) |ULTIMATE.start_main_~end~0#1.offset|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {473#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 4) |ULTIMATE.start_main_~end~0#1.offset|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:52:33,053 INFO L290 TraceCheckUtils]: 3: Hoare triple {473#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 4) |ULTIMATE.start_main_~end~0#1.offset|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {474#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:52:33,054 INFO L290 TraceCheckUtils]: 4: Hoare triple {474#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;call write~int(~unnamed1~0~RED, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); {475#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:52:33,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {475#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {475#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:52:33,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {475#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:52:33,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {475#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:52:33,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:52:33,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:52:33,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} call main_#t~mem8#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); {477#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem8#1|)} is VALID [2022-02-20 16:52:33,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {477#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem8#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem8#1);havoc main_#t~mem8#1; {472#false} is VALID [2022-02-20 16:52:33,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-02-20 16:52:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:52:33,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:52:33,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883353435] [2022-02-20 16:52:33,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883353435] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:52:33,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142224468] [2022-02-20 16:52:33,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:52:33,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:52:33,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:52:33,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:52:33,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 16:52:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:33,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 16:52:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:33,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:52:33,216 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 16:52:33,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 16:52:33,368 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 16:52:33,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 16:52:33,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:33,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-02-20 16:52:33,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 16:52:33,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:33,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:33,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-02-20 16:52:33,571 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-20 16:52:33,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 16:52:33,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:52:33,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {471#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(19, 2); {471#true} is VALID [2022-02-20 16:52:33,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet2#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {484#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:52:33,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {484#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:52:33,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {484#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {491#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:52:33,675 INFO L290 TraceCheckUtils]: 4: Hoare triple {491#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;call write~int(~unnamed1~0~RED, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); {475#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:52:33,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {475#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {475#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:52:33,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {475#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:52:33,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {475#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {504#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 16:52:33,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {504#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {504#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 16:52:33,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {504#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} goto; {504#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 16:52:33,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {504#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} call main_#t~mem8#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); {477#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem8#1|)} is VALID [2022-02-20 16:52:33,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {477#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem8#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem8#1);havoc main_#t~mem8#1; {472#false} is VALID [2022-02-20 16:52:33,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-02-20 16:52:33,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:52:33,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:52:34,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:52:34,181 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-20 16:52:34,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 1 [2022-02-20 16:52:34,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-02-20 16:52:34,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {477#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem8#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem8#1);havoc main_#t~mem8#1; {472#false} is VALID [2022-02-20 16:52:34,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} call main_#t~mem8#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); {477#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem8#1|)} is VALID [2022-02-20 16:52:34,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:52:34,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:52:34,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {535#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:52:34,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {535#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {535#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 16:52:34,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {535#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {535#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 16:52:34,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {545#(forall ((|v_ULTIMATE.start_main_~end~0#1.base_26| Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~end~0#1.base_26|) 0)) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_159) |v_ULTIMATE.start_main_~end~0#1.base_26| v_ArrVal_158) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)))} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;call write~int(~unnamed1~0~RED, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); {535#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 16:52:34,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {549#(forall ((|v_ULTIMATE.start_main_~end~0#1.base_26| Int) (v_ArrVal_156 Int) (|v_ULTIMATE.start_main_~end~0#1.base_27| Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (or (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_156)) |v_ULTIMATE.start_main_~end~0#1.base_27| v_ArrVal_159) |v_ULTIMATE.start_main_~end~0#1.base_26| v_ArrVal_158) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~end~0#1.base_27| 1) |v_ULTIMATE.start_main_~end~0#1.base_26|) 0)) (not (= (select |#valid| |v_ULTIMATE.start_main_~end~0#1.base_27|) 0))))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {545#(forall ((|v_ULTIMATE.start_main_~end~0#1.base_26| Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~end~0#1.base_26|) 0)) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_159) |v_ULTIMATE.start_main_~end~0#1.base_26| v_ArrVal_158) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)))} is VALID [2022-02-20 16:52:34,196 WARN L290 TraceCheckUtils]: 2: Hoare triple {549#(forall ((|v_ULTIMATE.start_main_~end~0#1.base_26| Int) (v_ArrVal_156 Int) (|v_ULTIMATE.start_main_~end~0#1.base_27| Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (or (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_156)) |v_ULTIMATE.start_main_~end~0#1.base_27| v_ArrVal_159) |v_ULTIMATE.start_main_~end~0#1.base_26| v_ArrVal_158) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~end~0#1.base_27| 1) |v_ULTIMATE.start_main_~end~0#1.base_26|) 0)) (not (= (select |#valid| |v_ULTIMATE.start_main_~end~0#1.base_27|) 0))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {549#(forall ((|v_ULTIMATE.start_main_~end~0#1.base_26| Int) (v_ArrVal_156 Int) (|v_ULTIMATE.start_main_~end~0#1.base_27| Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (or (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_156)) |v_ULTIMATE.start_main_~end~0#1.base_27| v_ArrVal_159) |v_ULTIMATE.start_main_~end~0#1.base_26| v_ArrVal_158) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~end~0#1.base_27| 1) |v_ULTIMATE.start_main_~end~0#1.base_26|) 0)) (not (= (select |#valid| |v_ULTIMATE.start_main_~end~0#1.base_27|) 0))))} is UNKNOWN [2022-02-20 16:52:34,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet2#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {549#(forall ((|v_ULTIMATE.start_main_~end~0#1.base_26| Int) (v_ArrVal_156 Int) (|v_ULTIMATE.start_main_~end~0#1.base_27| Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (or (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_156)) |v_ULTIMATE.start_main_~end~0#1.base_27| v_ArrVal_159) |v_ULTIMATE.start_main_~end~0#1.base_26| v_ArrVal_158) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~end~0#1.base_27| 1) |v_ULTIMATE.start_main_~end~0#1.base_26|) 0)) (not (= (select |#valid| |v_ULTIMATE.start_main_~end~0#1.base_27|) 0))))} is VALID [2022-02-20 16:52:34,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {471#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(19, 2); {471#true} is VALID [2022-02-20 16:52:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:52:34,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142224468] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:52:34,198 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:52:34,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 16:52:34,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105268849] [2022-02-20 16:52:34,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:52:34,199 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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 13 [2022-02-20 16:52:34,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:52:34,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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 16:52:34,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:34,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 16:52:34,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:52:34,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 16:52:34,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-02-20 16:52:34,239 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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 16:52:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:34,566 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-02-20 16:52:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:52:34,567 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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 13 [2022-02-20 16:52:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:52:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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 16:52:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-20 16:52:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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 16:52:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-20 16:52:34,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-02-20 16:52:34,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:34,599 INFO L225 Difference]: With dead ends: 39 [2022-02-20 16:52:34,599 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 16:52:34,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-02-20 16:52:34,603 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:52:34,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 89 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 71 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-02-20 16:52:34,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 16:52:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 19. [2022-02-20 16:52:34,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:52:34,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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 16:52:34,610 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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 16:52:34,611 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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 16:52:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:34,614 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 16:52:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 16:52:34,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:34,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:34,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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 37 states. [2022-02-20 16:52:34,616 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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 37 states. [2022-02-20 16:52:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:34,618 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 16:52:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 16:52:34,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:34,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:34,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:52:34,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:52:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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 16:52:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-02-20 16:52:34,619 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2022-02-20 16:52:34,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:52:34,620 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-02-20 16:52:34,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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 16:52:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 16:52:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:52:34,621 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:52:34,621 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:52:34,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:52:34,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:52:34,839 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:52:34,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:52:34,839 INFO L85 PathProgramCache]: Analyzing trace with hash -839217458, now seen corresponding path program 1 times [2022-02-20 16:52:34,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:52:34,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913232889] [2022-02-20 16:52:34,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:52:34,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:52:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:34,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {705#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(19, 2); {705#true} is VALID [2022-02-20 16:52:34,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {705#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet2#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {705#true} is VALID [2022-02-20 16:52:34,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {705#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {705#true} is VALID [2022-02-20 16:52:34,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {705#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {705#true} is VALID [2022-02-20 16:52:34,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {705#true} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {705#true} is VALID [2022-02-20 16:52:34,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {705#true} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {705#true} is VALID [2022-02-20 16:52:34,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {705#true} goto; {705#true} is VALID [2022-02-20 16:52:34,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {705#true} call main_#t~mem8#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); {707#(= |ULTIMATE.start_main_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:52:34,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#(= |ULTIMATE.start_main_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(~unnamed1~0~BLACK == main_#t~mem8#1);havoc main_#t~mem8#1; {708#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:52:34,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {708#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {708#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:52:34,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {708#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);call main_#t~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); {709#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} is VALID [2022-02-20 16:52:34,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {709#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} assume ~unnamed1~0~RED == main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {706#false} is VALID [2022-02-20 16:52:34,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {706#false} call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); {706#false} is VALID [2022-02-20 16:52:34,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {706#false} assume main_#t~mem12#1.base == 0 && main_#t~mem12#1.offset == 0;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset; {706#false} is VALID [2022-02-20 16:52:34,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {706#false} assume !false; {706#false} is VALID [2022-02-20 16:52:34,943 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 16:52:34,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:52:34,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913232889] [2022-02-20 16:52:34,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913232889] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:52:34,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:52:34,944 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:52:34,944 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205385889] [2022-02-20 16:52:34,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:52:34,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-02-20 16:52:34,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:52:34,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 16:52:34,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:34,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:52:34,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:52:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:52:34,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:52:34,956 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 16:52:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:35,048 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-02-20 16:52:35,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:52:35,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-02-20 16:52:35,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:52:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 16:52:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-02-20 16:52:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 16:52:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-02-20 16:52:35,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-02-20 16:52:35,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:35,081 INFO L225 Difference]: With dead ends: 35 [2022-02-20 16:52:35,081 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 16:52:35,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:52:35,082 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:52:35,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 44 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:52:35,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 16:52:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-02-20 16:52:35,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:52:35,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 16:52:35,084 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 16:52:35,084 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 16:52:35,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:35,085 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-20 16:52:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 16:52:35,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:35,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:35,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 27 states. [2022-02-20 16:52:35,085 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 27 states. [2022-02-20 16:52:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:35,086 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-20 16:52:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 16:52:35,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:35,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:35,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:52:35,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:52:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 16:52:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-02-20 16:52:35,087 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2022-02-20 16:52:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:52:35,088 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-02-20 16:52:35,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 16:52:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 16:52:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:52:35,088 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:52:35,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:52:35,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:52:35,088 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:52:35,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:52:35,089 INFO L85 PathProgramCache]: Analyzing trace with hash -839157876, now seen corresponding path program 1 times [2022-02-20 16:52:35,089 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:52:35,089 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704768363] [2022-02-20 16:52:35,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:52:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:52:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:52:35,099 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:52:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:52:35,114 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:52:35,114 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:52:35,114 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-20 16:52:35,115 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-02-20 16:52:35,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-02-20 16:52:35,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 16:52:35,118 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 16:52:35,119 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:52:35,138 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:52:35,138 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:52:35,138 WARN L170 areAnnotationChecker]: L1020-2 has no Hoare annotation [2022-02-20 16:52:35,138 WARN L170 areAnnotationChecker]: L1020-2 has no Hoare annotation [2022-02-20 16:52:35,139 WARN L170 areAnnotationChecker]: L1013-3 has no Hoare annotation [2022-02-20 16:52:35,139 WARN L170 areAnnotationChecker]: L1013-1 has no Hoare annotation [2022-02-20 16:52:35,139 WARN L170 areAnnotationChecker]: L1013-1 has no Hoare annotation [2022-02-20 16:52:35,139 WARN L170 areAnnotationChecker]: L1038-4 has no Hoare annotation [2022-02-20 16:52:35,139 WARN L170 areAnnotationChecker]: L1038-4 has no Hoare annotation [2022-02-20 16:52:35,139 WARN L170 areAnnotationChecker]: L1038-4 has no Hoare annotation [2022-02-20 16:52:35,139 WARN L170 areAnnotationChecker]: L1020 has no Hoare annotation [2022-02-20 16:52:35,139 WARN L170 areAnnotationChecker]: L1020 has no Hoare annotation [2022-02-20 16:52:35,139 WARN L170 areAnnotationChecker]: L1039-4 has no Hoare annotation [2022-02-20 16:52:35,139 WARN L170 areAnnotationChecker]: L1039-4 has no Hoare annotation [2022-02-20 16:52:35,139 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2022-02-20 16:52:35,139 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2022-02-20 16:52:35,139 WARN L170 areAnnotationChecker]: L1038-3 has no Hoare annotation [2022-02-20 16:52:35,140 WARN L170 areAnnotationChecker]: L1038-3 has no Hoare annotation [2022-02-20 16:52:35,140 WARN L170 areAnnotationChecker]: L1039 has no Hoare annotation [2022-02-20 16:52:35,140 WARN L170 areAnnotationChecker]: L1039 has no Hoare annotation [2022-02-20 16:52:35,140 WARN L170 areAnnotationChecker]: L1041-1 has no Hoare annotation [2022-02-20 16:52:35,140 WARN L170 areAnnotationChecker]: L1041-1 has no Hoare annotation [2022-02-20 16:52:35,140 WARN L170 areAnnotationChecker]: L1041-1 has no Hoare annotation [2022-02-20 16:52:35,140 WARN L170 areAnnotationChecker]: L1039-1 has no Hoare annotation [2022-02-20 16:52:35,140 WARN L170 areAnnotationChecker]: L1039-1 has no Hoare annotation [2022-02-20 16:52:35,140 WARN L170 areAnnotationChecker]: L1039-3 has no Hoare annotation [2022-02-20 16:52:35,140 WARN L170 areAnnotationChecker]: L1039-3 has no Hoare annotation [2022-02-20 16:52:35,140 WARN L170 areAnnotationChecker]: L1056-2 has no Hoare annotation [2022-02-20 16:52:35,140 WARN L170 areAnnotationChecker]: L1056-2 has no Hoare annotation [2022-02-20 16:52:35,141 WARN L170 areAnnotationChecker]: L1056-2 has no Hoare annotation [2022-02-20 16:52:35,141 WARN L170 areAnnotationChecker]: L1043 has no Hoare annotation [2022-02-20 16:52:35,141 WARN L170 areAnnotationChecker]: L1043 has no Hoare annotation [2022-02-20 16:52:35,141 WARN L170 areAnnotationChecker]: L1054-1 has no Hoare annotation [2022-02-20 16:52:35,141 WARN L170 areAnnotationChecker]: L1056 has no Hoare annotation [2022-02-20 16:52:35,141 WARN L170 areAnnotationChecker]: L1056 has no Hoare annotation [2022-02-20 16:52:35,141 WARN L170 areAnnotationChecker]: L1049-4 has no Hoare annotation [2022-02-20 16:52:35,141 WARN L170 areAnnotationChecker]: L1049-4 has no Hoare annotation [2022-02-20 16:52:35,141 WARN L170 areAnnotationChecker]: L1071 has no Hoare annotation [2022-02-20 16:52:35,141 WARN L170 areAnnotationChecker]: L1049 has no Hoare annotation [2022-02-20 16:52:35,141 WARN L170 areAnnotationChecker]: L1049 has no Hoare annotation [2022-02-20 16:52:35,141 WARN L170 areAnnotationChecker]: L1049-5 has no Hoare annotation [2022-02-20 16:52:35,141 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:52:35,142 WARN L170 areAnnotationChecker]: L1049-1 has no Hoare annotation [2022-02-20 16:52:35,142 WARN L170 areAnnotationChecker]: L1049-1 has no Hoare annotation [2022-02-20 16:52:35,142 WARN L170 areAnnotationChecker]: L1049-3 has no Hoare annotation [2022-02-20 16:52:35,142 WARN L170 areAnnotationChecker]: L1049-3 has no Hoare annotation [2022-02-20 16:52:35,142 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:52:35,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:52:35 BoogieIcfgContainer [2022-02-20 16:52:35,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:52:35,143 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:52:35,143 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:52:35,143 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:52:35,144 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:52:31" (3/4) ... [2022-02-20 16:52:35,145 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 16:52:35,165 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:52:35,166 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:52:35,166 INFO L158 Benchmark]: Toolchain (without parser) took 4394.51ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 69.0MB in the beginning and 102.4MB in the end (delta: -33.4MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2022-02-20 16:52:35,167 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory was 67.7MB in the beginning and 67.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:52:35,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.97ms. Allocated memory is still 88.1MB. Free memory was 69.0MB in the beginning and 57.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-02-20 16:52:35,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.48ms. Allocated memory is still 88.1MB. Free memory was 57.8MB in the beginning and 55.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:52:35,167 INFO L158 Benchmark]: Boogie Preprocessor took 37.73ms. Allocated memory is still 88.1MB. Free memory was 55.3MB in the beginning and 53.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:52:35,167 INFO L158 Benchmark]: RCFGBuilder took 571.32ms. Allocated memory is still 88.1MB. Free memory was 53.6MB in the beginning and 35.4MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 16:52:35,168 INFO L158 Benchmark]: TraceAbstraction took 3294.73ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 34.7MB in the beginning and 105.6MB in the end (delta: -70.8MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2022-02-20 16:52:35,168 INFO L158 Benchmark]: Witness Printer took 22.82ms. Allocated memory is still 130.0MB. Free memory was 105.6MB in the beginning and 102.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:52:35,169 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 67.7MB in the beginning and 67.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.97ms. Allocated memory is still 88.1MB. Free memory was 69.0MB in the beginning and 57.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.48ms. Allocated memory is still 88.1MB. Free memory was 57.8MB in the beginning and 55.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.73ms. Allocated memory is still 88.1MB. Free memory was 55.3MB in the beginning and 53.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 571.32ms. Allocated memory is still 88.1MB. Free memory was 53.6MB in the beginning and 35.4MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3294.73ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 34.7MB in the beginning and 105.6MB in the end (delta: -70.8MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * Witness Printer took 22.82ms. Allocated memory is still 130.0MB. Free memory was 105.6MB in the beginning and 102.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 1049]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={-1:0}, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1039] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end [L1043] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next VAL [end={-1:0}, end->next={0:0}, list={-1:0}] [L1049] COND TRUE !(end->next) [L1049] reach_error() VAL [end={-1:0}, list={-1:0}] - UnprovableResult [Line: 1038]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 261 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 22 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 160 IncrementalHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 110 mSDtfsCounter, 160 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 49 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 70 ConstructedInterpolants, 3 QuantifiedInterpolants, 589 SizeOfPredicates, 7 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 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 proved your program to be incorrect! [2022-02-20 16:52:35,192 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE