./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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 --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.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:04:37,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:04:37,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:04:37,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:04:37,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:04:37,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:04:37,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:04:37,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:04:37,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:04:37,977 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:04:37,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:04:37,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:04:37,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:04:37,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:04:37,980 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:04:37,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:04:37,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:04:37,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:04:37,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:04:37,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:04:37,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:04:37,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:04:37,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:04:37,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:04:37,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:04:37,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:04:37,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:04:37,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:04:37,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:04:37,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:04:37,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:04:37,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:04:37,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:04:37,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:04:37,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:04:37,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:04:37,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:04:37,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:04:37,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:04:37,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:04:37,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:04:37,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:04:37,994 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 [2024-11-09 22:04:38,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:04:38,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:04:38,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:04:38,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:04:38,254 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:04:38,255 INFO L431 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 [2024-11-09 22:04:39,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:04:39,923 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:04:39,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2024-11-09 22:04:39,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1987b9487/b4982997db9540d2a7243b89d06e2208/FLAG7038a1d1a [2024-11-09 22:04:39,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1987b9487/b4982997db9540d2a7243b89d06e2208 [2024-11-09 22:04:39,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:04:39,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:04:39,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:04:39,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:04:39,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:04:39,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:04:39" (1/1) ... [2024-11-09 22:04:39,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7b48e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:39, skipping insertion in model container [2024-11-09 22:04:39,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:04:39" (1/1) ... [2024-11-09 22:04:40,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:04:40,392 WARN L250 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] [2024-11-09 22:04:40,396 WARN L250 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] [2024-11-09 22:04:40,398 WARN L250 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] [2024-11-09 22:04:40,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:04:40,413 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:04:40,448 WARN L250 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] [2024-11-09 22:04:40,449 WARN L250 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] [2024-11-09 22:04:40,451 WARN L250 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] [2024-11-09 22:04:40,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:04:40,482 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:04:40,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:40 WrapperNode [2024-11-09 22:04:40,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:04:40,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:04:40,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:04:40,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:04:40,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:40" (1/1) ... [2024-11-09 22:04:40,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:40" (1/1) ... [2024-11-09 22:04:40,525 INFO L138 Inliner]: procedures = 119, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 107 [2024-11-09 22:04:40,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:04:40,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:04:40,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:04:40,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:04:40,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:40" (1/1) ... [2024-11-09 22:04:40,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:40" (1/1) ... [2024-11-09 22:04:40,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:40" (1/1) ... [2024-11-09 22:04:40,555 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-11-09 22:04:40,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:40" (1/1) ... [2024-11-09 22:04:40,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:40" (1/1) ... [2024-11-09 22:04:40,566 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:40" (1/1) ... [2024-11-09 22:04:40,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:40" (1/1) ... [2024-11-09 22:04:40,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:40" (1/1) ... [2024-11-09 22:04:40,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:40" (1/1) ... [2024-11-09 22:04:40,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:04:40,582 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:04:40,582 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:04:40,582 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:04:40,583 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:40" (1/1) ... [2024-11-09 22:04:40,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:04:40,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:04:40,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 22:04:40,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 22:04:40,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 22:04:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 22:04:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:04:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:04:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:04:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:04:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:04:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:04:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:04:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:04:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:04:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:04:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:04:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:04:40,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:04:40,812 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:04:40,814 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:04:41,037 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 22:04:41,037 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:04:41,050 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:04:41,050 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:04:41,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:04:41 BoogieIcfgContainer [2024-11-09 22:04:41,051 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:04:41,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:04:41,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:04:41,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:04:41,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:04:39" (1/3) ... [2024-11-09 22:04:41,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd607cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:04:41, skipping insertion in model container [2024-11-09 22:04:41,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:40" (2/3) ... [2024-11-09 22:04:41,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd607cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:04:41, skipping insertion in model container [2024-11-09 22:04:41,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:04:41" (3/3) ... [2024-11-09 22:04:41,062 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2024-11-09 22:04:41,077 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:04:41,077 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 22:04:41,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:04:41,144 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d213038, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:04:41,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-09 22:04:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:04:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 22:04:41,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:41,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:41,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:04:41,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1848583788, now seen corresponding path program 1 times [2024-11-09 22:04:41,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:41,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974405872] [2024-11-09 22:04:41,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:41,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:41,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:41,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974405872] [2024-11-09 22:04:41,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974405872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:41,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:04:41,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197406134] [2024-11-09 22:04:41,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:41,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:04:41,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:41,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:04:41,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:04:41,366 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 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.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:04:41,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:41,378 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2024-11-09 22:04:41,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:04:41,380 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 22:04:41,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:41,385 INFO L225 Difference]: With dead ends: 62 [2024-11-09 22:04:41,386 INFO L226 Difference]: Without dead ends: 25 [2024-11-09 22:04:41,389 INFO L431 NwaCegarLoop]: 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 [2024-11-09 22:04:41,392 INFO L432 NwaCegarLoop]: 37 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, 37 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 [2024-11-09 22:04:41,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:04:41,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-09 22:04:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-09 22:04:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 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) [2024-11-09 22:04:41,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-09 22:04:41,422 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2024-11-09 22:04:41,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:41,422 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-09 22:04:41,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:04:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-09 22:04:41,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 22:04:41,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:41,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:41,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:04:41,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:04:41,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:41,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1496396070, now seen corresponding path program 1 times [2024-11-09 22:04:41,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:41,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091059464] [2024-11-09 22:04:41,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:41,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:41,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:41,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091059464] [2024-11-09 22:04:41,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091059464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:41,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:41,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:04:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862542958] [2024-11-09 22:04:41,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:41,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:04:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:41,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:04:41,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:04:41,559 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:04:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:41,617 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-11-09 22:04:41,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:04:41,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 22:04:41,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:41,619 INFO L225 Difference]: With dead ends: 34 [2024-11-09 22:04:41,619 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 22:04:41,619 INFO L431 NwaCegarLoop]: 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 [2024-11-09 22:04:41,621 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:41,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 30 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:04:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 22:04:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2024-11-09 22:04:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.2380952380952381) 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) [2024-11-09 22:04:41,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-09 22:04:41,631 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 8 [2024-11-09 22:04:41,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:41,633 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-09 22:04:41,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:04:41,633 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-09 22:04:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 22:04:41,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:41,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:41,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:04:41,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:04:41,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1668916146, now seen corresponding path program 1 times [2024-11-09 22:04:41,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:41,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249651329] [2024-11-09 22:04:41,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:41,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:41,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249651329] [2024-11-09 22:04:41,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249651329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:41,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:41,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:04:41,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779273816] [2024-11-09 22:04:41,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:41,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:04:41,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:41,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:04:41,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:04:41,893 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:04:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:42,002 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-11-09 22:04:42,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:04:42,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-09 22:04:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:42,004 INFO L225 Difference]: With dead ends: 52 [2024-11-09 22:04:42,004 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 22:04:42,004 INFO L431 NwaCegarLoop]: 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 [2024-11-09 22:04:42,007 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:42,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 78 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:04:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 22:04:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2024-11-09 22:04:42,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:04:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-09 22:04:42,021 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 11 [2024-11-09 22:04:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:42,021 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-09 22:04:42,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:04:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-09 22:04:42,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 22:04:42,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:42,023 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:42,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:04:42,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:04:42,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:42,024 INFO L85 PathProgramCache]: Analyzing trace with hash 257294301, now seen corresponding path program 1 times [2024-11-09 22:04:42,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:42,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765622846] [2024-11-09 22:04:42,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:42,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:42,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:42,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:42,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765622846] [2024-11-09 22:04:42,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765622846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:04:42,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112421981] [2024-11-09 22:04:42,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:42,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:04:42,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:04:42,494 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) [2024-11-09 22:04:42,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 22:04:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:42,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 22:04:42,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:04:42,684 INFO L378 Elim1Store]: Elim1 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 [2024-11-09 22:04:42,693 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-09 22:04:42,784 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:04:42,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 22:04:42,801 INFO L378 Elim1Store]: Elim1 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 35 treesize of output 18 [2024-11-09 22:04:42,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:04:42,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 11 [2024-11-09 22:04:42,846 INFO L378 Elim1Store]: Elim1 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 11 [2024-11-09 22:04:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:42,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:04:42,963 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_105 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1)) is different from false [2024-11-09 22:04:43,007 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_105 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.base_28| Int) (v_ArrVal_103 (Array Int Int))) (or (not (= v_ArrVal_103 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_103 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_28|) 0)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_103) |v_ULTIMATE.start_main_~end~0#1.base_28| v_ArrVal_105) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1))) is different from false [2024-11-09 22:04:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 22:04:43,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112421981] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:04:43,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:04:43,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 22:04:43,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962972284] [2024-11-09 22:04:43,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:04:43,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 22:04:43,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:43,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 22:04:43,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=83, Unknown=2, NotChecked=38, Total=156 [2024-11-09 22:04:43,073 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:04:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:43,333 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2024-11-09 22:04:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 22:04:43,334 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 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 14 [2024-11-09 22:04:43,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:43,336 INFO L225 Difference]: With dead ends: 81 [2024-11-09 22:04:43,336 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 22:04:43,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=193, Unknown=2, NotChecked=62, Total=342 [2024-11-09 22:04:43,338 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 154 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:43,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 137 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 78 Invalid, 0 Unknown, 156 Unchecked, 0.1s Time] [2024-11-09 22:04:43,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 22:04:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 37. [2024-11-09 22:04:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:04:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-11-09 22:04:43,356 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 14 [2024-11-09 22:04:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:43,356 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-11-09 22:04:43,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:04:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-11-09 22:04:43,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 22:04:43,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:43,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:43,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 22:04:43,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:04:43,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:04:43,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:43,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1061862085, now seen corresponding path program 1 times [2024-11-09 22:04:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:43,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135940957] [2024-11-09 22:04:43,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:43,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:43,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:43,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135940957] [2024-11-09 22:04:43,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135940957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:43,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:43,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:04:43,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747973479] [2024-11-09 22:04:43,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:43,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:04:43,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:43,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:04:43,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:04:43,633 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:04:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:43,703 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-11-09 22:04:43,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:04:43,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-09 22:04:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:43,706 INFO L225 Difference]: With dead ends: 55 [2024-11-09 22:04:43,706 INFO L226 Difference]: Without dead ends: 46 [2024-11-09 22:04:43,706 INFO L431 NwaCegarLoop]: 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 [2024-11-09 22:04:43,707 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:43,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:04:43,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-09 22:04:43,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2024-11-09 22:04:43,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:04:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-11-09 22:04:43,722 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2024-11-09 22:04:43,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:43,722 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-09 22:04:43,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:04:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-11-09 22:04:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 22:04:43,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:43,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:43,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 22:04:43,727 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:04:43,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:43,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1061891876, now seen corresponding path program 1 times [2024-11-09 22:04:43,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:43,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784085524] [2024-11-09 22:04:43,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:43,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:04:43,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 22:04:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:04:43,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 22:04:43,772 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 22:04:43,773 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-09 22:04:43,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-09 22:04:43,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-11-09 22:04:43,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 22:04:43,780 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 22:04:43,799 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:04:43,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:04:43 BoogieIcfgContainer [2024-11-09 22:04:43,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:04:43,803 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:04:43,803 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:04:43,803 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:04:43,804 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:04:41" (3/4) ... [2024-11-09 22:04:43,805 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 22:04:43,846 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:04:43,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:04:43,847 INFO L158 Benchmark]: Toolchain (without parser) took 3888.09ms. Allocated memory was 176.2MB in the beginning and 245.4MB in the end (delta: 69.2MB). Free memory was 101.7MB in the beginning and 158.0MB in the end (delta: -56.3MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-09 22:04:43,848 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:04:43,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.18ms. Allocated memory is still 176.2MB. Free memory was 101.6MB in the beginning and 128.5MB in the end (delta: -27.0MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-09 22:04:43,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.55ms. Allocated memory is still 176.2MB. Free memory was 128.5MB in the beginning and 126.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:04:43,849 INFO L158 Benchmark]: Boogie Preprocessor took 54.92ms. Allocated memory is still 176.2MB. Free memory was 126.5MB in the beginning and 124.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:04:43,849 INFO L158 Benchmark]: IcfgBuilder took 469.71ms. Allocated memory is still 176.2MB. Free memory was 124.4MB in the beginning and 107.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 22:04:43,850 INFO L158 Benchmark]: TraceAbstraction took 2749.46ms. Allocated memory was 176.2MB in the beginning and 245.4MB in the end (delta: 69.2MB). Free memory was 107.0MB in the beginning and 160.1MB in the end (delta: -53.1MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-09 22:04:43,850 INFO L158 Benchmark]: Witness Printer took 43.54ms. Allocated memory is still 245.4MB. Free memory was 160.1MB in the beginning and 158.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:04:43,853 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.18ms. Allocated memory is still 176.2MB. Free memory was 101.6MB in the beginning and 128.5MB in the end (delta: -27.0MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.55ms. Allocated memory is still 176.2MB. Free memory was 128.5MB in the beginning and 126.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.92ms. Allocated memory is still 176.2MB. Free memory was 126.5MB in the beginning and 124.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 469.71ms. Allocated memory is still 176.2MB. Free memory was 124.4MB in the beginning and 107.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2749.46ms. Allocated memory was 176.2MB in the beginning and 245.4MB in the end (delta: 69.2MB). Free memory was 107.0MB in the beginning and 160.1MB in the end (delta: -53.1MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Witness Printer took 43.54ms. Allocated memory is still 245.4MB. Free memory was 160.1MB in the beginning and 158.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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}] [L1038] COND FALSE !(0) VAL [end={-1:0}, list={-1:0}] [L1039] EXPR end->colour [L1039] COND FALSE !(!(BLACK == end->colour)) [L1039] COND FALSE !(0) VAL [end={-1:0}, list={-1:0}] [L1041] COND TRUE ((void*)0) != end [L1043] EXPR end->colour [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next [L1049] COND TRUE !(end->next) [L1049] reach_error() VAL [end={-1:0}, list={-1:0}] - UnprovableResult [Line: 1039]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 340 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 156 IncrementalHoareTripleChecker+Unchecked, 216 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167 IncrementalHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 124 mSDtfsCounter, 167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=5, InterpolantAutomatonStates: 29, 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, 76 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 78 ConstructedInterpolants, 3 QuantifiedInterpolants, 566 SizeOfPredicates, 7 NumberOfNonLiveVariables, 120 ConjunctsInSsa, 23 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! [2024-11-09 22:04:43,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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