./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 3289d67d 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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:33:01,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:33:02,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 06:33:02,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:33:02,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:33:02,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:33:02,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:33:02,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:33:02,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:33:02,085 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:33:02,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:33:02,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:33:02,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:33:02,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:33:02,091 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:33:02,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:33:02,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:33:02,092 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:33:02,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 06:33:02,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:33:02,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:33:02,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:33:02,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:33:02,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:33:02,096 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:33:02,096 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:33:02,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:33:02,097 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:33:02,097 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:33:02,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:33:02,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:33:02,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:33:02,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:33:02,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:33:02,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:33:02,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:33:02,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 06:33:02,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 06:33:02,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:33:02,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:33:02,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:33:02,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:33:02,100 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-16 06:33:02,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:33:02,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:33:02,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:33:02,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:33:02,384 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:33:02,386 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-16 06:33:03,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:33:04,092 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:33:04,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i [2024-11-16 06:33:04,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e48ffabad/d539b2da5b17454e8cc0cd15f775a938/FLAG88c05f236 [2024-11-16 06:33:04,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e48ffabad/d539b2da5b17454e8cc0cd15f775a938 [2024-11-16 06:33:04,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:33:04,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:33:04,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:33:04,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:33:04,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:33:04,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:33:04" (1/1) ... [2024-11-16 06:33:04,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ef615b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:33:04, skipping insertion in model container [2024-11-16 06:33:04,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:33:04" (1/1) ... [2024-11-16 06:33:04,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:33:04,484 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-16 06:33:04,490 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-16 06:33:04,493 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-16 06:33:04,498 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-16 06:33:04,500 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-16 06:33:04,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:33:04,517 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:33:04,553 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-16 06:33:04,554 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-16 06:33:04,556 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-16 06:33:04,558 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-16 06:33:04,559 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-16 06:33:04,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:33:04,596 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:33:04,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:33:04 WrapperNode [2024-11-16 06:33:04,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:33:04,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:33:04,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:33:04,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:33:04,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:33:04" (1/1) ... [2024-11-16 06:33:04,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:33:04" (1/1) ... [2024-11-16 06:33:04,642 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 145 [2024-11-16 06:33:04,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:33:04,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:33:04,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:33:04,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:33:04,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:33:04" (1/1) ... [2024-11-16 06:33:04,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:33:04" (1/1) ... [2024-11-16 06:33:04,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:33:04" (1/1) ... [2024-11-16 06:33:04,678 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-16 06:33:04,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:33:04" (1/1) ... [2024-11-16 06:33:04,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:33:04" (1/1) ... [2024-11-16 06:33:04,693 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:33:04" (1/1) ... [2024-11-16 06:33:04,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:33:04" (1/1) ... [2024-11-16 06:33:04,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:33:04" (1/1) ... [2024-11-16 06:33:04,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:33:04" (1/1) ... [2024-11-16 06:33:04,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:33:04,709 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:33:04,709 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:33:04,709 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:33:04,710 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:33:04" (1/1) ... [2024-11-16 06:33:04,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:33:04,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:33:04,751 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-16 06:33:04,754 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-16 06:33:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 06:33:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 06:33:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 06:33:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 06:33:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 06:33:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:33:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 06:33:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 06:33:04,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 06:33:04,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 06:33:04,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 06:33:04,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 06:33:04,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 06:33:04,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:33:04,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:33:04,927 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:33:04,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:33:05,203 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-16 06:33:05,204 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:33:05,218 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:33:05,218 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:33:05,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:33:05 BoogieIcfgContainer [2024-11-16 06:33:05,219 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:33:05,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:33:05,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:33:05,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:33:05,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:33:04" (1/3) ... [2024-11-16 06:33:05,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455858d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:33:05, skipping insertion in model container [2024-11-16 06:33:05,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:33:04" (2/3) ... [2024-11-16 06:33:05,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455858d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:33:05, skipping insertion in model container [2024-11-16 06:33:05,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:33:05" (3/3) ... [2024-11-16 06:33:05,227 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.i [2024-11-16 06:33:05,241 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:33:05,241 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-11-16 06:33:05,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:33:05,297 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;@7027fa4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:33:05,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-16 06:33:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 54 states have internal predecessors, (82), 0 states have call successors, (0), 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-16 06:33:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 06:33:05,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:33:05,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:33:05,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 06:33:05,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:33:05,312 INFO L85 PathProgramCache]: Analyzing trace with hash -169011890, now seen corresponding path program 1 times [2024-11-16 06:33:05,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:33:05,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942289207] [2024-11-16 06:33:05,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:05,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:33:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:05,882 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-16 06:33:05,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:33:05,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942289207] [2024-11-16 06:33:05,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942289207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:33:05,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:33:05,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:33:05,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118179341] [2024-11-16 06:33:05,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:33:05,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:33:05,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:33:05,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:33:05,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:33:05,917 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 54 states have internal predecessors, (82), 0 states have call successors, (0), 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.25) internal successors, (9), 4 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-16 06:33:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:33:06,021 INFO L93 Difference]: Finished difference Result 124 states and 194 transitions. [2024-11-16 06:33:06,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:33:06,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-16 06:33:06,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:33:06,036 INFO L225 Difference]: With dead ends: 124 [2024-11-16 06:33:06,036 INFO L226 Difference]: Without dead ends: 67 [2024-11-16 06:33:06,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:33:06,045 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 66 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 94 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-16 06:33:06,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 94 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:33:06,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-16 06:33:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2024-11-16 06:33:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 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-16 06:33:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-11-16 06:33:06,086 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 9 [2024-11-16 06:33:06,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:33:06,087 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-11-16 06:33:06,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-16 06:33:06,087 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2024-11-16 06:33:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 06:33:06,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:33:06,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:33:06,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 06:33:06,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 06:33:06,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:33:06,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1956695240, now seen corresponding path program 1 times [2024-11-16 06:33:06,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:33:06,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302791511] [2024-11-16 06:33:06,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:06,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:33:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:06,214 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-16 06:33:06,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:33:06,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302791511] [2024-11-16 06:33:06,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302791511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:33:06,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:33:06,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:33:06,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318793844] [2024-11-16 06:33:06,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:33:06,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:33:06,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:33:06,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:33:06,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:33:06,219 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:33:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:33:06,256 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-16 06:33:06,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:33:06,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-16 06:33:06,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:33:06,258 INFO L225 Difference]: With dead ends: 50 [2024-11-16 06:33:06,259 INFO L226 Difference]: Without dead ends: 48 [2024-11-16 06:33:06,259 INFO L431 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-16 06:33:06,261 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 5 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 82 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-16 06:33:06,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 82 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:33:06,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-16 06:33:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-11-16 06:33:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 43 states have (on average 1.255813953488372) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 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-16 06:33:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-16 06:33:06,273 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 12 [2024-11-16 06:33:06,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:33:06,274 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-16 06:33:06,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:33:06,274 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2024-11-16 06:33:06,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 06:33:06,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:33:06,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:33:06,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 06:33:06,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 06:33:06,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:33:06,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1956764752, now seen corresponding path program 1 times [2024-11-16 06:33:06,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:33:06,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342775611] [2024-11-16 06:33:06,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:06,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:33:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:06,947 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-16 06:33:06,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:33:06,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342775611] [2024-11-16 06:33:06,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342775611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:33:06,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:33:06,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:33:06,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738879] [2024-11-16 06:33:06,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:33:06,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:33:06,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:33:06,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:33:06,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:33:06,953 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:33:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:33:07,111 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2024-11-16 06:33:07,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 06:33:07,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-16 06:33:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:33:07,114 INFO L225 Difference]: With dead ends: 71 [2024-11-16 06:33:07,114 INFO L226 Difference]: Without dead ends: 57 [2024-11-16 06:33:07,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 06:33:07,117 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 117 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-16 06:33:07,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 117 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:33:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-16 06:33:07,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2024-11-16 06:33:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.24) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 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-16 06:33:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-11-16 06:33:07,127 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 12 [2024-11-16 06:33:07,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:33:07,127 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-11-16 06:33:07,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:33:07,128 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-11-16 06:33:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 06:33:07,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:33:07,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:33:07,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 06:33:07,129 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 06:33:07,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:33:07,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1330672262, now seen corresponding path program 1 times [2024-11-16 06:33:07,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:33:07,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922243225] [2024-11-16 06:33:07,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:07,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:33:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:07,199 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-16 06:33:07,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:33:07,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922243225] [2024-11-16 06:33:07,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922243225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:33:07,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:33:07,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:33:07,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363541340] [2024-11-16 06:33:07,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:33:07,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:33:07,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:33:07,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:33:07,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:33:07,203 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:33:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:33:07,241 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-11-16 06:33:07,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:33:07,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-16 06:33:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:33:07,242 INFO L225 Difference]: With dead ends: 53 [2024-11-16 06:33:07,242 INFO L226 Difference]: Without dead ends: 51 [2024-11-16 06:33:07,244 INFO L431 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-16 06:33:07,244 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 18 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 56 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-16 06:33:07,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 56 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:33:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-16 06:33:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-16 06:33:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 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-16 06:33:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2024-11-16 06:33:07,255 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 12 [2024-11-16 06:33:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:33:07,255 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2024-11-16 06:33:07,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:33:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2024-11-16 06:33:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-16 06:33:07,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:33:07,257 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:33:07,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 06:33:07,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 06:33:07,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:33:07,258 INFO L85 PathProgramCache]: Analyzing trace with hash 261708195, now seen corresponding path program 1 times [2024-11-16 06:33:07,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:33:07,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121377491] [2024-11-16 06:33:07,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:07,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:33:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:07,621 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-16 06:33:07,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:33:07,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121377491] [2024-11-16 06:33:07,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121377491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:33:07,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182374045] [2024-11-16 06:33:07,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:07,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:33:07,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:33:07,625 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-16 06:33:07,629 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-16 06:33:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:07,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-16 06:33:07,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:33:07,945 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-16 06:33:07,983 INFO L349 Elim1Store]: treesize reduction 62, result has 7.5 percent of original size [2024-11-16 06:33:07,984 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 95 treesize of output 70 [2024-11-16 06:33:07,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:08,019 INFO L349 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2024-11-16 06:33:08,019 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 51 treesize of output 24 [2024-11-16 06:33:08,041 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 19 treesize of output 23 [2024-11-16 06:33:08,055 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-11-16 06:33:08,056 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 1 case distinctions, treesize of input 56 treesize of output 1 [2024-11-16 06:33:08,142 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-16 06:33:08,142 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-16 06:33:08,149 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 25 treesize of output 18 [2024-11-16 06:33:08,191 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 25 treesize of output 18 [2024-11-16 06:33:08,312 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-16 06:33:08,320 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-16 06:33:08,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:33:08,369 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_386 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))) is different from false [2024-11-16 06:33:08,389 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_26| Int) (v_ArrVal_386 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_26|) 0)) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_26| v_ArrVal_386) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))) is different from false [2024-11-16 06:33:08,434 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-16 06:33:08,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182374045] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:33:08,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:33:08,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-16 06:33:08,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431932352] [2024-11-16 06:33:08,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:33:08,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 06:33:08,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:33:08,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 06:33:08,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=83, Unknown=2, NotChecked=38, Total=156 [2024-11-16 06:33:08,437 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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-16 06:33:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:33:08,768 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2024-11-16 06:33:08,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 06:33:08,769 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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-16 06:33:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:33:08,770 INFO L225 Difference]: With dead ends: 119 [2024-11-16 06:33:08,770 INFO L226 Difference]: Without dead ends: 117 [2024-11-16 06:33:08,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=164, Unknown=2, NotChecked=58, Total=306 [2024-11-16 06:33:08,772 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 160 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:33:08,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 203 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 111 Invalid, 0 Unknown, 193 Unchecked, 0.2s Time] [2024-11-16 06:33:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-16 06:33:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 69. [2024-11-16 06:33:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:33:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2024-11-16 06:33:08,795 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 19 [2024-11-16 06:33:08,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:33:08,796 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2024-11-16 06:33:08,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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-16 06:33:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2024-11-16 06:33:08,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-16 06:33:08,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:33:08,797 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:33:08,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 06:33:09,001 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-16 06:33:09,002 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 06:33:09,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:33:09,003 INFO L85 PathProgramCache]: Analyzing trace with hash 389551414, now seen corresponding path program 1 times [2024-11-16 06:33:09,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:33:09,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567744704] [2024-11-16 06:33:09,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:09,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:33:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:33:09,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:33:09,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567744704] [2024-11-16 06:33:09,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567744704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:33:09,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245680681] [2024-11-16 06:33:09,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:09,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:33:09,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:33:09,892 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-16 06:33:09,894 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-16 06:33:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:10,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-16 06:33:10,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:33:10,097 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-16 06:33:10,109 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-16 06:33:10,160 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2024-11-16 06:33:10,161 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 74 treesize of output 68 [2024-11-16 06:33:10,171 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-16 06:33:10,172 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-16 06:33:10,185 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-16 06:33:10,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:10,196 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 48 treesize of output 50 [2024-11-16 06:33:10,201 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-16 06:33:10,215 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-16 06:33:10,427 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-16 06:33:10,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 57 [2024-11-16 06:33:10,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:10,443 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 63 treesize of output 67 [2024-11-16 06:33:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:33:10,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:33:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:33:10,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245680681] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:33:10,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:33:10,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2024-11-16 06:33:10,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904633225] [2024-11-16 06:33:10,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:33:10,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 06:33:10,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:33:10,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 06:33:10,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-16 06:33:10,982 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 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-16 06:33:11,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:33:11,468 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2024-11-16 06:33:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 06:33:11,469 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 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 20 [2024-11-16 06:33:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:33:11,469 INFO L225 Difference]: With dead ends: 111 [2024-11-16 06:33:11,470 INFO L226 Difference]: Without dead ends: 97 [2024-11-16 06:33:11,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-11-16 06:33:11,471 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 71 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 06:33:11,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 291 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 06:33:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-16 06:33:11,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 77. [2024-11-16 06:33:11,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 76 states have internal predecessors, (91), 0 states have call successors, (0), 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-16 06:33:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2024-11-16 06:33:11,490 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 20 [2024-11-16 06:33:11,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:33:11,491 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2024-11-16 06:33:11,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 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-16 06:33:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2024-11-16 06:33:11,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-16 06:33:11,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:33:11,492 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:33:11,509 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-16 06:33:11,692 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-16 06:33:11,693 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-16 06:33:11,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:33:11,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1838542172, now seen corresponding path program 2 times [2024-11-16 06:33:11,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:33:11,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819567472] [2024-11-16 06:33:11,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:11,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:33:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:12,227 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-16 06:33:12,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:33:12,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819567472] [2024-11-16 06:33:12,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819567472] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:33:12,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74348245] [2024-11-16 06:33:12,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:33:12,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:33:12,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:33:12,230 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-16 06:33:12,231 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-16 06:33:12,586 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 06:33:12,586 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:33:12,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-16 06:33:12,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:33:12,622 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-16 06:33:12,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:12,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:12,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:12,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 25 treesize of output 17 [2024-11-16 06:33:12,649 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 43 treesize of output 22 [2024-11-16 06:33:12,657 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 22 treesize of output 7 [2024-11-16 06:33:12,716 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-16 06:33:12,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-16 06:33:12,725 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-16 06:33:12,753 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-16 06:33:12,879 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-16 06:33:12,879 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:33:12,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74348245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:33:12,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 06:33:12,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-16 06:33:12,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884383619] [2024-11-16 06:33:12,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:33:12,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 06:33:12,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:33:12,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 06:33:12,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-16 06:33:12,881 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-16 06:33:13,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:33:13,156 INFO L93 Difference]: Finished difference Result 171 states and 205 transitions. [2024-11-16 06:33:13,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 06:33:13,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-16 06:33:13,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:33:13,158 INFO L225 Difference]: With dead ends: 171 [2024-11-16 06:33:13,158 INFO L226 Difference]: Without dead ends: 129 [2024-11-16 06:33:13,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-16 06:33:13,159 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 100 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:33:13,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 167 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:33:13,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-16 06:33:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2024-11-16 06:33:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 93 states have internal predecessors, (111), 0 states have call successors, (0), 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-16 06:33:13,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2024-11-16 06:33:13,183 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 21 [2024-11-16 06:33:13,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:33:13,183 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2024-11-16 06:33:13,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-16 06:33:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2024-11-16 06:33:13,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 06:33:13,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:33:13,185 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:33:13,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 06:33:13,387 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-16 06:33:13,388 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-16 06:33:13,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:33:13,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1132816048, now seen corresponding path program 1 times [2024-11-16 06:33:13,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:33:13,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362743074] [2024-11-16 06:33:13,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:13,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:33:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:13,857 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-16 06:33:13,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:33:13,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362743074] [2024-11-16 06:33:13,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362743074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:33:13,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163991782] [2024-11-16 06:33:13,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:13,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:33:13,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:33:13,860 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-16 06:33:13,861 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-16 06:33:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:14,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-16 06:33:14,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:33:14,044 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 24 treesize of output 28 [2024-11-16 06:33:14,068 INFO L349 Elim1Store]: treesize reduction 62, result has 7.5 percent of original size [2024-11-16 06:33:14,068 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 140 treesize of output 113 [2024-11-16 06:33:14,076 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 36 treesize of output 24 [2024-11-16 06:33:14,084 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 34 treesize of output 11 [2024-11-16 06:33:14,091 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-16 06:33:14,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:14,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:14,098 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 29 treesize of output 11 [2024-11-16 06:33:14,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:14,120 INFO L349 Elim1Store]: treesize reduction 39, result has 11.4 percent of original size [2024-11-16 06:33:14,121 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-16 06:33:14,213 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-16 06:33:14,213 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 16 treesize of output 15 [2024-11-16 06:33:14,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:14,228 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 0 case distinctions, treesize of input 45 treesize of output 34 [2024-11-16 06:33:14,254 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-11-16 06:33:14,254 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 25 treesize of output 29 [2024-11-16 06:33:14,262 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-16 06:33:14,318 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 25 treesize of output 24 [2024-11-16 06:33:14,323 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 36 treesize of output 27 [2024-11-16 06:33:14,337 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 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-16 06:33:14,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-16 06:33:14,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 7 treesize of output 3 [2024-11-16 06:33:14,612 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-16 06:33:14,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:33:14,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:33:14,746 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 31 treesize of output 35 [2024-11-16 06:33:14,828 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-16 06:33:14,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163991782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:33:14,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:33:14,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-11-16 06:33:14,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38227934] [2024-11-16 06:33:14,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:33:14,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 06:33:14,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:33:14,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 06:33:14,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=326, Unknown=8, NotChecked=0, Total=380 [2024-11-16 06:33:14,829 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 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-16 06:33:16,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:33:16,006 INFO L93 Difference]: Finished difference Result 266 states and 320 transitions. [2024-11-16 06:33:16,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 06:33:16,006 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 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 22 [2024-11-16 06:33:16,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:33:16,007 INFO L225 Difference]: With dead ends: 266 [2024-11-16 06:33:16,007 INFO L226 Difference]: Without dead ends: 224 [2024-11-16 06:33:16,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=758, Unknown=9, NotChecked=0, Total=992 [2024-11-16 06:33:16,008 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 349 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 06:33:16,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 474 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 06:33:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-16 06:33:16,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 159. [2024-11-16 06:33:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 157 states have (on average 1.2229299363057324) internal successors, (192), 158 states have internal predecessors, (192), 0 states have call successors, (0), 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-16 06:33:16,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 192 transitions. [2024-11-16 06:33:16,032 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 192 transitions. Word has length 22 [2024-11-16 06:33:16,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:33:16,033 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 192 transitions. [2024-11-16 06:33:16,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 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-16 06:33:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 192 transitions. [2024-11-16 06:33:16,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-16 06:33:16,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:33:16,034 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:33:16,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-16 06:33:16,238 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-16 06:33:16,239 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 06:33:16,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:33:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1503952082, now seen corresponding path program 1 times [2024-11-16 06:33:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:33:16,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024219485] [2024-11-16 06:33:16,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:16,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:33:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:16,939 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-16 06:33:16,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:33:16,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024219485] [2024-11-16 06:33:16,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024219485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:33:16,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573378343] [2024-11-16 06:33:16,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:16,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:33:16,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:33:16,942 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-16 06:33:16,945 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-16 06:33:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:17,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-16 06:33:17,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:33:17,156 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-16 06:33:17,166 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-16 06:33:17,175 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 21 treesize of output 26 [2024-11-16 06:33:17,198 INFO L349 Elim1Store]: treesize reduction 74, result has 6.3 percent of original size [2024-11-16 06:33:17,199 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 201 treesize of output 170 [2024-11-16 06:33:17,228 INFO L349 Elim1Store]: treesize reduction 124, result has 10.8 percent of original size [2024-11-16 06:33:17,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 70 [2024-11-16 06:33:17,253 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 15 [2024-11-16 06:33:17,260 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 10 treesize of output 8 [2024-11-16 06:33:17,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:17,266 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 45 treesize of output 26 [2024-11-16 06:33:17,279 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-16 06:33:17,295 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2024-11-16 06:33:17,295 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 101 treesize of output 77 [2024-11-16 06:33:17,301 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-16 06:33:17,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:17,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:17,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:17,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 30 [2024-11-16 06:33:17,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:17,401 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-16 06:33:17,402 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 103 treesize of output 76 [2024-11-16 06:33:17,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:17,426 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-11-16 06:33:17,427 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-16 06:33:17,444 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 24 treesize of output 19 [2024-11-16 06:33:17,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 29 treesize of output 28 [2024-11-16 06:33:17,543 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-16 06:33:17,543 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 101 treesize of output 74 [2024-11-16 06:33:17,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:17,555 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 38 treesize of output 30 [2024-11-16 06:33:18,010 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-16 06:33:18,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 51 [2024-11-16 06:33:18,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-16 06:33:18,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-16 06:33:18,072 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:33:18,183 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_994 (Array Int Int))) (= 2 (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_993)) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_994))) (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-16 06:33:18,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:33:18,200 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-16 06:33:18,281 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-16 06:33:18,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573378343] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:33:18,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:33:18,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2024-11-16 06:33:18,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260472477] [2024-11-16 06:33:18,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:33:18,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-16 06:33:18,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:33:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-16 06:33:18,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2024-11-16 06:33:18,283 INFO L87 Difference]: Start difference. First operand 159 states and 192 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 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-16 06:33:19,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:33:19,386 INFO L93 Difference]: Finished difference Result 423 states and 512 transitions. [2024-11-16 06:33:19,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 06:33:19,386 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 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 24 [2024-11-16 06:33:19,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:33:19,388 INFO L225 Difference]: With dead ends: 423 [2024-11-16 06:33:19,388 INFO L226 Difference]: Without dead ends: 381 [2024-11-16 06:33:19,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=222, Invalid=903, Unknown=1, NotChecked=64, Total=1190 [2024-11-16 06:33:19,390 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 333 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 06:33:19,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 473 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 505 Invalid, 0 Unknown, 154 Unchecked, 0.5s Time] [2024-11-16 06:33:19,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-16 06:33:19,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 237. [2024-11-16 06:33:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 235 states have (on average 1.2382978723404254) internal successors, (291), 236 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:33:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 291 transitions. [2024-11-16 06:33:19,432 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 291 transitions. Word has length 24 [2024-11-16 06:33:19,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:33:19,433 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 291 transitions. [2024-11-16 06:33:19,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 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-16 06:33:19,433 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 291 transitions. [2024-11-16 06:33:19,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 06:33:19,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:33:19,434 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:33:19,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 06:33:19,634 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-16 06:33:19,635 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 06:33:19,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:33:19,635 INFO L85 PathProgramCache]: Analyzing trace with hash -242087908, now seen corresponding path program 2 times [2024-11-16 06:33:19,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:33:19,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451885531] [2024-11-16 06:33:19,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:19,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:33:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:33:20,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:33:20,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451885531] [2024-11-16 06:33:20,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451885531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:33:20,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19900742] [2024-11-16 06:33:20,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:33:20,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:33:20,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:33:20,640 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-16 06:33:20,641 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-16 06:33:20,969 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 06:33:20,969 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:33:20,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-16 06:33:20,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:33:20,996 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-16 06:33:21,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 36 treesize of output 40 [2024-11-16 06:33:21,035 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2024-11-16 06:33:21,036 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-16 06:33:21,043 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-16 06:33:21,057 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-16 06:33:21,057 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-16 06:33:21,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:21,068 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 48 treesize of output 50 [2024-11-16 06:33:21,079 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-16 06:33:21,087 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-16 06:33:21,096 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 31 treesize of output 1 [2024-11-16 06:33:21,308 INFO L349 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2024-11-16 06:33:21,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 118 treesize of output 73 [2024-11-16 06:33:21,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:21,318 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 63 treesize of output 67 [2024-11-16 06:33:21,625 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-16 06:33:21,625 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 114 treesize of output 80 [2024-11-16 06:33:21,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:21,643 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 63 treesize of output 67 [2024-11-16 06:33:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:33:22,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:33:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:33:26,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19900742] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:33:26,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:33:26,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2024-11-16 06:33:26,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160298251] [2024-11-16 06:33:26,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:33:26,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-16 06:33:26,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:33:26,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-16 06:33:26,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=467, Unknown=1, NotChecked=0, Total=552 [2024-11-16 06:33:26,376 INFO L87 Difference]: Start difference. First operand 237 states and 291 transitions. Second operand has 24 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 24 states have internal predecessors, (74), 0 states have call successors, (0), 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-16 06:33:27,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:33:27,243 INFO L93 Difference]: Finished difference Result 265 states and 321 transitions. [2024-11-16 06:33:27,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 06:33:27,243 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 24 states have internal predecessors, (74), 0 states have call successors, (0), 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 28 [2024-11-16 06:33:27,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:33:27,245 INFO L225 Difference]: With dead ends: 265 [2024-11-16 06:33:27,245 INFO L226 Difference]: Without dead ends: 251 [2024-11-16 06:33:27,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=135, Invalid=676, Unknown=1, NotChecked=0, Total=812 [2024-11-16 06:33:27,246 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 51 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 06:33:27,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 452 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 06:33:27,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-16 06:33:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2024-11-16 06:33:27,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 243 states have (on average 1.2304526748971194) internal successors, (299), 244 states have internal predecessors, (299), 0 states have call successors, (0), 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-16 06:33:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 299 transitions. [2024-11-16 06:33:27,278 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 299 transitions. Word has length 28 [2024-11-16 06:33:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:33:27,278 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 299 transitions. [2024-11-16 06:33:27,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 24 states have internal predecessors, (74), 0 states have call successors, (0), 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-16 06:33:27,278 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 299 transitions. [2024-11-16 06:33:27,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-16 06:33:27,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:33:27,279 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-16 06:33:27,292 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-16 06:33:27,479 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-16 06:33:27,480 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 06:33:27,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:33:27,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1481774332, now seen corresponding path program 1 times [2024-11-16 06:33:27,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:33:27,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903715655] [2024-11-16 06:33:27,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:27,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:33:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 06:33:27,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 06:33:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 06:33:27,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 06:33:27,543 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 06:33:27,544 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-16 06:33:27,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-16 06:33:27,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-11-16 06:33:27,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-11-16 06:33:27,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-16 06:33:27,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 06:33:27,549 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:33:27,581 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 06:33:27,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:33:27 BoogieIcfgContainer [2024-11-16 06:33:27,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 06:33:27,584 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 06:33:27,584 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 06:33:27,584 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 06:33:27,584 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:33:05" (3/4) ... [2024-11-16 06:33:27,585 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 06:33:27,636 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 06:33:27,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 06:33:27,637 INFO L158 Benchmark]: Toolchain (without parser) took 23510.95ms. Allocated memory was 161.5MB in the beginning and 478.2MB in the end (delta: 316.7MB). Free memory was 104.5MB in the beginning and 310.9MB in the end (delta: -206.5MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. [2024-11-16 06:33:27,637 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 161.5MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 06:33:27,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.52ms. Allocated memory is still 161.5MB. Free memory was 103.8MB in the beginning and 82.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 06:33:27,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.43ms. Allocated memory is still 161.5MB. Free memory was 82.9MB in the beginning and 80.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 06:33:27,638 INFO L158 Benchmark]: Boogie Preprocessor took 64.06ms. Allocated memory is still 161.5MB. Free memory was 80.8MB in the beginning and 78.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 06:33:27,638 INFO L158 Benchmark]: IcfgBuilder took 510.49ms. Allocated memory is still 161.5MB. Free memory was 77.8MB in the beginning and 58.4MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 06:33:27,638 INFO L158 Benchmark]: TraceAbstraction took 22362.43ms. Allocated memory was 161.5MB in the beginning and 478.2MB in the end (delta: 316.7MB). Free memory was 57.7MB in the beginning and 313.0MB in the end (delta: -255.3MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. [2024-11-16 06:33:27,638 INFO L158 Benchmark]: Witness Printer took 52.79ms. Allocated memory is still 478.2MB. Free memory was 313.0MB in the beginning and 310.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 06:33:27,639 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.20ms. Allocated memory is still 161.5MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.52ms. Allocated memory is still 161.5MB. Free memory was 103.8MB in the beginning and 82.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.43ms. Allocated memory is still 161.5MB. Free memory was 82.9MB in the beginning and 80.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.06ms. Allocated memory is still 161.5MB. Free memory was 80.8MB in the beginning and 78.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 510.49ms. Allocated memory is still 161.5MB. Free memory was 77.8MB in the beginning and 58.4MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22362.43ms. Allocated memory was 161.5MB in the beginning and 478.2MB in the end (delta: 316.7MB). Free memory was 57.7MB in the beginning and 313.0MB in the end (delta: -255.3MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. * Witness Printer took 52.79ms. Allocated memory is still 478.2MB. Free memory was 313.0MB in the beginning and 310.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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}] [L1034] COND FALSE !(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}] [L1035] COND FALSE !(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}] [L1038] COND FALSE !(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: 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. - 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: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 55 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1175 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1175 mSDsluCounter, 2409 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 347 IncrementalHoareTripleChecker+Unchecked, 1989 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1933 IncrementalHoareTripleChecker+Invalid, 2387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 420 mSDtfsCounter, 1933 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred in iteration=10, InterpolantAutomatonStates: 90, 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, 343 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 342 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 405 ConstructedInterpolants, 39 QuantifiedInterpolants, 13749 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1421 ConjunctsInSsa, 308 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 32/132 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-16 06:33:27,679 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