./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-buckets-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 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:33:07,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:33:07,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:33:07,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:33:07,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:33:07,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:33:07,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:33:07,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:33:07,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:33:07,893 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:33:07,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:33:07,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:33:07,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:33:07,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:33:07,897 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:33:07,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:33:07,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:33:07,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:33:07,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:33:07,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:33:07,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:33:07,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:33:07,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:33:07,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:33:07,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:33:07,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:33:07,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:33:07,904 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:33:07,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:33:07,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:33:07,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:33:07,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:33:07,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:33:07,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:33:07,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:33:07,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:33:07,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:33:07,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:33:07,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:33:07,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:33:07,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:33:07,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:33:07,909 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 -> 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb [2024-11-11 19:33:08,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:33:08,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:33:08,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:33:08,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:33:08,213 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:33:08,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-2.i [2024-11-11 19:33:09,687 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:33:09,917 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:33:09,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i [2024-11-11 19:33:09,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78187f50a/d45439ce02b84417888a2f998a96602f/FLAG77a5efc88 [2024-11-11 19:33:09,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78187f50a/d45439ce02b84417888a2f998a96602f [2024-11-11 19:33:09,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:33:09,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:33:09,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:33:09,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:33:09,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:33:09,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:33:09" (1/1) ... [2024-11-11 19:33:09,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15724fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:09, skipping insertion in model container [2024-11-11 19:33:09,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:33:09" (1/1) ... [2024-11-11 19:33:10,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:33:10,291 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-buckets-2.i[22663,22676] [2024-11-11 19:33:10,299 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-buckets-2.i[22734,22747] [2024-11-11 19:33:10,301 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-buckets-2.i[22862,22875] [2024-11-11 19:33:10,304 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-buckets-2.i[23275,23288] [2024-11-11 19:33:10,305 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-buckets-2.i[23364,23377] [2024-11-11 19:33:10,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:33:10,316 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:33:10,351 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-buckets-2.i[22663,22676] [2024-11-11 19:33:10,353 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-buckets-2.i[22734,22747] [2024-11-11 19:33:10,354 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-buckets-2.i[22862,22875] [2024-11-11 19:33:10,356 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-buckets-2.i[23275,23288] [2024-11-11 19:33:10,357 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-buckets-2.i[23364,23377] [2024-11-11 19:33:10,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:33:10,395 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:33:10,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:10 WrapperNode [2024-11-11 19:33:10,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:33:10,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:33:10,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:33:10,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:33:10,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:10" (1/1) ... [2024-11-11 19:33:10,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:10" (1/1) ... [2024-11-11 19:33:10,442 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2024-11-11 19:33:10,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:33:10,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:33:10,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:33:10,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:33:10,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:10" (1/1) ... [2024-11-11 19:33:10,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:10" (1/1) ... [2024-11-11 19:33:10,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:10" (1/1) ... [2024-11-11 19:33:10,479 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 16 writes are split as follows [0, 16]. [2024-11-11 19:33:10,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:10" (1/1) ... [2024-11-11 19:33:10,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:10" (1/1) ... [2024-11-11 19:33:10,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:10" (1/1) ... [2024-11-11 19:33:10,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:10" (1/1) ... [2024-11-11 19:33:10,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:10" (1/1) ... [2024-11-11 19:33:10,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:10" (1/1) ... [2024-11-11 19:33:10,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:33:10,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:33:10,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:33:10,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:33:10,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:10" (1/1) ... [2024-11-11 19:33:10,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:33:10,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:10,544 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-11 19:33:10,547 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-11 19:33:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 19:33:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 19:33:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 19:33:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 19:33:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-11 19:33:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:33:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-11 19:33:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-11 19:33:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-11 19:33:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-11 19:33:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 19:33:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:33:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 19:33:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:33:10,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:33:10,748 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:33:10,751 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:33:11,020 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-11 19:33:11,020 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:33:11,055 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:33:11,056 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-11 19:33:11,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:33:11 BoogieIcfgContainer [2024-11-11 19:33:11,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:33:11,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:33:11,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:33:11,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:33:11,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:33:09" (1/3) ... [2024-11-11 19:33:11,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252b3a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:33:11, skipping insertion in model container [2024-11-11 19:33:11,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:10" (2/3) ... [2024-11-11 19:33:11,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252b3a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:33:11, skipping insertion in model container [2024-11-11 19:33:11,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:33:11" (3/3) ... [2024-11-11 19:33:11,067 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.i [2024-11-11 19:33:11,084 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:33:11,085 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-11-11 19:33:11,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:33:11,164 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;@539e8487, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:33:11,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-11 19:33:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 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-11 19:33:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-11 19:33:11,174 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:11,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:11,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:11,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:11,179 INFO L85 PathProgramCache]: Analyzing trace with hash 179510098, now seen corresponding path program 1 times [2024-11-11 19:33:11,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:11,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751857441] [2024-11-11 19:33:11,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:11,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:11,589 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-11 19:33:11,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:11,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751857441] [2024-11-11 19:33:11,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751857441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:33:11,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:33:11,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:33:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187689543] [2024-11-11 19:33:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:33:11,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:33:11,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:11,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:33:11,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:33:11,623 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 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 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-11 19:33:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:11,717 INFO L93 Difference]: Finished difference Result 103 states and 173 transitions. [2024-11-11 19:33:11,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:33:11,720 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-11 19:33:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:11,736 INFO L225 Difference]: With dead ends: 103 [2024-11-11 19:33:11,736 INFO L226 Difference]: Without dead ends: 57 [2024-11-11 19:33:11,742 INFO L434 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-11 19:33:11,747 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 57 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:11,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 81 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:33:11,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-11 19:33:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2024-11-11 19:33:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 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-11 19:33:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-11 19:33:11,787 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 8 [2024-11-11 19:33:11,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:11,787 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-11 19:33:11,788 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-11 19:33:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-11 19:33:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-11 19:33:11,789 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:11,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:11,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:33:11,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:11,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111283, now seen corresponding path program 1 times [2024-11-11 19:33:11,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:11,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780337578] [2024-11-11 19:33:11,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:11,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:11,892 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-11 19:33:11,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:11,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780337578] [2024-11-11 19:33:11,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780337578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:33:11,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:33:11,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:33:11,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32421161] [2024-11-11 19:33:11,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:33:11,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:33:11,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:11,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:33:11,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:33:11,896 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:11,932 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-11 19:33:11,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:33:11,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-11 19:33:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:11,934 INFO L225 Difference]: With dead ends: 42 [2024-11-11 19:33:11,935 INFO L226 Difference]: Without dead ends: 40 [2024-11-11 19:33:11,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:33:11,936 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:11,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:33:11,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-11 19:33:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-11 19:33:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 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-11 19:33:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-11-11 19:33:11,946 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 9 [2024-11-11 19:33:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:11,947 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-11 19:33:11,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-11-11 19:33:11,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 19:33:11,947 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:11,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:11,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:33:11,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:11,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1834780084, now seen corresponding path program 1 times [2024-11-11 19:33:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457389631] [2024-11-11 19:33:11,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:12,621 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-11 19:33:12,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457389631] [2024-11-11 19:33:12,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457389631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:33:12,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:33:12,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:33:12,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348621252] [2024-11-11 19:33:12,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:33:12,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:33:12,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:12,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:33:12,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:33:12,624 INFO L87 Difference]: Start difference. First operand 39 states and 47 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) [2024-11-11 19:33:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:12,784 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2024-11-11 19:33:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:33:12,785 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 [2024-11-11 19:33:12,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:12,786 INFO L225 Difference]: With dead ends: 58 [2024-11-11 19:33:12,786 INFO L226 Difference]: Without dead ends: 47 [2024-11-11 19:33:12,787 INFO L434 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-11 19:33:12,788 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:12,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 94 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:33:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-11 19:33:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2024-11-11 19:33:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 43 states have internal predecessors, (53), 0 states have call successors, (0), 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-11 19:33:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-11 19:33:12,802 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 10 [2024-11-11 19:33:12,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:12,803 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-11 19:33:12,803 INFO L472 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) [2024-11-11 19:33:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-11 19:33:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 19:33:12,803 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:12,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:12,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 19:33:12,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:12,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:12,805 INFO L85 PathProgramCache]: Analyzing trace with hash 710639734, now seen corresponding path program 1 times [2024-11-11 19:33:12,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:12,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523371675] [2024-11-11 19:33:12,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:12,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:12,874 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-11 19:33:12,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:12,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523371675] [2024-11-11 19:33:12,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523371675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:33:12,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:33:12,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:33:12,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554381948] [2024-11-11 19:33:12,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:33:12,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:33:12,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:12,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:33:12,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:33:12,877 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:12,909 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-11 19:33:12,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:33:12,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-11 19:33:12,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:12,911 INFO L225 Difference]: With dead ends: 44 [2024-11-11 19:33:12,911 INFO L226 Difference]: Without dead ends: 42 [2024-11-11 19:33:12,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:33:12,913 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:12,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 47 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:33:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-11 19:33:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-11 19:33:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.275) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 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-11 19:33:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-11-11 19:33:12,928 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2024-11-11 19:33:12,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:12,928 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-11 19:33:12,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-11-11 19:33:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 19:33:12,929 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:12,929 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:12,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 19:33:12,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:12,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:12,930 INFO L85 PathProgramCache]: Analyzing trace with hash 625501225, now seen corresponding path program 1 times [2024-11-11 19:33:12,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:12,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110005761] [2024-11-11 19:33:12,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:12,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:13,749 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-11 19:33:13,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:13,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110005761] [2024-11-11 19:33:13,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110005761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:33:13,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241102422] [2024-11-11 19:33:13,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:13,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:13,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:13,753 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-11 19:33:13,755 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-11 19:33:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:13,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-11 19:33:13,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:33:14,002 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-11 19:33:14,016 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-11 19:33:14,058 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2024-11-11 19:33:14,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 84 [2024-11-11 19:33:14,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-11 19:33:14,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:14,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:14,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:14,087 INFO L378 Elim1Store]: Elim1 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 40 treesize of output 42 [2024-11-11 19:33:14,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-11 19:33:14,112 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 19:33:14,113 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 35 treesize of output 27 [2024-11-11 19:33:14,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2024-11-11 19:33:14,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2024-11-11 19:33:14,481 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-11 19:33:14,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 59 [2024-11-11 19:33:14,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2024-11-11 19:33:14,851 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-11 19:33:14,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:33:15,059 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-11 19:33:15,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241102422] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:33:15,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:33:15,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-11 19:33:15,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902142828] [2024-11-11 19:33:15,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:33:15,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 19:33:15,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:15,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 19:33:15,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-11 19:33:15,063 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 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-11 19:33:15,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:15,825 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-11-11 19:33:15,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 19:33:15,826 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 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 [2024-11-11 19:33:15,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:15,827 INFO L225 Difference]: With dead ends: 62 [2024-11-11 19:33:15,827 INFO L226 Difference]: Without dead ends: 51 [2024-11-11 19:33:15,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-11 19:33:15,828 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 26 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:15,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 252 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 19:33:15,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-11 19:33:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-11-11 19:33:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 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-11 19:33:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2024-11-11 19:33:15,843 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2024-11-11 19:33:15,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:15,844 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2024-11-11 19:33:15,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 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-11 19:33:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-11-11 19:33:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 19:33:15,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:15,845 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:15,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 19:33:16,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:16,046 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:16,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1157082046, now seen corresponding path program 1 times [2024-11-11 19:33:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:16,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247203487] [2024-11-11 19:33:16,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:16,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:16,353 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-11 19:33:16,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:16,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247203487] [2024-11-11 19:33:16,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247203487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:33:16,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661110944] [2024-11-11 19:33:16,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:16,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:16,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:16,358 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:33:16,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 19:33:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:16,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-11 19:33:16,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:33:16,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 24 treesize of output 28 [2024-11-11 19:33:16,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:16,541 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2024-11-11 19:33:16,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2024-11-11 19:33:16,558 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-11-11 19:33:16,559 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 36 [2024-11-11 19:33:16,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:16,605 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 34 treesize of output 25 [2024-11-11 19:33:16,622 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-11 19:33:16,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-11 19:33:16,655 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 33 treesize of output 24 [2024-11-11 19:33:16,726 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 12 [2024-11-11 19:33:16,733 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-11 19:33:16,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:33:16,874 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-11 19:33:16,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661110944] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:33:16,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:33:16,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-11 19:33:16,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023695037] [2024-11-11 19:33:16,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:33:16,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 19:33:16,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:16,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 19:33:16,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=115, Unknown=4, NotChecked=0, Total=156 [2024-11-11 19:33:16,876 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 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) [2024-11-11 19:33:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:17,212 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2024-11-11 19:33:17,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 19:33:17,212 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 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) Word has length 16 [2024-11-11 19:33:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:17,213 INFO L225 Difference]: With dead ends: 104 [2024-11-11 19:33:17,214 INFO L226 Difference]: Without dead ends: 102 [2024-11-11 19:33:17,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=208, Unknown=4, NotChecked=0, Total=306 [2024-11-11 19:33:17,215 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 188 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:17,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 183 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:33:17,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-11 19:33:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 62. [2024-11-11 19:33:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 0 states have call successors, (0), 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-11 19:33:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2024-11-11 19:33:17,234 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 16 [2024-11-11 19:33:17,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:17,234 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-11-11 19:33:17,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 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) [2024-11-11 19:33:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-11-11 19:33:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 19:33:17,235 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:17,235 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:17,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 19:33:17,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 19:33:17,436 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:17,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:17,437 INFO L85 PathProgramCache]: Analyzing trace with hash 442135079, now seen corresponding path program 2 times [2024-11-11 19:33:17,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:17,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737168162] [2024-11-11 19:33:17,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:17,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:18,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:18,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737168162] [2024-11-11 19:33:18,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737168162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:33:18,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657805279] [2024-11-11 19:33:18,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:33:18,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:18,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:18,010 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:33:18,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 19:33:18,334 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:33:18,334 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:33:18,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-11 19:33:18,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:33:18,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:18,382 INFO L349 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2024-11-11 19:33:18,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 20 [2024-11-11 19:33:18,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2024-11-11 19:33:18,402 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 11 [2024-11-11 19:33:18,423 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2024-11-11 19:33:18,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2024-11-11 19:33:18,451 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 19:33:18,451 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-11 19:33:18,457 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-11 19:33:18,480 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 21 treesize of output 20 [2024-11-11 19:33:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:33:18,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:33:18,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657805279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:33:18,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:33:18,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-11 19:33:18,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613000702] [2024-11-11 19:33:18,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:33:18,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:33:18,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:18,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:33:18,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:33:18,587 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-11 19:33:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:18,863 INFO L93 Difference]: Finished difference Result 141 states and 175 transitions. [2024-11-11 19:33:18,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:33:18,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 18 [2024-11-11 19:33:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:18,865 INFO L225 Difference]: With dead ends: 141 [2024-11-11 19:33:18,865 INFO L226 Difference]: Without dead ends: 106 [2024-11-11 19:33:18,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-11 19:33:18,866 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 70 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:18,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 144 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:33:18,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-11 19:33:18,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2024-11-11 19:33:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 75 states have internal predecessors, (93), 0 states have call successors, (0), 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-11 19:33:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2024-11-11 19:33:18,886 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 18 [2024-11-11 19:33:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:18,887 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2024-11-11 19:33:18,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-11 19:33:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2024-11-11 19:33:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-11 19:33:18,888 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:18,888 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:18,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 19:33:19,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:19,090 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:19,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash -482453053, now seen corresponding path program 1 times [2024-11-11 19:33:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:19,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578641613] [2024-11-11 19:33:19,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:19,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:19,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:19,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578641613] [2024-11-11 19:33:19,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578641613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:33:19,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493374493] [2024-11-11 19:33:19,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:19,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:19,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:19,554 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:33:19,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 19:33:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:19,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-11 19:33:19,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:33:19,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2024-11-11 19:33:19,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-11-11 19:33:19,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:19,775 INFO L349 Elim1Store]: treesize reduction 39, result has 11.4 percent of original size [2024-11-11 19:33:19,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 38 [2024-11-11 19:33:19,798 INFO L349 Elim1Store]: treesize reduction 36, result has 32.1 percent of original size [2024-11-11 19:33:19,799 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 83 [2024-11-11 19:33:19,811 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 48 treesize of output 52 [2024-11-11 19:33:19,815 INFO L378 Elim1Store]: Elim1 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 52 treesize of output 16 [2024-11-11 19:33:19,824 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 15 [2024-11-11 19:33:19,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-11 19:33:19,943 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 19:33:19,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2024-11-11 19:33:19,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:19,971 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-11 19:33:19,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 70 [2024-11-11 19:33:19,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:19,999 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-11-11 19:33:19,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-11-11 19:33:20,014 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 15 [2024-11-11 19:33:20,125 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 23 treesize of output 16 [2024-11-11 19:33:20,147 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-11 19:33:20,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 100 treesize of output 71 [2024-11-11 19:33:20,169 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 22 [2024-11-11 19:33:20,567 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-11 19:33:20,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 92 treesize of output 43 [2024-11-11 19:33:20,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-11 19:33:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:20,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:33:20,755 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (or (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_830) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 8)) 1) (not (= v_ArrVal_832 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 (select v_ArrVal_832 .cse0))))))) is different from false [2024-11-11 19:33:20,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:33:20,775 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2024-11-11 19:33:20,788 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_36| Int) (v_ArrVal_830 (Array Int Int))) (or (= (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_main_~item~0#1.base_36| v_arrayElimArr_8) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_36| v_ArrVal_832) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_36| v_ArrVal_830) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) 1) (not (= v_ArrVal_832 (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_36|) 0 0) 4 (select v_ArrVal_832 4)))) (not (= (select v_arrayElimArr_8 4) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_36|) 0)))) is different from false [2024-11-11 19:33:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:20,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493374493] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:33:20,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:33:20,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-11-11 19:33:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540525586] [2024-11-11 19:33:20,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:33:20,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-11 19:33:20,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:20,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-11 19:33:20,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=269, Unknown=2, NotChecked=66, Total=380 [2024-11-11 19:33:20,844 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 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-11 19:33:22,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:22,555 INFO L93 Difference]: Finished difference Result 238 states and 300 transitions. [2024-11-11 19:33:22,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 19:33:22,556 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 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 19 [2024-11-11 19:33:22,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:22,557 INFO L225 Difference]: With dead ends: 238 [2024-11-11 19:33:22,558 INFO L226 Difference]: Without dead ends: 203 [2024-11-11 19:33:22,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=260, Invalid=936, Unknown=2, NotChecked=134, Total=1332 [2024-11-11 19:33:22,560 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 451 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:22,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 353 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 478 Invalid, 0 Unknown, 297 Unchecked, 0.5s Time] [2024-11-11 19:33:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-11 19:33:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 130. [2024-11-11 19:33:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.28125) internal successors, (164), 129 states have internal predecessors, (164), 0 states have call successors, (0), 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-11 19:33:22,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 164 transitions. [2024-11-11 19:33:22,590 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 164 transitions. Word has length 19 [2024-11-11 19:33:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:22,591 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 164 transitions. [2024-11-11 19:33:22,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 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-11 19:33:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2024-11-11 19:33:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 19:33:22,593 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:22,593 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:22,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 19:33:22,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:22,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:22,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:22,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1136543444, now seen corresponding path program 2 times [2024-11-11 19:33:22,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:22,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593284780] [2024-11-11 19:33:22,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:22,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:23,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:23,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593284780] [2024-11-11 19:33:23,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593284780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:33:23,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339542316] [2024-11-11 19:33:23,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:33:23,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:23,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:23,692 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:33:23,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 19:33:23,937 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:33:23,937 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:33:23,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-11 19:33:23,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:33:23,961 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-11 19:33:23,967 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 36 treesize of output 40 [2024-11-11 19:33:23,990 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2024-11-11 19:33:23,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 79 [2024-11-11 19:33:24,018 INFO L349 Elim1Store]: treesize reduction 94, result has 34.3 percent of original size [2024-11-11 19:33:24,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 73 [2024-11-11 19:33:24,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2024-11-11 19:33:24,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-11 19:33:24,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2024-11-11 19:33:24,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 1 [2024-11-11 19:33:24,070 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-11 19:33:24,070 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 59 treesize of output 43 [2024-11-11 19:33:24,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:24,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2024-11-11 19:33:24,223 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-11 19:33:24,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 107 treesize of output 77 [2024-11-11 19:33:24,424 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-11 19:33:24,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 121 treesize of output 90 [2024-11-11 19:33:24,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:24,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:24,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2024-11-11 19:33:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:24,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:33:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:28,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339542316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:33:28,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:33:28,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-11 19:33:28,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722165559] [2024-11-11 19:33:28,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:33:28,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-11 19:33:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:28,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-11 19:33:28,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=314, Unknown=1, NotChecked=0, Total=380 [2024-11-11 19:33:28,985 INFO L87 Difference]: Start difference. First operand 130 states and 164 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 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-11 19:33:29,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:29,765 INFO L93 Difference]: Finished difference Result 156 states and 194 transitions. [2024-11-11 19:33:29,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 19:33:29,766 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 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 20 [2024-11-11 19:33:29,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:29,767 INFO L225 Difference]: With dead ends: 156 [2024-11-11 19:33:29,767 INFO L226 Difference]: Without dead ends: 145 [2024-11-11 19:33:29,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=116, Invalid=533, Unknown=1, NotChecked=0, Total=650 [2024-11-11 19:33:29,768 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:29,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 277 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 19:33:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-11 19:33:29,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2024-11-11 19:33:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 133 states have (on average 1.2706766917293233) internal successors, (169), 134 states have internal predecessors, (169), 0 states have call successors, (0), 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-11 19:33:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 169 transitions. [2024-11-11 19:33:29,797 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 169 transitions. Word has length 20 [2024-11-11 19:33:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:29,798 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 169 transitions. [2024-11-11 19:33:29,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 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-11 19:33:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2024-11-11 19:33:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-11 19:33:29,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:29,803 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:29,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 19:33:30,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:30,004 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:30,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:30,004 INFO L85 PathProgramCache]: Analyzing trace with hash -800532698, now seen corresponding path program 1 times [2024-11-11 19:33:30,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:30,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179719149] [2024-11-11 19:33:30,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:30,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:30,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:30,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179719149] [2024-11-11 19:33:30,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179719149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:33:30,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338211532] [2024-11-11 19:33:30,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:30,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:30,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:30,810 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:33:30,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 19:33:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:31,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-11 19:33:31,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:33:31,040 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 28 treesize of output 32 [2024-11-11 19:33:31,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 17 treesize of output 22 [2024-11-11 19:33:31,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-11-11 19:33:31,111 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2024-11-11 19:33:31,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 148 [2024-11-11 19:33:31,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:31,136 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2024-11-11 19:33:31,136 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 23 [2024-11-11 19:33:31,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 25 [2024-11-11 19:33:31,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:31,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:31,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:31,173 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2024-11-11 19:33:31,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 46 [2024-11-11 19:33:31,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-11 19:33:31,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:31,302 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-11 19:33:31,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 71 [2024-11-11 19:33:31,331 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-11 19:33:31,331 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 41 [2024-11-11 19:33:31,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:31,366 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2024-11-11 19:33:31,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2024-11-11 19:33:31,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2024-11-11 19:33:31,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 [2024-11-11 19:33:31,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:31,427 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-11-11 19:33:31,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-11-11 19:33:31,516 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-11 19:33:31,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 69 [2024-11-11 19:33:31,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2024-11-11 19:33:31,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:31,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2024-11-11 19:33:31,998 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-11 19:33:31,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 53 [2024-11-11 19:33:32,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-11 19:33:32,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:32,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:33:32,256 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= 2 (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1157)) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1159))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 2)) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 8)))))) is different from false [2024-11-11 19:33:32,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:33:32,277 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2024-11-11 19:33:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:32,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338211532] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:33:32,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:33:32,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2024-11-11 19:33:32,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264271408] [2024-11-11 19:33:32,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:33:32,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 19:33:32,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:32,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 19:33:32,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=409, Unknown=1, NotChecked=40, Total=506 [2024-11-11 19:33:32,389 INFO L87 Difference]: Start difference. First operand 135 states and 169 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 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-11 19:33:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:34,217 INFO L93 Difference]: Finished difference Result 309 states and 388 transitions. [2024-11-11 19:33:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 19:33:34,218 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 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 21 [2024-11-11 19:33:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:34,219 INFO L225 Difference]: With dead ends: 309 [2024-11-11 19:33:34,219 INFO L226 Difference]: Without dead ends: 274 [2024-11-11 19:33:34,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=226, Invalid=967, Unknown=1, NotChecked=66, Total=1260 [2024-11-11 19:33:34,221 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 262 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:34,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 497 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 751 Invalid, 0 Unknown, 138 Unchecked, 1.0s Time] [2024-11-11 19:33:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-11 19:33:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 191. [2024-11-11 19:33:34,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 189 states have (on average 1.291005291005291) internal successors, (244), 190 states have internal predecessors, (244), 0 states have call successors, (0), 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-11 19:33:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 244 transitions. [2024-11-11 19:33:34,257 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 244 transitions. Word has length 21 [2024-11-11 19:33:34,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:34,257 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 244 transitions. [2024-11-11 19:33:34,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 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-11 19:33:34,257 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 244 transitions. [2024-11-11 19:33:34,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 19:33:34,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:34,258 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:34,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 19:33:34,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:34,463 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:34,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:34,463 INFO L85 PathProgramCache]: Analyzing trace with hash -962615628, now seen corresponding path program 1 times [2024-11-11 19:33:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:34,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429476719] [2024-11-11 19:33:34,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 19:33:34,504 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 19:33:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 19:33:34,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 19:33:34,547 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 19:33:34,548 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-11 19:33:34,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-11 19:33:34,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-11-11 19:33:34,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-11-11 19:33:34,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-11 19:33:34,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 19:33:34,553 INFO L421 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:34,584 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 19:33:34,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 07:33:34 BoogieIcfgContainer [2024-11-11 19:33:34,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 19:33:34,587 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 19:33:34,588 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 19:33:34,588 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 19:33:34,588 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:33:11" (3/4) ... [2024-11-11 19:33:34,589 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 19:33:34,635 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 19:33:34,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 19:33:34,638 INFO L158 Benchmark]: Toolchain (without parser) took 24689.60ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 124.9MB in the beginning and 291.6MB in the end (delta: -166.7MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-11-11 19:33:34,639 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:33:34,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.72ms. Allocated memory is still 167.8MB. Free memory was 124.9MB in the beginning and 103.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-11 19:33:34,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.32ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 101.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:33:34,639 INFO L158 Benchmark]: Boogie Preprocessor took 63.00ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 98.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 19:33:34,639 INFO L158 Benchmark]: RCFGBuilder took 551.27ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 136.7MB in the end (delta: -38.5MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2024-11-11 19:33:34,639 INFO L158 Benchmark]: TraceAbstraction took 23526.22ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 135.9MB in the beginning and 294.7MB in the end (delta: -158.8MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-11-11 19:33:34,640 INFO L158 Benchmark]: Witness Printer took 50.78ms. Allocated memory is still 352.3MB. Free memory was 294.7MB in the beginning and 291.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 19:33:34,641 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.18ms. Allocated memory is still 109.1MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.72ms. Allocated memory is still 167.8MB. Free memory was 124.9MB in the beginning and 103.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.32ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 101.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.00ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 98.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 551.27ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 136.7MB in the end (delta: -38.5MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23526.22ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 135.9MB in the beginning and 294.7MB in the end (delta: -158.8MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Witness Printer took 50.78ms. Allocated memory is still 352.3MB. Free memory was 294.7MB in the beginning and 291.6MB 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: 1061]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1004] BCK* bucket = malloc(sizeof(BCK)); [L1005] bucket->data = 0 [L1006] bucket->list = ((void*)0) [L1008] bucket->next = malloc(sizeof(BCK)) [L1009] EXPR bucket->next [L1009] BCK* bcki = bucket->next; [L1010] bcki->data = 1 [L1011] bcki->list = ((void*)0) [L1013] bcki->next = malloc(sizeof(BCK)) [L1014] EXPR bcki->next [L1014] bcki = bcki->next [L1015] bcki->data = 2 [L1016] bcki->list = ((void*)0) [L1017] bcki->next = ((void*)0) [L1019] struct TSLL* item = ((void*)0); [L1020] struct TSLL* itr = ((void*)0); VAL [bucket={-3:0}] [L1021] COND TRUE __VERIFIER_nondet_int() [L1023] item = malloc(sizeof(SLL)) [L1024] item->next = ((void*)0) [L1025] COND TRUE __VERIFIER_nondet_int() [L1026] item->data = 0 [L1032] bcki = bucket VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1034] COND FALSE !(!(bcki != ((void*)0))) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1035] COND FALSE !(!(item != ((void*)0))) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1036] EXPR bcki->data [L1036] EXPR item->data [L1036] COND FALSE !(bcki->data != item->data) [L1038] COND FALSE !(!(bcki != ((void*)0))) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1040] EXPR bcki->list [L1040] COND TRUE bcki->list == ((void*)0) [L1041] bcki->list = item [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1052] bcki = bucket VAL [bcki={-3:0}] [L1053] COND TRUE bcki != ((void*)0) [L1055] EXPR bcki->list [L1055] item = bcki->list [L1056] bcki->list = ((void*)0) [L1057] COND TRUE item != ((void*)0) [L1059] itr = item [L1060] EXPR item->next [L1060] item = item->next [L1061] EXPR itr->data [L1061] EXPR bcki->data [L1061] COND TRUE !(itr->data != bcki->data) [L1061] reach_error() VAL [bcki={-3:0}, item={0:0}, itr={-4:0}] - UnprovableResult [Line: 1034]: 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: 1035]: 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. - UnprovableResult [Line: 1064]: 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, 44 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 23.4s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1129 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1129 mSDsluCounter, 1998 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 435 IncrementalHoareTripleChecker+Unchecked, 1668 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2248 IncrementalHoareTripleChecker+Invalid, 2804 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 330 mSDtfsCounter, 2248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 156 SyntacticMatches, 3 SemanticMatches, 150 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=10, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 260 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 325 ConstructedInterpolants, 36 QuantifiedInterpolants, 11081 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1396 ConjunctsInSsa, 307 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 32/105 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-11 19:33:34,670 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