./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 01:54:13,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:54:13,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:54:13,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:54:13,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:54:13,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:54:13,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:54:13,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:54:13,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:54:13,318 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:54:13,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:54:13,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:54:13,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:54:13,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:54:13,320 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:54:13,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:54:13,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:54:13,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:54:13,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:54:13,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:54:13,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:54:13,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:54:13,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:54:13,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:54:13,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:54:13,331 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:54:13,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:54:13,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:54:13,332 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:54:13,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:54:13,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:54:13,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:54:13,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:54:13,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:54:13,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:54:13,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:54:13,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:54:13,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:54:13,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:54:13,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:54:13,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:54:13,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:54:13,336 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2024-10-14 01:54:13,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:54:13,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:54:13,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:54:13,604 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:54:13,604 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:54:13,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-10-14 01:54:15,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:54:15,308 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:54:15,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-10-14 01:54:15,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c01305e/d460bb8088b049b7a2dbb23b94a05978/FLAGb70131b27 [2024-10-14 01:54:15,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c01305e/d460bb8088b049b7a2dbb23b94a05978 [2024-10-14 01:54:15,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:54:15,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:54:15,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:54:15,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:54:15,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:54:15,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:54:15" (1/1) ... [2024-10-14 01:54:15,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bda755d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:15, skipping insertion in model container [2024-10-14 01:54:15,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:54:15" (1/1) ... [2024-10-14 01:54:15,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:54:15,709 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2024-10-14 01:54:15,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:54:15,732 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:54:15,777 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2024-10-14 01:54:15,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:54:15,811 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:54:15,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:15 WrapperNode [2024-10-14 01:54:15,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:54:15,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:54:15,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:54:15,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:54:15,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:15" (1/1) ... [2024-10-14 01:54:15,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:15" (1/1) ... [2024-10-14 01:54:15,860 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2024-10-14 01:54:15,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:54:15,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:54:15,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:54:15,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:54:15,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:15" (1/1) ... [2024-10-14 01:54:15,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:15" (1/1) ... [2024-10-14 01:54:15,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:15" (1/1) ... [2024-10-14 01:54:15,918 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 9, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2024-10-14 01:54:15,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:15" (1/1) ... [2024-10-14 01:54:15,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:15" (1/1) ... [2024-10-14 01:54:15,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:15" (1/1) ... [2024-10-14 01:54:15,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:15" (1/1) ... [2024-10-14 01:54:15,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:15" (1/1) ... [2024-10-14 01:54:15,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:15" (1/1) ... [2024-10-14 01:54:15,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:54:15,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:54:15,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:54:15,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:54:15,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:15" (1/1) ... [2024-10-14 01:54:15,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:54:15,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:16,015 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-10-14 01:54:16,018 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-10-14 01:54:16,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 01:54:16,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 01:54:16,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 01:54:16,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 01:54:16,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 01:54:16,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 01:54:16,063 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-14 01:54:16,064 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-14 01:54:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 01:54:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:54:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 01:54:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 01:54:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 01:54:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 01:54:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 01:54:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 01:54:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 01:54:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 01:54:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 01:54:16,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 01:54:16,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 01:54:16,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:54:16,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 01:54:16,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 01:54:16,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:54:16,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:54:16,190 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:54:16,193 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:54:16,418 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-14 01:54:16,418 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:54:16,461 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:54:16,462 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 01:54:16,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:54:16 BoogieIcfgContainer [2024-10-14 01:54:16,462 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:54:16,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:54:16,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:54:16,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:54:16,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:54:15" (1/3) ... [2024-10-14 01:54:16,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430c366c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:54:16, skipping insertion in model container [2024-10-14 01:54:16,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:15" (2/3) ... [2024-10-14 01:54:16,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430c366c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:54:16, skipping insertion in model container [2024-10-14 01:54:16,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:54:16" (3/3) ... [2024-10-14 01:54:16,476 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2024-10-14 01:54:16,493 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:54:16,493 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:54:16,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:54:16,569 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;@7a82c13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:54:16,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:54:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 01:54:16,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:16,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:16,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:16,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:16,589 INFO L85 PathProgramCache]: Analyzing trace with hash -245179890, now seen corresponding path program 1 times [2024-10-14 01:54:16,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:16,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907015463] [2024-10-14 01:54:16,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:16,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:16,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 01:54:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:54:16,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:16,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907015463] [2024-10-14 01:54:16,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907015463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:54:16,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:54:16,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 01:54:16,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23959870] [2024-10-14 01:54:16,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:54:16,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 01:54:16,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:16,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 01:54:16,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:54:16,919 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 01:54:16,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:16,974 INFO L93 Difference]: Finished difference Result 42 states and 63 transitions. [2024-10-14 01:54:16,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 01:54:16,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-14 01:54:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:16,983 INFO L225 Difference]: With dead ends: 42 [2024-10-14 01:54:16,984 INFO L226 Difference]: Without dead ends: 18 [2024-10-14 01:54:16,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:54:16,993 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:16,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:54:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-14 01:54:17,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-14 01:54:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2024-10-14 01:54:17,037 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 14 [2024-10-14 01:54:17,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:17,038 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-10-14 01:54:17,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 01:54:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2024-10-14 01:54:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 01:54:17,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:17,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:17,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:54:17,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:17,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1987527562, now seen corresponding path program 1 times [2024-10-14 01:54:17,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:17,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006556534] [2024-10-14 01:54:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:17,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:17,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 01:54:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:54:17,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:17,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006556534] [2024-10-14 01:54:17,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006556534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:54:17,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:54:17,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:54:17,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166795021] [2024-10-14 01:54:17,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:54:17,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:54:17,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:17,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:54:17,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:54:17,264 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 01:54:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:17,308 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2024-10-14 01:54:17,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:54:17,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-14 01:54:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:17,310 INFO L225 Difference]: With dead ends: 35 [2024-10-14 01:54:17,311 INFO L226 Difference]: Without dead ends: 21 [2024-10-14 01:54:17,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:54:17,313 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:17,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:54:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-14 01:54:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-10-14 01:54:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2024-10-14 01:54:17,326 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 14 [2024-10-14 01:54:17,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:17,326 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-10-14 01:54:17,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 01:54:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2024-10-14 01:54:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 01:54:17,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:17,328 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:17,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 01:54:17,328 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:17,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:17,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1535308516, now seen corresponding path program 1 times [2024-10-14 01:54:17,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:17,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253289908] [2024-10-14 01:54:17,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:17,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:17,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:54:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:17,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 01:54:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:17,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:54:17,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:17,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253289908] [2024-10-14 01:54:17,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253289908] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:17,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251116257] [2024-10-14 01:54:17,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:17,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:17,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:17,599 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-10-14 01:54:17,600 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-10-14 01:54:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:17,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 01:54:17,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:54:17,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:54:17,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251116257] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:54:17,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:54:17,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-10-14 01:54:17,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834654733] [2024-10-14 01:54:17,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:54:17,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 01:54:17,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:17,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 01:54:17,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:54:17,835 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 01:54:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:17,882 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2024-10-14 01:54:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 01:54:17,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2024-10-14 01:54:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:17,884 INFO L225 Difference]: With dead ends: 36 [2024-10-14 01:54:17,884 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 01:54:17,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:54:17,885 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:17,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:54:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 01:54:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-14 01:54:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:54:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-14 01:54:17,891 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 20 [2024-10-14 01:54:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:17,891 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-14 01:54:17,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 01:54:17,892 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-10-14 01:54:17,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 01:54:17,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:17,895 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:17,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 01:54:18,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:18,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:18,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:18,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1788207406, now seen corresponding path program 2 times [2024-10-14 01:54:18,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:18,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859782166] [2024-10-14 01:54:18,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:18,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:18,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:54:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:18,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:54:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:18,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 01:54:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 01:54:18,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:18,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859782166] [2024-10-14 01:54:18,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859782166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:54:18,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:54:18,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:54:18,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695199188] [2024-10-14 01:54:18,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:54:18,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:54:18,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:18,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:54:18,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:54:18,265 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 01:54:18,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:18,303 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-10-14 01:54:18,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:54:18,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-10-14 01:54:18,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:18,305 INFO L225 Difference]: With dead ends: 30 [2024-10-14 01:54:18,305 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 01:54:18,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:54:18,306 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:18,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:54:18,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 01:54:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-14 01:54:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:54:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-14 01:54:18,312 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 26 [2024-10-14 01:54:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:18,313 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-14 01:54:18,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 01:54:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-14 01:54:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 01:54:18,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:18,314 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:18,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 01:54:18,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:18,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:18,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1790054448, now seen corresponding path program 1 times [2024-10-14 01:54:18,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:18,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053385280] [2024-10-14 01:54:18,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:18,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:18,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:54:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:54:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:18,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 01:54:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 01:54:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:18,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053385280] [2024-10-14 01:54:18,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053385280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:54:18,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:54:18,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 01:54:18,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146798388] [2024-10-14 01:54:18,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:54:18,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 01:54:18,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:18,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 01:54:18,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 01:54:18,734 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:18,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:18,823 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-10-14 01:54:18,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 01:54:18,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-10-14 01:54:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:18,825 INFO L225 Difference]: With dead ends: 34 [2024-10-14 01:54:18,825 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 01:54:18,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 01:54:18,829 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:18,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:54:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 01:54:18,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2024-10-14 01:54:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:54:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-14 01:54:18,837 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 26 [2024-10-14 01:54:18,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:18,838 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-14 01:54:18,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-14 01:54:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 01:54:18,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:18,839 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:18,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 01:54:18,839 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:18,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:18,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1790056122, now seen corresponding path program 1 times [2024-10-14 01:54:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:18,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753707093] [2024-10-14 01:54:18,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:18,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:19,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:54:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:19,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:54:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:19,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 01:54:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:19,548 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 01:54:19,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:19,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753707093] [2024-10-14 01:54:19,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753707093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:54:19,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:54:19,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 01:54:19,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152252552] [2024-10-14 01:54:19,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:54:19,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 01:54:19,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:19,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 01:54:19,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-14 01:54:19,550 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:19,718 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-10-14 01:54:19,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 01:54:19,718 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-10-14 01:54:19,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:19,719 INFO L225 Difference]: With dead ends: 29 [2024-10-14 01:54:19,720 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 01:54:19,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 01:54:19,721 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:19,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 82 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:54:19,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 01:54:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-14 01:54:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:54:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-10-14 01:54:19,727 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 26 [2024-10-14 01:54:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:19,727 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-10-14 01:54:19,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-10-14 01:54:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 01:54:19,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:19,728 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:19,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 01:54:19,728 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:19,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1086442489, now seen corresponding path program 1 times [2024-10-14 01:54:19,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:19,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877756877] [2024-10-14 01:54:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:19,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:54:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:19,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:54:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:19,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 01:54:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 01:54:19,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877756877] [2024-10-14 01:54:19,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877756877] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202571764] [2024-10-14 01:54:19,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:19,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:19,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:19,916 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-10-14 01:54:19,917 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-10-14 01:54:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:20,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 01:54:20,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:20,162 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 16 treesize of output 8 [2024-10-14 01:54:20,169 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:54:20,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 01:54:20,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202571764] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:54:20,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:54:20,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 10 [2024-10-14 01:54:20,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355956553] [2024-10-14 01:54:20,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:54:20,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 01:54:20,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:20,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 01:54:20,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 01:54:20,226 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 01:54:24,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:54:28,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:54:32,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:54:36,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:54:40,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:54:44,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:54:48,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:54:48,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:48,463 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-10-14 01:54:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 01:54:48,464 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-10-14 01:54:48,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:48,465 INFO L225 Difference]: With dead ends: 39 [2024-10-14 01:54:48,465 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 01:54:48,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-14 01:54:48,466 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:48,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 137 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 7 Unknown, 0 Unchecked, 28.1s Time] [2024-10-14 01:54:48,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 01:54:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-10-14 01:54:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:54:48,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-14 01:54:48,472 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 27 [2024-10-14 01:54:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:48,473 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-14 01:54:48,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 01:54:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-14 01:54:48,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 01:54:48,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:48,474 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:48,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 01:54:48,674 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,SelfDestructingSolverStorable6 [2024-10-14 01:54:48,675 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:48,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:48,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1086444163, now seen corresponding path program 1 times [2024-10-14 01:54:48,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:48,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798700904] [2024-10-14 01:54:48,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:48,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:49,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:54:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:49,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:54:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:49,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 01:54:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 01:54:49,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:49,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798700904] [2024-10-14 01:54:49,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798700904] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:49,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298182601] [2024-10-14 01:54:49,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:49,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:49,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:49,871 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-10-14 01:54:49,874 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-10-14 01:54:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:50,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-10-14 01:54:50,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:50,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:54:50,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:54:50,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 01:54:50,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 01:54:50,433 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 11 treesize of output 3 [2024-10-14 01:54:50,597 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 01:54:50,598 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 20 treesize of output 23 [2024-10-14 01:54:50,636 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 01:54:50,636 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 15 treesize of output 15 [2024-10-14 01:54:50,909 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 39 treesize of output 15 [2024-10-14 01:54:50,963 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 27 treesize of output 15 [2024-10-14 01:54:50,970 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-10-14 01:54:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:54:51,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:51,065 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_813) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-10-14 01:54:51,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298182601] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:51,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:54:51,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 33 [2024-10-14 01:54:51,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387697979] [2024-10-14 01:54:51,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:54:51,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-14 01:54:51,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:51,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-14 01:54:51,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1199, Unknown=34, NotChecked=70, Total=1406 [2024-10-14 01:54:51,342 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 33 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 01:54:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:51,899 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-10-14 01:54:51,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 01:54:51,900 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2024-10-14 01:54:51,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:51,901 INFO L225 Difference]: With dead ends: 38 [2024-10-14 01:54:51,901 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 01:54:51,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=144, Invalid=1718, Unknown=34, NotChecked=84, Total=1980 [2024-10-14 01:54:51,903 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:51,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 242 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 01:54:51,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 01:54:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-10-14 01:54:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:54:51,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-10-14 01:54:51,911 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 27 [2024-10-14 01:54:51,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:51,911 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-10-14 01:54:51,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 01:54:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-10-14 01:54:51,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 01:54:51,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:51,913 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:51,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 01:54:52,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:52,117 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:52,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:52,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2037919669, now seen corresponding path program 1 times [2024-10-14 01:54:52,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:52,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739627923] [2024-10-14 01:54:52,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:52,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:52,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:54:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:52,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:54:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:52,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 01:54:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 01:54:52,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:52,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739627923] [2024-10-14 01:54:52,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739627923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:54:52,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:54:52,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 01:54:52,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351030569] [2024-10-14 01:54:52,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:54:52,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 01:54:52,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:52,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 01:54:52,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:54:52,268 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:52,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:52,308 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-10-14 01:54:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 01:54:52,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-14 01:54:52,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:52,309 INFO L225 Difference]: With dead ends: 43 [2024-10-14 01:54:52,309 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 01:54:52,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:54:52,310 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:52,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 40 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:54:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 01:54:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-10-14 01:54:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:54:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-10-14 01:54:52,326 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 28 [2024-10-14 01:54:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:52,326 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-10-14 01:54:52,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-10-14 01:54:52,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 01:54:52,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:52,327 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:52,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 01:54:52,327 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:52,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:52,328 INFO L85 PathProgramCache]: Analyzing trace with hash 806568216, now seen corresponding path program 2 times [2024-10-14 01:54:52,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:52,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5945791] [2024-10-14 01:54:52,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:52,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:52,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:54:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:52,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:54:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:52,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 01:54:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 01:54:52,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:52,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5945791] [2024-10-14 01:54:52,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5945791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:54:52,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:54:52,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 01:54:52,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179545391] [2024-10-14 01:54:52,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:54:52,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 01:54:52,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:52,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 01:54:52,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:54:52,475 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:52,523 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-10-14 01:54:52,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:54:52,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-14 01:54:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:52,524 INFO L225 Difference]: With dead ends: 42 [2024-10-14 01:54:52,524 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 01:54:52,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 01:54:52,525 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:52,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 43 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:54:52,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 01:54:52,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-10-14 01:54:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:54:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-14 01:54:52,531 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 28 [2024-10-14 01:54:52,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:52,531 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-14 01:54:52,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:52,532 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-14 01:54:52,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 01:54:52,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:52,533 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:52,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 01:54:52,533 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:52,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:52,533 INFO L85 PathProgramCache]: Analyzing trace with hash 395820500, now seen corresponding path program 1 times [2024-10-14 01:54:52,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:52,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063689847] [2024-10-14 01:54:52,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:52,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:53,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:54:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:53,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:54:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:53,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 01:54:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 01:54:53,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063689847] [2024-10-14 01:54:53,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063689847] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719134147] [2024-10-14 01:54:53,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:53,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:53,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:53,380 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-10-14 01:54:53,382 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-10-14 01:54:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:53,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 01:54:53,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:53,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:54:53,725 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 01:54:53,807 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 18 treesize of output 4 [2024-10-14 01:54:53,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 01:54:53,927 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 01:54:53,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 15 [2024-10-14 01:54:53,936 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 27 treesize of output 22 [2024-10-14 01:54:54,059 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2024-10-14 01:54:54,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 47 [2024-10-14 01:54:54,164 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 62 treesize of output 46 [2024-10-14 01:54:54,170 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 46 treesize of output 34 [2024-10-14 01:54:54,185 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-10-14 01:54:54,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 39 treesize of output 39 [2024-10-14 01:54:54,202 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 7 treesize of output 3 [2024-10-14 01:54:54,239 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 20 treesize of output 8 [2024-10-14 01:54:54,242 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:54:54,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719134147] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:54,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:54:54,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 33 [2024-10-14 01:54:54,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465928420] [2024-10-14 01:54:54,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:54:54,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-14 01:54:54,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:54,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-14 01:54:54,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1153, Unknown=19, NotChecked=0, Total=1260 [2024-10-14 01:54:54,552 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 33 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 01:54:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:55,245 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-10-14 01:54:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 01:54:55,245 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2024-10-14 01:54:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:55,247 INFO L225 Difference]: With dead ends: 36 [2024-10-14 01:54:55,247 INFO L226 Difference]: Without dead ends: 33 [2024-10-14 01:54:55,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=153, Invalid=1990, Unknown=19, NotChecked=0, Total=2162 [2024-10-14 01:54:55,249 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:55,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 298 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 01:54:55,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-14 01:54:55,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-10-14 01:54:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:54:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-14 01:54:55,255 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 29 [2024-10-14 01:54:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:55,255 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-14 01:54:55,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 01:54:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-14 01:54:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 01:54:55,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:55,256 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:55,272 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-10-14 01:54:55,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:55,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:55,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:55,458 INFO L85 PathProgramCache]: Analyzing trace with hash 395822174, now seen corresponding path program 1 times [2024-10-14 01:54:55,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:55,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581717990] [2024-10-14 01:54:55,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:55,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:56,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:54:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:56,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:54:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:56,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 01:54:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:54:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581717990] [2024-10-14 01:54:56,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581717990] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621532936] [2024-10-14 01:54:56,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:56,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:56,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:56,972 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-10-14 01:54:56,973 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-10-14 01:54:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:57,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-10-14 01:54:57,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:57,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:54:57,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 01:54:57,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:54:57,575 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 01:54:57,576 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 15 treesize of output 15 [2024-10-14 01:54:57,873 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 24 treesize of output 11 [2024-10-14 01:54:57,884 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:54:57,891 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:54:57,972 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 137 treesize of output 89 [2024-10-14 01:54:57,991 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 01:54:57,991 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 79 treesize of output 68 [2024-10-14 01:54:57,997 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 39 treesize of output 15 [2024-10-14 01:54:58,002 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 24 treesize of output 11 [2024-10-14 01:54:58,062 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 27 treesize of output 15 [2024-10-14 01:54:58,066 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 7 treesize of output 3 [2024-10-14 01:54:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:54:58,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:58,255 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1352 Int) (v_ArrVal_1350 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_1352)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1349) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1350) .cse0) .cse1))))) is different from false [2024-10-14 01:54:58,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:54:58,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 78 [2024-10-14 01:54:58,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:54:58,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 150 treesize of output 149 [2024-10-14 01:54:58,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:54:58,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 116 [2024-10-14 01:54:58,288 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 56 treesize of output 48 [2024-10-14 01:54:58,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:54:58,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 200 treesize of output 185 [2024-10-14 01:54:58,312 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 39 treesize of output 31 [2024-10-14 01:55:06,368 INFO L349 Elim1Store]: treesize reduction 180, result has 84.1 percent of original size [2024-10-14 01:55:06,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 13 new quantified variables, introduced 79 case distinctions, treesize of input 2553 treesize of output 3024 [2024-10-14 01:55:08,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:55:08,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 2132 treesize of output 3126 [2024-10-14 01:55:08,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:55:08,762 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 1879 treesize of output 1876 [2024-10-14 01:55:09,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:55:09,304 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 1887 treesize of output 1888 [2024-10-14 01:55:09,792 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 1879 treesize of output 1877 [2024-10-14 01:55:10,386 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 1897 treesize of output 1891 [2024-10-14 01:55:10,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:55:10,872 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 1921 treesize of output 1922 [2024-10-14 01:55:11,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:55:11,446 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 1953 treesize of output 1950 [2024-10-14 01:55:11,952 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 1941 treesize of output 1939 [2024-10-14 01:55:12,467 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 1959 treesize of output 1953 [2024-10-14 01:55:12,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:55:12,953 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 1973 treesize of output 1974 [2024-10-14 01:55:13,389 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 1965 treesize of output 1963 [2024-10-14 01:55:13,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:55:13,834 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 1993 treesize of output 1994 [2024-10-14 01:55:14,263 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 1995 treesize of output 1993 [2024-10-14 01:55:14,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:55:14,744 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 2013 treesize of output 2014 [2024-10-14 01:55:15,196 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 2015 treesize of output 2013 [2024-10-14 01:55:15,658 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 2033 treesize of output 2027